Personne

Rachid Guerraoui

Publications associées (428)

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

Failure Detection Lower Bounds on Registers and Consensus (Preliminary Version)

Rachid Guerraoui

This paper addresses the problem of determining the weakest failure detector to implement consensus in a message passing system when t out of n processes can crash (including when n/2 =< t < n-1), by addressing the problem of determining the weakest failur ...

2002

OS Support for P2P Programming: a Case for TPS

Rachid Guerraoui, Patrick Eugster

Just like Remote Procedure Call (RPC) turned out to be a very effective OS ab-straction in building client-server applications over LANs, Type-based Publish-Sub-scribe (TPS) can be viewed as a high-level candidate OS abstraction for building Peer-to-Peer ( ...

2002

AOP: Does it Make Sense ? The Case of Concurrency and Failures

Rachid Guerraoui, Jörg Kienzle

Concurrency and failures are fundamental problems in distributed computing. One likes to think that the mechanisms needed to address these problems can be separated from the rest of the distributed application: in modern words, these mechanisms could be as ...

2002

On the Weakest Failure Detector for Non-Blocking Atomic Commit.

Rachid Guerraoui

This paper addresses the question of the weakest failure detector to solve the Non-Blocking Atomic Commit (NBAC) problem in an asynchronous system. We define the set A of timeless failure detectors which excludes detectors that provide information about gl ...

2002

AOP - Does It Make Sense? The Case of Concurrency and Failures

Rachid Guerraoui, Jörg Kienzle

Springer Verlag2002

OS Support for P2P: a Case for TPS

Rachid Guerraoui, Patrick Eugster

Just like Remote Procedure Call (RPC) turned out to be a very effective OS abstraction in building client-server applications over LANs, Type-based Publish-Subscribe (TPS) can be viewed as a high-level candidate OS abstraction for building Peer-to-Peer (P2 ...

2002

Abstractions for Distributed Programming: Guests or Relatives?

Rachid Guerraoui, Patrick Eugster, Christian Heide Damm

What abstractions are useful for expressing distributed interaction? This question has constituted an active area of research in the last decades and several candidates have been proposed, including remote method invocation, tuple spaces and publish/subscr ...

2001

Open Consensus

Rachid Guerraoui, Romain Boichat

This paper presents the abstraction of open consensus and argues for its use as an effective component for building reliable agreement protocols in practical asynchronous systems where processes and links can crash and recover. The specification of open co ...

2001

Deconstructing Paxos

Rachid Guerraoui, Partha Dutta, Romain Boichat

The Paxos part-time parliament protocol of Lamport provides a non trivial but very practical way to implement fault-tolerant deterministic services over a distributed message passing system. This paper deconstructs Paxos and modularly reconstructs more res ...

2001

Linguistic Support for Large-Scale Distributed Programming

Rachid Guerraoui, Patrick Eugster, Christian Heide Damm

We present three operators for the expression of event-based large-scale distributed programming. In short, these operators support a publish/subscribe-based interaction scheme, leading to a distributed object programming model merging the benefits of obje ...

2001