Publication

The Wisconsin Wind Tunnel: Virtual Prototyping of Parallel Computers

Related publications (95)

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.

Protocol-based Data-race Detection

James Richard Larus

Distributed Shared-Memory (DSM) computers, which partition physical memory among a collection of workstationlike computing nodes, are now a common way to implement parallel machines. Recently, there has been much interest in DSM machines that use software, ...

ACM1998

Quantifying the Performance Differences Between PVM and TreadMarks

Willy Zwaenepoel, Sandhya Dwarkadas

We compare 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. We present results for eight applications that were imp ...

1997

Shared-Memory Performance Profiling

James Richard Larus

This paper describes a new approach to finding performance bottlenecks in shared-memory parallel programs and its embodiment in the Paradyn Parallel Performance Tools running with the Blizzard fine-grain distributed shared memory system. This approach expl ...

ACM1997

Experience with a Language for Writing Coherence Protocols

James Richard Larus

In this paper we describe our experience with Teapot [7], a domain-specific language for writing cache coherence protocols. Cache coherence is of concern when parallel and distributed computing systems make local replicas of shared data to improve scalabil ...

Usenix1997

Optimizing Communication in HPF programs for Fine-Grain Distributed Shared Memory

James Richard Larus

Unlike compiler-generated message-passing code, the coherence mechanisms in shared-memory systems work equally well for regular and irregular programs. In many programs, however compile-time information about data accesses would permit data to be transferr ...

ACM1997

Tradeoffs between False Sharing and Aggregation in Software Distributed Shared Memory

Willy Zwaenepoel

Software Distributed Shared Memory (DSM) systems based on virtual memory techniques traditionally use the hardware page as the consistency unit. The large size of the hardware page is considered to be a performance bottleneck because of the implied false s ...

1997

Wisconsin Wind Tunnel II: A Fast and Portable Parallel Architecture Simulator

Babak Falsafi, James Richard Larus, David Wood

The design of future parallel computers requires rapid simulation of target designs running realistic workloads. These simulations have been accelerated using two techniques: direct execution and the use of a parallel host. Historically, these techniques h ...

1997

Modeling cost/performance of a parallel computer simulator

Babak Falsafi, David Wood

This article examines the cost/performance of simulating a hypothetical target parallel computer using a commercial host parallel computer. We address the question of whether parallel simulation is simply faster than sequential simulation, or if it is also ...

1997

The Tempest Approach to Distributed Shared Memory

James Richard Larus, David Wood

This paper summarizes how distributed shared memory (DSM) can be both efficiently and portably supported by the Tempest interface. Tempest is a collection of mechanisms for communication and synchronization in parallel programs. These mechanisms provide co ...

IEEE1996

TreadMarks: Shared Memory Computing on Networks of Workstations

Willy Zwaenepoel, Sandhya Dwarkadas

TreadMarks supports parallel computing on networks of workstations by providing the application with a shared memory abstraction. Shared memory facilitates the transition from sequential to parallel programs. After identifying possible sources of paralleli ...

1996