Publication

An Evaluation of Software Distributed Shared Memory for Next-Generation Processors and Networks

Related publications (40)

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.

Fault Tolerance by Transparent Replication for Distributed Ada 95

This paper presents the foundations of Rapids ("Replicated Ada Partitions In Distributed Systems"), an implementation of the Distributed Systems Annex E incorporating the transparent replication of partitions in distributed Ada 95 applications. Rapids is a ...

Springer Verlag1999

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

Soft real-time analysis of asynchronous agreement algorithms using Petri nets

Nicoleta Sergent

A distributed algorithm comprises a collection of sequential-code entities, which are spread over different computers connected to a network. The process of designing a distributed algorithm is influenced by the assumptions we make on the computational env ...

EPFL1998

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

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

Semi-Passive Replication

André Schiper, Xavier Défago, Nicoleta Sergent

This paper presents the semi-passive replication technique -- a variant of passive replication -- that can be implemented in the asynchronous system model without requiring a membership service to agree on a primary. Passive replication is a popular replic ...

1998

Semi-Passive Replication

André Schiper, Xavier Défago, Nicoleta Sergent

This paper presents the semi-passive replication technique -- a variant of passive replication -- that can be implemented in the asynchronous system model without requiring agreement on a primary (usually done using a membership service). Passive replicati ...

1998

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

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

Compiler and Software Distributed Shared Memory Support for Irregular Applications

Willy Zwaenepoel

We investigate the use of a software distributed shared memory (DSM) layer to support irregular computations on distributed memory machines. Software DSM supports irregular computation through demand fetching of data in response to memory access faults. Wi ...

1997