Comparing distributed memory and virtual shared memory parallel programming models

The virtues of the shared memory and distributed memory parallel programming models have been much debated. Conventionally the debate could be reduced to programming convenience on the one hand, and high scalability factors on the other. More recently the debate has become somewhat blurred with the...

Full description

Saved in:
Bibliographic Details
Published in:Future generation computer systems Vol. 11; no. 2; pp. 233 - 243
Main Authors: Keane, J.A., Grant, A.J., Xu, M.Q.
Format: Journal Article
Language:English
Published: Elsevier B.V 01.03.1995
Subjects:
Distributed memory
Programming convenience
Scalability factors
Shared memory
Virtual Shared Memory
Distributed memory
Virtual Shared Memory
Scalability factors
Shared memory
Programming convenience
ISSN:0167-739X, 1872-7115
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The virtues of the shared memory and distributed memory parallel programming models have been much debated. Conventionally the debate could be reduced to programming convenience on the one hand, and high scalability factors on the other. More recently the debate has become somewhat blurred with the provision of virtual shared memory models built on machines with physically distributed memory. The intension of such models/machines is to provide scalable shared memory, i.e. to provide both programmer convenience and high scalability. In this paper, the different models are considered from experiences gained with a number of systems ranging from applications in both commerce and science to languages and operating systems. Case studies are introduced as appropriate.
ISSN:0167-739X
1872-7115
DOI:10.1016/0167-739X(94)00065-M