A Survey on Some Recent Advances in Shared Memory Models

2011 ◽  
pp. 17-28
Author(s):  
Sergio Rajsbaum ◽  
Michel Raynal
Keyword(s):  
Shared Memory ◽  
Memory Models ◽  
Recent Advances

scholarly journals Using Shared Memory Abstractions to Design Eager Sequentializations for Weak Memory Models

2017 ◽  
pp. 185-202 ◽  
Author(s):  
Ermenegildo Tomasco ◽  
Truc Lam Nguyen ◽  
Bernd Fischer ◽  
Salvatore La Torre ◽  
Gennaro Parlato
Keyword(s):  
Shared Memory ◽  
Memory Models

Parallel Prefix Algorithms On Arrays

1994 ◽  
Author(s):  
S. Lakshmivarahan ◽  
Sudarshan K. Dhall
Keyword(s):  
Shared Memory ◽  
Input Data ◽  
Analysis Of Algorithms ◽  
Common Knowledge ◽  
Memory Models ◽  
Real Numbers ◽  
Parallel Prefix ◽  
Overall Efficiency ◽  
The Given ◽  
Linked Lists

In the parlance of the design and analysis of algorithms, it is now common knowledge that the type of operations used and the overall efficiency of an algorithm critically depend on the organization of the input data for the given problem. Most of the parallel algorithms for prefix computations exploit one of two different types of data organizations, namely, arrays and linked lists. This chapter examines parallel prefix algorithms based on the shared memory models when the input data is in an array. Corresponding algorithms for linked lists are described in Chapter 4. Let N = 2", for some n ≥ 1. For definiteness, consider the semigroup of real numbers with the usual addition operation.

scholarly journals Recent advances in memory consistency models for hardware shared memory systems

1999 ◽  
Vol 87 (3) ◽  
pp. 445-455 ◽  
Author(s):  
S.V. Adve ◽  
V.S. Pai ◽  
P. Ranganathan
Keyword(s):  
Shared Memory ◽  
Memory Systems ◽  
Memory Consistency ◽  
Recent Advances ◽  
Memory Consistency Models ◽  
Consistency Models
Sign in / Sign up

Export Citation Format

Share Document