Algorithms implementing distributed shared memory
Michael Stumm, S. Zhou · Computer · 1990
Four basic algorithms for implementing distributed shared memory are compared. Conceptually, these algorithms extend local virtual address spaces to span multiple hosts connected by a local area network, and some of them can easily be integrated with the hosts' virtual memory systems. The merits of distributed shared memory and the assumptions made with respect to the environment in which the shared memory algorithms are executed are described. The algorithms are then described, and a comparative analysis of their performance in relation to application-level access behavior is presented. It is shown that the correct choice of algorithm is determined largely by the memory access behavior of the applications. Two particularly interesting extensions of the basic algorithms are described, and some limitations of distributed shared memory are noted.>
Cited by 197 works. doi:10.1109/2.53355
Authors
References
- How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
- Memory coherence in shared virtual memory systems
- Cache coherence protocols: evaluation using a multiprocessor simulation model
- Linda and Friends
- Shared virtual memory on loosely coupled multiprocessors
- Synchronization, coherence, and event ordering in multiprocessors
- Mirage: a coherent distributed shared memory design
- Multilanguage parallel programming of heterogeneous machines
- Problem-oriented Shared Memory: A Decentralized Approach to Distributed System Design.
- An analysis of distributed shared memory algorithms