Publication

An Efficient Universal Construction for Message-Passing Systems

Publications associées (41)

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

On Degraded Two Message Set Broadcast

Christina Fragouli, Suhas Diggavi, Vinod Malathidevi Prabhakaran, Shirin Saeedi Bidokhti

We consider the two message set problem, where a source broadcasts a common message

W_1

to an arbitrary set of receivers

\mathcal{U}

and a private message

W_2

to a subset of the receivers

\mathcal{P}\subseteq \mathcal{U}

. Transmissions occur over l ...

EPFL Technical Report2009

Sharing is Harder than Agreeing

Rachid Guerraoui

One of the most celebrated results of the theory of distributed computing is the impossibility, in an asynchronous system of

n

processes that communicate through shared memory registers, to solve the set agreement problem where the processes need to deci ...

2008

The Weakest Failure Detector for Message Passing Set-Agreement

Rachid Guerraoui

In the set-agreement problem, n processes seek to agree on at most n−1 different values. This paper determines the weakest failure detector to solve this problem in a message-passing system where processes may fail by crashing. This failure detector, calle ...

2008

The Time-Complexity of Local Decision in Distributed Agreement

Rachid Guerraoui, Bastian Pochon, Partha Dutta

Agreement is at the heart of distributed computing. In its simple form, it requires a set of processes to decide on a common value out of the values they propose. The time-complexity of distributed agreement problems is generally measured in terms of the n ...

2007

$ H _{ 2 } $ O: Reversible Hexagonal-Orthogonal Grid Conversion by 1-D Filtering

Dimitri Nestor Alice Van De Ville

In this work, we propose a new grid conversion algorithm between the hexagonal lattice and the orthogonal (a.k.a. Cartesian) lattice. The conversion process, named

H _{ 2 }

O, is easy to implement and is perfectly reversible using the same algorithm to ...

IEEE2007

How Fast can a Distributed Atomic Read be?

Rachid Guerraoui, Marko Vukolic, Ron Levy, Partha Dutta

We study efficient 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 failure prone server processes implementing the data structure. We ...

2005

Global mixed-integer dynamic optimization

Benoît Chachuat

Recent advances in process synthesis, design, operations, and control have created an increasing demand for efficient numerical algorithms for optimizing a dynamic system coupled with discrete decisions; these problems are termed mixed-integer dynamic opti ...

2005

How fast can a distributed atomic read be?

Rachid Guerraoui, Ron Levy, Partha Dutta, Arindam Chakraborty

This paper addresses the problem of designing an efficient implementation of a basic atomic read-write data structure over an asynchronous message-passing system. In particular, we consider time-efficient implementations of this abstraction in the case of ...

2004

Robust Emulations of Shared Memory in a Crash-Recovery Model

Rachid Guerraoui, Ron Levy

A shared memory abstraction can be robustly emulated over an asynchronous message passing system where any process can fail by crashing and possibly recover (crash-recovery model), by having (a) the processes exchange messages to synchronize their read and ...

2004

Data-Aware Multicast

Rachid Guerraoui, Patrick Eugster

This paper presents a multicast algorithm for peer-to-peer dissemination of events in a distributed topic-based publish-subscribe system, where processes publish events of certain topics, organized in a hierarchy, and expect events of topics they subscribe ...

2004

Sharing is Harder than Agreeing

Rachid Guerraoui

One of the most celebrated results of the theory of distributed computing is the impossibility, in an asynchronous system of

n

processes that communicate through shared memory registers, to solve the set agreement problem where the processes need to deci ...

2008

$ H _{ 2 } $ O: Reversible Hexagonal-Orthogonal Grid Conversion by 1-D Filtering

Dimitri Nestor Alice Van De Ville

In this work, we propose a new grid conversion algorithm between the hexagonal lattice and the orthogonal (a.k.a. Cartesian) lattice. The conversion process, named

H _{ 2 }

O, is easy to implement and is perfectly reversible using the same algorithm to ...

IEEE2007

On Degraded Two Message Set Broadcast

Christina Fragouli, Suhas Diggavi, Vinod Malathidevi Prabhakaran, Shirin Saeedi Bidokhti

We consider the two message set problem, where a source broadcasts a common message

W_1

to an arbitrary set of receivers

\mathcal{U}

and a private message

W_2

to a subset of the receivers

\mathcal{P}\subseteq \mathcal{U}

. Transmissions occur over l ...

EPFL Technical Report2009