A comparison of MPI, SHMEM and cache-coherent shared address space programming models on the SGI Origin2000
- 1 May 1999
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 329-338
- https://doi.org/10.1145/305138.305210
Abstract
We compare the performance of three major programming models— a load-store cache-coherent shared address space (CC-SAS), mes- sage passing (MP) and the segmented SHMEM model—on a mod- ern, 64-processor hardware cache-coherent machine, one of the two major types of platforms upon which high-performance comput- ing is converging. We focus on applications that are either regu- lar and predictable or at least do not require fine-grained dynamic replication of irregularly accessed data. Within this class, we use programs with a range of important communication patterns. We examine whether the basic parallel algorithm and communication structuring approaches needed for best performance are similar or different among the models, whether some models have substantial performance advantages over others as problem size and number of processors change, what the sources of these performance dif- ferences are, where the programs spend their time, and whether substantial improvements can be obtained by modifying either the application programming interfaces or the implementations of the programming models on this type of platform.Keywords
This publication has 10 references indexed in Scilit:
- On the influence of programming models on shared memory computer performancePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Quantifying the Performance Differences between PVM and TreadMarksJournal of Parallel and Distributed Computing, 1997
- Implications of hierarchical N-body methods for multiprocessor architecturesACM Transactions on Computer Systems, 1995
- The SPLASH-2 programsPublished by Association for Computing Machinery (ACM) ,1995
- The performance advantages of integrating block data transfer in cache-coherent multiprocessorsPublished by Association for Computing Machinery (ACM) ,1994
- Where is time spent in message-passing and shared-memory programs?Published by Association for Computing Machinery (ACM) ,1994
- Parallel visualization algorithms: performance and architectural implicationsComputer, 1994
- Integrating message-passing and shared-memoryPublished by Association for Computing Machinery (ACM) ,1993
- A comparison of sorting algorithms for the connection machine CM-2Published by Association for Computing Machinery (ACM) ,1991
- FFTs in external or hierarchical memoryThe Journal of Supercomputing, 1990