Publication

Techniques for Reducing Consistency-Related Communication in Distributed Shared Memory System

Publications associées (72)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

Consensus inside

Rachid Guerraoui, Maysam Yabandeh, Tudor Alexandru David

Scaling to a large number of cores with non-uniform communication latency and unpredictable response time may call for viewing a modern many-core architecture as a distributed system. In this view, the cores replicate shared data and ensure consistency amo ...

ACM Press2014

A paradox of eventual linearizability in shared memory

Rachid Guerraoui, Eric Ruppert

This paper compares, for the rst time, the computational power of linearizable objects with that of eventually linearizable ones. We present the following paradox. We show that, unsurprisingly, no set of eventually linearizable objects can (1) implement an ...

ACM Press2014

Replication for Send-Deterministic MPI HPC Applications

André Schiper, Thomas Ropars, Arnaud Lefray

Replication has recently gained attention in the context of fault tolerance for large scale MPI HPC applications. Existing implementations try to cover all MPI codes and to be independent from the underlying library. In this paper, we evaluate the advantag ...

2013

HydEE: Failure Containment without Event Logging for Large Scale Send-Deterministic MPI Applications

Thomas Ropars

High performance computing will probably reach exascale in this decade. At this scale, mean time between failures is expected to be a few hours. Existing fault tolerant protocols for message passing applications will not be efficient anymore since they eit ...

2012

Émulation de mémoire partagée en environnements distribués dynamiques

Vincent Gramoli

Most distributed systems are large-scale and dynamic. Communication has thus become a critical issue and the shared memory, which is a reliable paradigm of communication, allow distributed nodes to exchange information through read and write operations. In ...

2011

The Complexity Of Early Deciding Set Agreement

Rachid Guerraoui, Bastian Pochon

In the k-set agreement problem, each processor starts with a private input value and eventually decides on an output value. At most k distinct output values may be chosen, and every processor's output value must be one of the proposed values. We consider a ...

Society for Industrial and Applied Mathematics2011

Efficiently Maintaining Distributed Model-Based Views on Real-Time Data Streams

Karl Aberer, Sebastian Michel, Ho Young Jeung, Petre Alexandru Arion

Minimizing communication cost is a fundamental problem in large-scale federated sensor networks. Existing solutions applicable for the problem are often ad-hoc for specific query types, or they are inefficient when query results contain large volumes of da ...

2011

Fast Access to Distributed Atomic Memory

Rachid Guerraoui, Marko Vukolic, Ron Levy, Partha Dutta

We study eﬃcient and robust implementations of an atomic read-write data structure over an asynchronous distributed message-passing system made of reader and writer processes, as well as a number of servers implementing the data structure. We determine the ...

Society for Industrial and Applied Mathematics2010

PaxosInside

Rachid Guerraoui, Maysam Yabandeh

Amodernmanycore architecture can be viewed as a distributed system with explicit message passing to communicate between cores. Ensuring the consistency of shared state replicated over several cores is the key to the well functioning of such a system. Yet, ...

2010

Expanding the Size of Organometallic Nanostructures: A Hexanuclear (Cymene)Ru Cylinder with a Length of more than 3 nm

Rosario Scopelliti, Kay Severin

Coordination cages based on organometallic half-sandwich complexes are of interest, because they can display unique structures and host properties. This communication describes the synthesis and structure of a cylindrical nanostructure containing six (p-cy ...

2009