A comparison of distributed memory and virtual shared memory parallel programming models
- Univ. of Manchester (United Kingdom). Dept. of Computer Science
- Univ. of Manchester (United Kingdom). Computer Graphics Unit
- Argonne National Lab., IL (United States)
The virtues of the different parallel programming models, shared memory and distributed memory, have been much debated. Conventionally the debate could be reduced to programming convenience on the one hand, and high salability 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 intention of such models/machines is to provide scalable shared memory, i.e. to provide both programmer convenience and high salability. In this paper, the different models are considered from experiences gained with a number of system ranging from applications in both commerce and science to languages and operating systems. Case studies are introduced as appropriate.
- Research Organization:
- Argonne National Lab., IL (United States)
- Sponsoring Organization:
- USDOE, Washington, DC (United States)
- DOE Contract Number:
- W-31109-ENG-38
- OSTI ID:
- 10116999
- Report Number(s):
- ANL/MCS/CP-81645; CONF-9304227-1; ON: DE94005473; TRN: 94:001963
- Resource Relation:
- Conference: 4. Meiko User Society conference,Southampton (United Kingdom),Apr 1993; Other Information: PBD: Apr 1993
- Country of Publication:
- United States
- Language:
- English
Similar Records
Global Arrays Parallel Programming Toolkit
IMPACC: A Tightly Integrated MPI+OpenACC Framework Exploiting Shared Memory Parallelism