Overview of distributed shared memory

Overview of distributed shared memory (1998)

Cached

Download Links

by A Judge , P A Nixon , V J Cahill , B Tangney , S Weber

Venue:	Trinity College Dublin
Citations:	8 - 0 self

Versions

Version History

Metadata Version 1

Datum	Value	Source
TITLE	Overview of distributed shared memory	SVM HeaderParse 0.2
AUTHOR NAME	A Judge	SVM HeaderParse 0.2
AUTHOR AFFIL	Distributed Systems Group,; Dept. of Computer Science,; Trinity College, Dublin,; Ireland,	SVM HeaderParse 0.2
AUTHOR NAME	P A Nixon	SVM HeaderParse 0.2
AUTHOR AFFIL	Distributed Systems Group,; Dept. of Computer Science,; Trinity College, Dublin,; Ireland,	SVM HeaderParse 0.2
AUTHOR NAME	V J Cahill	SVM HeaderParse 0.2
AUTHOR AFFIL	Distributed Systems Group,; Dept. of Computer Science,; Trinity College, Dublin,; Ireland,	SVM HeaderParse 0.2
AUTHOR NAME	B Tangney	SVM HeaderParse 0.2
AUTHOR AFFIL	Distributed Systems Group,; Dept. of Computer Science,; Trinity College, Dublin,; Ireland,	SVM HeaderParse 0.2
AUTHOR NAME	S Weber	SVM HeaderParse 0.2
AUTHOR AFFIL	Distributed Systems Group,; Dept. of Computer Science,; Trinity College, Dublin,; Ireland,	SVM HeaderParse 0.2
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	SVM HeaderParse 0.2
YEAR	1998	SVM HeaderParse 0.2
VENUE	Trinity College Dublin	INFERENCE
VENUE TYPE	TECHREPORT	INFERENCE
VOLUME	19	INFERENCE
TECH	Technical report	INFERENCE
CITATIONS	210 found	ParsCit 1.0