Sciweavers

231 search results - page 6 / 47
» Asynchronous failure detectors
Sort
View
DSN
2006
IEEE
14 years 1 months ago
One-step Consensus with Zero-Degradation
In the asynchronous distributed system model, consensus is obtained in one communication step if all processes propose the same value. Assuming f < n/3, this is regardless of t...
Dan Dobre, Neeraj Suri
ICALP
2005
Springer
14 years 29 days 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
ACTA
2007
88views more  ACTA 2007»
13 years 7 months ago
Distributed Consensus, revisited
We provide a novel model to formalize a well-known algorithm, by Chandra and Toueg, that solves Consensus among asynchronous distributed processes in the presence of a particular ...
Rachele Fuzzati, Massimo Merro, Uwe Nestmann
DSN
2002
IEEE
14 years 12 days ago
Performance Analysis of a Consensus Algorithm Combining Stochastic Activity Networks and Measurements
Protocols which solve agreement problems are essential building blocks for fault tolerant distributed applications. While many protocols have been published, little has been done ...
Andrea Coccoli, Péter Urbán, Andrea ...
SSS
2007
Springer
14 years 1 months ago
Global Predicate Detection in Distributed Systems with Small Faults
Abstract. We study the problem of global predicate detection in presence of permanent and transient failures. We term the transient failures as small faults. We show that it is imp...
Felix C. Freiling, Arshad Jhumka