Publication

OpenMP on Networks of SMPs

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.

Contention elimination by replication of sequential sections in distributed shared memory programs

Willy Zwaenepoel

In shared memory programs contention often occurs at the transition between a sequential and a parallel section of the code. As all threads start executing the parallel section, they often access data just modified by the thread that executed the sequentia ...

2001

OpenMP for Networks of SMPs

Willy Zwaenepoel

In this paper, we present the first system that implement OpenMP on network of shared-memory multiprocessors. This system enables the program to rely on a single, standard, shared-memory API for parallelization within a multiprocessor and between multiproc ...

2000

The Effect of Memory Contention on the Scalability of Page-based Software Distributed Shared Memory Systems

Willy Zwaenepoel

In this paper, we examine the causes and effects of contentionfor shared data access in parallel programs running on a software distributed shared memory (DSM) system. Specifically, we experiment on two widely-used, pagebased protocols, Princeton’s home-ba ...

2000

Improving Fine-Grained Irregular Shared-Memory Benchmarks by Data Reordering

Willy Zwaenepoel

We demonstrate that data reordering can substantially improve the performance of fine-grained irregular sharedmemory benchmarks, on both hardware and software shared-memory systems. In particular, we evaluate two distinct data reordering techniques that se ...

2000

OpenMP on Networks of Workstations

Willy Zwaenepoel

We describe an implementation of a sizable subset of OpenMP on networks of workstations (NOWs). By extending the availability of OpenMP to NOWs, we overcome one of its primary drawbacks compared to MPI, namely lack of portability to environments other than ...

1998

Sirocco: cost-effective fine-grain distributed shared memory

Babak Falsafi, James Richard Larus, David Wood

Software fine-grain distributed shared memory (FGDSM) provides a simplified shared-memory programming interface with minimal or no hardware support. Originally software FGDSMs targeted uniprocessor-node parallel machines. This paper presents Sirocco, a fam ...

1998

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

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

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

Geographical information system application of multiprocessor multidisk image servers

Roger Hersch

The article analyses the behavior of two kinds of multiprocessor multidisk storage server architectures for a data intensive application, namely for spatial queries in geographical information systems (GIS). The two kinds of servers are: (1) a workstation ...

Elsevier1996