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.

Specification of the Behavior of Memory Operations in Distributed Systems

1998 ◽  
Vol 08 (04) ◽  
pp. 589-598 ◽  
Author(s):  
Vicent Cholvi
Keyword(s):  
Distributed Systems ◽  
Shared Memory ◽  
Memory Models ◽  
Memory Model ◽  
Communication Model ◽  
Dual Approach ◽  
Process Communication ◽  
Correctness Proofs ◽  
Feasible Alternative ◽  
Inter Process Communication

Shared memory is a mechanism used for inter-process communication in distributed systems which is considered a feasible alternative to the traditional communication model. However, most of the work on shared memory has not paid enough attention to the way memory operations behave, leading to some degree of confusion. In this paper, we describe a framework for specifying the behavior of memory operations. That framework has been used to formally specify some of the most significant memory models. In this framework, to characterize a memory model it is enough to specify the executions that it allows. We use a dual approach. First, we provide axiomatic definitions of those memory models; then, we provide operational ones. Whereas axiomatic definitions are simple and intuitive, operational definitions are more convenient for being used in correctness proofs. We show that both approaches are equivalent.

Sign in / Sign up

Export Citation Format

Share Document