Overview of distributed shared memory (1998)
| Venue: | Trinity College Dublin |
| Citations: | 8 - 0 self |
BibTeX
@TECHREPORT{Judge98overviewof,
author = {A Judge and P A Nixon and V J Cahill and B Tangney and S Weber},
title = {Overview of distributed shared memory},
institution = {Trinity College Dublin},
year = {1998}
}
OpenURL
Abstract
So much has already been written about everything that you can't nd out anything about it. | James Thurber, Lanterns and Lances (1961) Loosely-coupled distributed systems haveevolved using message passing as the main paradigm for sharing information. Other paradigms used in loosely-coupled distributed systems, such as rpc, are usually implemented on top of an underlying message-passing system. On the other hand, in tightly-coupled architectures, such asmulti-processor machines, the paradigm is usually based on shared memory with its attractively simple programming model. The shared-memory paradigm has recently been extended for use in more loosely-coupled architectures and is known as distributed shared memory (dsm [153, 178,58]) in this context. This chapter discusses some of the issues involved in the design and implementation of such adsm in loosely-coupled distributed systems and brie y discusses related work in other elds. In dsm systems, processes share data transparently across node boundaries � data faulting, location, and movement are handled by thedsm system. Among other things, this allows parallel programs designed to use the shared-memory abstraction to execute without modi cation on a







