Publication

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

Related publications (72)

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.

Anonymous and fault-tolerant shared-memory computing

Rachid Guerraoui, Eric Ruppert

The vast majority of papers on distributed computing assume that processes are assigned unique identifiers before computation begins. But is this assumption necessary? What if processes do not have unique identifiers or do not wish to divulge them for reas ...

Springer, Springer-Verlag2007

PAI: A lightweight mechanism for single-node memory recovery in DSM servers

Babak Falsafi

Several recent studies identify the memory system as the most frequent source of hardware failures in commercial servers. Techniques to protect the memory system from failures must continue to service memory requests, despite hardware failures. Furthermore ...

2007

Language Support for Fast and Reliable Message Based Communication in Singularity OS

James Richard Larus

Message-based communication offers potential benefits of providing stronger specification and cleaner separation between components. Compared with shared-memory interactions, message passing has the potential disadvantages of being more expensive (no direc ...

2006

[ISO/IEC MPEG contribution] Adding Virtual Memory Support to MPEG4 Hardware Reference Platform

Miljan Vuletic, Christophe Lucarz

Adding Virtual Memory Support to MPEG4 Hardware Reference Platform. ...

2006

The Alpha of Indulgent Consensus

Rachid Guerraoui

This paper presents a simple framework unifying a family of consensus algorithms that can tolerate process crash failures and asynchronous periods of the network, also called indulgent consensus algorithms. Key to the framework is a new abstraction we intr ...

2006

Temporal Streaming of Shared Memory

Anastasia Ailamaki, Babak Falsafi

Coherent read misses in shared-memory multiprocessors account for a substantial fraction of execution time in many important scientific and commercial workloads. We propose Temporal Streaming, to eliminate coherent read misses by streaming data to a proces ...

2005

Store-Ordered Streaming of Shared Memory

Anastasia Ailamaki, Babak Falsafi

Coherence misses in shared-memory multiprocessors account for a substantial fraction of execution time in many important scientific and commercial workloads. Memory streaming provides a promising solution to the coherence miss bottleneck because it improve ...

2005

What Can Be Implemented Anonymously?

Rachid Guerraoui, Eric Ruppert

Abstract. The vast majority of papers on distributed computing assume that processes are assigned unique identifiers before computation begins. But is this assumption necessary? What if processes do not have unique identifiers or do not wish to divulge the ...

2005

Causeway: Support for Controlling and Analyzing the Execution of Web-Accessible Applications

Willy Zwaenepoel

Causeway provides runtime support for the development of distributed meta-applications. These meta-applications control or analyze the behavior of multi-tier distributed applications such as multi-tier web sites or web services. Examples of meta-applicatio ...

2005

The Driving Philosophers

Rachid Guerraoui, Bastian Pochon

We introduce a new synchronization problem in mobile ad-hoc systems: the Driving Philosophers. In this problem, an unbounded number of driving philosophers (processes) access a round-about (set of shared resources organized along a logical ring). The crux ...

2004