Quantifying the Performance Differences Between PVM and TreadMarks

Quantifying the Performance Differences Between PVM and TreadMarks (1997)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Honghui Lu , Sandhya Dwarkadas , Alan L. Cox , Willy Zwaenepoel

Citations:

36 - 5 self

BibTeX

@MISC{Lu97quantifyingthe,
    author = {Honghui Lu and Sandhya Dwarkadas and Alan L. Cox and Willy Zwaenepoel},
    title = {Quantifying the Performance Differences Between PVM and TreadMarks},
    year = {1997}
}

Bookmark

OpenURL

Abstract

This paper compares two systems for parallel programming on networks of workstations: Parallel Virtual Machine (PVM), a message passing system, and TreadMarks, a software distributed shared memory (DSM) system. The eight applications used in this comparison 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) and Traveling Salesman (TSP). Two different input data sets are used for five of the applications. We use two execution environments. The first is a 155Mbps ATM network with eight Sparc-20 model 61 workstations; the second is an eight processor IBM SP/2. The differences in speedup between TreadMarks and PVM depend mostly on the application, and, only to a much lesser extent, on the platform and the data set used. In particular, the TreadMarks speedup for six of the eight applications is within 15% of t...

Citations

848	Memory Coherence in Shared Virtual Memory Systems - Li, Hudak - 1989
689	SPLASH: Stanford Parallel Applications for Shared Memory - Singh, Weber, et al. - 1992
628	Memory Consistency and Event Ordering in Scalable Shared-Memory - Gharachorloo, Lenoski, et al. - 1990
521	The NAS parallel benchmarks - Bailey, Barszcz, et al. - 1994
405	TreadMarks: Shared memory computing on networks of workstations - Amza, Cox, et al. - 1996
286	Tempest and Typhoon: User-level shared memory - Reinhart, Larus, et al. - 1994
213	Weak Ordering - A New Definition - Adve, Hill - 1990
160	et al. The Stanford FLASH Multiprocessor - Kuskin, Ofelt, et al. - 1994
112	Reducing false sharing on shared memory multiprocessors through compile time data transformations - Jeremiassen, Eggers - 1995
98	Analysis of Cache Invalidation Patterns in Multiprocessors - Weber, Gupta - 1989
93	Software write detection for a distributed shared memory - Zekauskas, Sawdon, et al. - 1994
85	Integrating Message-Passing and Shared-Memory; Early Experience - Kranz, Johnson, et al. - 1993
76	An integrated compile-time/run-time software distributed shared memory system - Dwarkadas, Cox, et al. - 1996
54	Network-based concurrent computing on the PVM system - GEIST, S - 1992
52	Message passing versus distributed shared memory on networks of workstations - Lu, Dwarkadas, et al. - 1995
51	Where is time spent in messagepassing and shared-memory programs - Chandra, Larus, et al. - 1994
36	Parallelization of General Linkage Analysis Problems - Dwarkadas, Schaffer, et al. - 1994
35	Techniques for reducing consistencyrelated information in distributed shared memory systems - Carter, Bennett, et al. - 1995
34	Implications of hierarchical Nbody methods for multiprocessor architecture - Singh, Hennessy, et al. - 1992
32	Strategies for Multilocus Linkage Analysis in Humans - Lathrop, Lalouel, et al. - 1984
27	An evaluation of softwarebased release consistent protocols - Keleher, Cox, et al. - 1995
26	Portable Tools and Applications for Parallel Computers - Harrison
19	A comparison of message passing and shared memory for data-parallel programs - Klaiber, Levy - 1994
15	Tradeoffs in message passing and shared memory implementations of a standard cell router - Martonosi, Gupta - 1989
12	Faster sequential genetic linkage computations - Jr, Idury, et al. - 1993
9	Nonsyndromic cleft lip and palate: No evidence of linkage to hla or factor 13a - Hecht, Wang, et al. - 1993
4	Express user's guide, version 3.2.5 - Corporation, Pasadena - 1992