(Enter summary)
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,... (Update)
Context of citations to this paper: More
.... memory and messagepassing implementations of the same application has resorted to either using the same machine to run different simulators [8] or using different machines to run different simulators [19] The Stanford FLASH multiprocessor [17] also efficiently supports these...
.... that Message Passing scheme results in better performance than Shared Memory scheme, which is true for several applications as shown in [4]. However, there is no clear indication yet on the differences in performance between these two schemes running the same PEA. So we...
Cited by: More
Parallel Evolutionary Algorithms on Message-Passing Clusters - Jason Digalakis And (2003)
(Correct)
Parallel Evolutionary Algorithms on MPI - Digalakis, Margaritis (2003)
(Correct)
A Case Study of Shared Mmeory and Message Passing: The Triangle.. - Lew
(Correct)
Active bibliography (related documents): More All
0.5: Paging Tradeoffs in Distributed-Shared-Memory.. - Burger, Hyder, Miller, Wood (1994)
(Correct)
0.2: A Comparison of MPI, SHMEM and Cache-coherent Shared.. - Hongzhang Shan And
(Correct)
0.2: Architectural Support for Compiler-Generated Data-Parallel Programs - Klaiber (1994)
(Correct)
Similar documents based on text: More All
0.3: CICO: A Practical Shared-Memory Programming Performance Model - Larus, Chandra, Wood (1993)
(Correct)
0.2: A Taxonomy of Programming Models for Symmetric Multiprocessors.. - Gropp, Lusk (1995)
(Correct)
0.2: Written Preliminary Exam II: Software Distributed Shared Memory - Marks (2001)
(Correct)
Related documents from co-citation: More All
21: Tempest and Typhoon: User-Level Shared Memory
- Reinhardt, Larus et al. - 1994
20: The Stanford Dash Multiprocessor (context) - Lenoski, Laudon et al. - 1992
19: The Stanford FLASH Multiprocessor (context) - Kuskin - 1994
BibTeX entry: (Update)
Satish Chandra, James R. Larus, and Anne Rogers. Where is Time Spent in Message-Passing and Shared-Memory Programs? In Proceedings of the Sixth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS VI), pages 61--75, October 1994. http://citeseer.ist.psu.edu/chandra94where.html More
@inproceedings{ chandra94where,
author = "Satish Chandra and James R. Larus and Anne Rogers",
title = "Where is Time Spent in Message-Passing and Shared-Memory Programs",
booktitle = "{Proceedings of the Sixth International Conference on Architectural Support for Programming Languages and Operating Systems}",
address = "San Jose, California",
pages = "61--73",
year = "1994",
url = "citeseer.ist.psu.edu/chandra94where.html" }
Citations (may not include all citations):
531
LogP: Toward a Realistic Model of Parallel Computation
- Culler, Karp et al. - 1993
341
Parallel Programming in Split-C
- Culler, Dusseau et al. - 1993
275
Virtual Memory Mapped Network Interface for the SHRIMP Multi..
- Blumrich, Li et al. - 1994
268
Tempest and Typhoon: User-Level Shared Memory
- Reinhardt, Larus et al. - 1994
239
Algorithms for Scalable Synchronization on Shared-Memory Mul.. (context) - Mellor-Crummey, Scott - 1991
166
The Wisconsin Wind Tunnel: Virtual Prototyping of Parallel C..
- Reinhardt, Hill et al. - 1993
156
An Evaluation of Directory Schemes for Cache Coherence
- Agarwal, Simoni et al. - 1988
96
Integrating Message-Passing and Shared-Memory: Early Experie..
- Kranz, Johnson et al. - 1993
95
Application-Specific Protocols for UserLevel Shared Memory
- Falsafi, Lebeck et al. - 1994
33
A Comparison of Programming Models for Shared Memory Multipr.. (context) - Lin, Snyder - 1990
29
Protocol Compilation: HighPerformance Communication for Para..
- Felten - 1993
28
Active Messages: a Mechanism for Integrating Communication a.. (context) - von Eicken, Culler et al. - 1992
22
A Distributed Memory LAPSE: Parallel Simulation of Message-P..
- Dickens, Heidelberger et al. - 1994
19
The CM-5 Connection Machine: A Scalable Supercomputer (context) - Hillis, Tucker - 1993
18
the Influence of Programming Models on Shared Memory Compute.. (context) - Ngo, Snyder - 1992
16
A Comparison of Message Passing and Shared Memory Architectu..
- Klaiber, Levy - 1994
16
Tradeoffs in Message Passing and Shared Memory Implementatio..
- Martonosi, Gupta - 1989
15
Intel Supercomputer Systems Division (context) - Corporation, Summary - 1993
13
Message Passing in Shared-Memory Multiprocessors (context) - LeBlanc, Markatos et al. - 1992
8
The Performance Advantages of Integrating Message Passing in.. (context) - Woo, Singh et al. - 1993
5
MultiSweep Asynchronous Parallel Successive Overrelaxation f.. (context) - De Leone, Mangasarian et al. - 1990
2
Parallel Programming Models and Boundary Integral Equation M.. (context) - Traenkle - 1993
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.math.jussieu.fr/~fermigie/fermivista/ftp/ftp.cs.princeton.edu.html): More
Reactive Synchronization Algorithms for Multiprocessors - Lim (1994)
(Correct)
Understanding Language Support for Irregular Parallelism - Raghavachari, Rogers (1995)
(Correct)
Link-Time Optimization of Modula-3 Programs - Fernandez, Hanson
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC