Message Passing Versus Distributed Shared Memory on Networks of Workstations (1995)
Cached
Download Links
- [ftp.cs.rice.edu]
- [www.cs.rice.edu]
- [ftp.cs.rice.edu]
- [infoscience.epfl.ch]
- DBLP
Other Repositories/Bibliography
| Venue: | IN PROCEEDINGS SUPERCOMPUTING '95 |
| Citations: | 52 - 10 self |
BibTeX
@INPROCEEDINGS{Lu95messagepassing,
author = {Honghui Lu and Sandhya Dwarkadas and Alan L. Cox and Willy Zwaenepoel},
title = {Message Passing Versus Distributed Shared Memory on Networks of Workstations},
booktitle = {IN PROCEEDINGS SUPERCOMPUTING '95},
year = {1995},
publisher = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We compare two paradigms for parallel programming on networks of workstations: message passing and distributed shared memory. We present results for nine applications that were implemented using both paradigms. 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 i...
