Message passing versus distributed shared memory on networks of workstations
Honghui Lu, Sandhya Dwarkadas, Alan L. Cox et al. · Proceedings - Supercomputing · 1995
The message passing programs are executed with the Parallel Virtual Machine (PVM) library and the shared memory programs are executed using TreadMarks. The programs are Water and Barnes-Hut from the SPLASH benchmark suite; 3-D FFT, Integer Sort (IS) and Embarrassingly Parallel (EP) from the NAS benchmarks; ILINK, a widely used genetic linkage analysis program; and Successive Over-Relaxation (SOR), Traveling Salesman (TSP), and Quicksort (QSORT). Two different input data sets were used for Water (Water-288 and Water-1728), IS (IS-Small and IS-Large), and SOR (SOR-Zero and SOR-NonZero). Our execution environment is a set of eight HP735 workstations connected by a 100Mbits per second FDDI network. For Water-1728, EP, ILINK, SOR-Zero, and SOR-NonZero, the performance of TreadMarks is within 10%of PVM. For IS-Small, Water-288, Barnes-Hut, 3-D FFT, TSP, and QSORT, differences are on the order of 10%to 30%. Finally, for IS-Large, PVM performs two times better than TreadMarks. More messages and more data are sent in TreadMarks, explaining the performance differences. This extra communication is caused by 1) the separation of synchronization and data transfer, 2) extra messages to request updates for data by the invalidate protocol used in TreadMarks, 3) false sharing, and 4) diff accumulation for migratory data in TreadMarks.
Cited by 96 works. doi:10.1145/224170.224285
Authors
References
- Strategies for multilocus linkage analysis in humans.
- The NAS Parallel Benchmarks
- Faster sequential genetic linkage computations.
- The distributed V kernel and its performance for diskless workstations
- SPLASH
- Memory coherence in shared virtual memory systems
- Memory consistency and event ordering in scalable shared-memory multiprocessors
- Implementation and performance of Munin
- TreadMarks: distributed shared memory on standard workstations and operating systems
- Weak ordering—a new definition