Sciweavers

7 search results - page 1 / 2
» Failure detectors as type boosters
Sort
View
DC
2008
13 years 4 months ago
Failure detectors as type boosters
The power of an object type T can be measured as the maximum number n of processes that can solve consensus using only objects of T and registers. This number, denoted cons(T), is ...
Rachid Guerraoui, Petr Kouznetsov
ICTAC
2005
Springer
13 years 10 months ago
Revisiting Failure Detection and Consensus in Omission Failure Environments
It has recently been shown that fair exchange, a security problem in distributed systems, can be reduced to a fault tolerance problem, namely a special form of distributed consensu...
Carole Delporte-Gallet, Hugues Fauconnier, Felix C...
PDCAT
2009
Springer
13 years 11 months ago
Modular Consensus Algorithms for the Crash-Recovery Model
—In the crash-recovery failure model of asynchronous distributed systems, processes can temporarily stop to execute steps and later restart their computation from a predefined l...
Felix C. Freiling, Christian Lambertz, Mila E. Maj...
ICALP
2005
Springer
13 years 10 months ago
Optimistic Asynchronous Atomic Broadcast
This paper presents a new protocol for atomic broadcast in an asynchronous network with a maximal number of Byzantine failures. It guarantees both safety and liveness without maki...
Klaus Kursawe, Victor Shoup
WDAG
2005
Springer
157views Algorithms» more  WDAG 2005»
13 years 10 months ago
(Almost) All Objects Are Universal in Message Passing Systems
d Abstract) Carole Delporte-Gallet1 , Hugues Fauconnier2 , and Rachid Guerraoui3 1 ESIEE-IGM Marne-La-Vallee, France 2 LIAFA Univ Paris VII, France 3 EPFL Lausanne, Switzerland Thi...
Carole Delporte-Gallet, Hugues Fauconnier, Rachid ...