Publication

The causal ordering abstraction and a simple way to implement it

Related publications (87)

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.

Community-Aware Event Dissemination

Rachid Guerraoui, Oana Anca Jurca, Patrick Eugster

This paper presents a distributed algorithm to disseminate events in a publish/subscribe system, where processes publish events of certain topics, organized in a hierarchy, and expect events of topics they subscribed to. Every topic defines a dynamic notio ...

2006

Multicoordinated Paxos

Rodrigo Malta Schmidt, Fernando Pedone

Classic Paxos is a round-based distributed consensus algorithm. Normally, proposals are sent to the round leader and decided in two communication steps more. Fast Paxos extends Classic Paxos by allowing also fast rounds, in which a decision can be learned ...

2006

A General Characterization of Indulgence (Invited Paper)

Rachid Guerraoui

An indulgent algorithm is a distributed algorithm that, besides tolerating process failures, also tolerates arbitrarily long periods of instability, with an unbounded number of timing and scheduling failures. In particular, no process can take any irrevoca ...

2006

Multi-radio Channel Allocation in Competitive Wireless Networks

Jean-Pierre Hubaux, Mark Felegyhazi, Mario Cagalj

Channel allocation has been extensively studied in the framework of cellular networks, but the emergence of new system concepts, such as cognitive radio systems, bring this topic into the focus of research again. In this paper, we provide a formal analysis ...

2006

Perfect Simulation and Stationarity of a Class of Mobility Models

Jean-Yves Le Boudec, Milan Vojnovic

We define ``random trip", a generic mobility model for independent mobiles that contains as special cases: the random waypoint on convex or non convex domains, random walk with reflection or wrapping, city section, space graph and other models. We use Palm ...

2005

On the Impossibility of Boosting Distributed Service Resilience

Rachid Guerraoui

We show that no deterministic algorithm can solve consensus in the presence of t+1 process crash failures, in a system of n processes that communicate in a reliable way and synchronize their activities using any number of t-resilient services. These base s ...

2005

Gracefully Degrading Fair Exchange with Security Modules

Rachid Guerraoui, Marko Vukolic, Gildas Avoine

The fair exchange problem is key to trading electronic items in systems of mutually untrusted parties. In modern variants of such systems, each party is equipped with a security module. The security modules trust each other but can only communicate by exch ...

2005

Perfect Simulation and Stationarity of a Class of Mobility Models

Jean-Yves Le Boudec, Milan Vojnovic

2004

The CHT Play

Rachid Guerraoui, Felix Gaertner

This note gives a high level and informal account of the necessary part of the proof that Ω is the weakest failure detector to implement consensus with a majority of correct processes. The proof originally appeared in a widely cited but rarely understood p ...

2004

Total Order Broadcast and Multicast Algorithms: Taxonomy and Survey

André Schiper, Xavier Défago

Total order broadcast and multicast (also called atomic broadcast/multicast) present an important problem in distributed systems, especially with respect to fault-tolerance. In short, the primitive ensures that messages sent to a set of processes are, in t ...

2004