Distributed Shared Memory: A Survey of Issues and Algorithms
dc.contributor.author | Lo, Virginia M. | |
dc.contributor.author | Nitzberg, Bill | |
dc.date.accessioned | 2023-06-20T20:05:43Z | |
dc.date.available | 2023-06-20T20:05:43Z | |
dc.date.issued | 1991-01-07 | |
dc.description | 26 pages | en_US |
dc.description.abstract | A distributed shared memory (DSM) is an implementation of the shared memory abstraction on a multicomputer architecture which has no physically shared memory. Shared memory is important (as a programming model) not only because of the vast number of existing applications which use it, but also because it is a more appropriate paradigm for certain algorithms. The DSM concept was demonstrated to be viable by Li, in IVY. Recently, there has been a surge of new projects which implement DSM in a variety of software and hardware environments. This paper gives an integrated overview of distributed shared memory. We discuss theoretical lower bounds on the performance of DSM systems, design choices such as structure and granularity, access, coherence semantics, scalability, and heterogeneity, and open problems in DSM. In addition, we describe algorithms used to implement and improve efficiency: reducing thrashing, eliminating false sharing, matching the coherence protocol to the type of sharing, and relaxing the semantics of the memory coherence provided. A spectrum of current DSM systems are used as illustrative examples. | en_US |
dc.identifier.uri | https://hdl.handle.net/1794/28433 | |
dc.language.iso | en | en_US |
dc.publisher | University of Oregon | en_US |
dc.rights | Creative Commons BY-NC-ND 4.0-US | en_US |
dc.subject | distributed shared memory (DSM) | en_US |
dc.subject | cache coherence | en_US |
dc.subject | synchronization | en_US |
dc.subject | memory consistency | en_US |
dc.subject | distributed systems | en_US |
dc.subject | preprint | en_US |
dc.title | Distributed Shared Memory: A Survey of Issues and Algorithms | en_US |
dc.type | Article | en_US |