Publication

Compiler-directed Shared-Memory Communication for Iterative Parallel Applications

Related publications (42)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Where is Time Spent in Message-Passing and Shared-Memory Programs?

James Richard Larus

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 p ...

ACM1994

Tempest and Typhoon: User-Level Shared Memory

James Richard Larus, David Wood

Future parallel computers must efficiently execute not only hand-coded applications but also programs written in high-level, parallel programming languages. Today’s machines limit these programs to a single communication paradigm, either message-passing or ...

ACM1994

LCM: Memory System Support for Parallel Language Implementation

James Richard Larus

Higher-level parallel programming languages can be difficult to implement efficiently on parallel machines. This paper shows how a flexible, compiler-controlled memory system can help achieve good performance for language constructs that previously appeare ...

ACM1994

TreadMarks: Distributed Shared Memory on Standard Workstations and Operating Systems

Sandhya Dwarkadas

TreadMarks is a distributed shared memory (DSM) system for standard Unix systems such as SunOS and Ultrix. This paper presents a performance evaluation of TreadMarks running on Ultrix using DECstation-5000/240's that are connected by a 100-Mbps switch-base ...

1994

TreadMarks: Distributed Shared Memory on Standard Workstations and Operating Systems

Willy Zwaenepoel, Sandhya Dwarkadas

1994

The Wisconsin Wind Tunnel: Virtual Prototyping of Parallel Computers

James Richard Larus, David Wood

We have developed a new technique for evaluating cache coherent, shared-memory computers. The Wisconsin Wind Tunnel (WWT) runs a parallel shared-memory program on a parallel computer (CM-5) and uses execution-driven, distributed, discrete-event simulation ...

ACM1993

Cooperative Shared Memory: Software and Hardware for Scalable Multiprocessors

James Richard Larus, David Wood

We believe the paucity of massively parallel, shared-memory machines follows from the lack of a shared-memory programming performance model that can inform programmers of the cost of operations (so they can avoid expensive ones) and can tell hardware desig ...

ACM1993

Cooperative Shared Memory: Software and Hardware for Scalable Multiprocessors

James Richard Larus, David Wood

We believe the absence of massively-parallel, shared-memory machines follows from the lack of a shared-memory programming performance model that can inform programmers of the cost of operations (so they can avoid expensive ones) and can tell hardware desig ...

ACM1992

Dynamic Program Parallelization

James Richard Larus

Static program analysis limits the performance improvements possible from compile-time parallelization. Dynamic program parallelization shifts a portion of the analysis from complie-time to run-time, thereby enabling optimizations whose static detection is ...

ACM1992

Implementation and Performance of Munin

Willy Zwaenepoel

Munin is a distributed shared memory (DSM) system that allows shared memory parallel programs to be executed efficiently on distributed memory multiprocessors. Munin is unique among existing DSM systems in its use of multiple consistency protocols and in ...

1991