Where is time spent in message-passing and shared-memory programs?
- 1 November 1994
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGOPS Operating Systems Review
- Vol. 28 (5) , 61-73
- https://doi.org/10.1145/381792.195501
Abstract
Message passing and shared memory are two techniques parallel programs use for coordination and communication. This paper studies the strengths and weaknesses of these two mechanisms by comparing equivalent, well-written message-passing and shared-memory programs running on similar hardware. To ensure that our measurements are comparable, we produced two carefully tuned versions of each program and measured them on closely-related simulators of a message-passing and a shared-memory machine, both of which are based on same underlying hardware assumptions. We examined the behavior and performance of each program carefully. Although the cost of computation in each pair of programs was similar, synchronization and communication differed greatly. We found that message-passing's advantage over shared-memory is not clear-cut. Three of the four shared-memory programs ran at roughly the same speed as their message-passing equivalent, even though their communication patterns were different.Keywords
This publication has 10 references indexed in Scilit:
- A distributed memory LAPSEPublished by Association for Computing Machinery (ACM) ,1994
- Cooperative shared memoryACM Transactions on Computer Systems, 1993
- The CM-5 Connection MachineCommunications of the ACM, 1993
- The Wisconsin Wind TunnelPublished by Association for Computing Machinery (ACM) ,1993
- Parallel programming in Split-CPublished by Association for Computing Machinery (ACM) ,1993
- Integrating message-passing and shared-memoryPublished by Association for Computing Machinery (ACM) ,1993
- LogP: towards a realistic model of parallel computationPublished by Association for Computing Machinery (ACM) ,1993
- Active messagesPublished by Association for Computing Machinery (ACM) ,1992
- Algorithms for scalable synchronization on shared-memory multiprocessorsACM Transactions on Computer Systems, 1991
- Multi-sweep asynchronous parallel successive overrelaxation for the nonsymmetric linear complementarity problemAnnals of Operations Research, 1990