Sciweavers

14 search results - page 2 / 3
» Timeliness, failure-detectors, and consensus performance
Sort
View
EUROPAR
2007
Springer
13 years 11 months ago
Modeling and Validating the Performance of Atomic Broadcast Algorithms in High Latency Networks
Abstract. The performance of consensus and atomic broadcast algorithms using failure detectors is often affected by a trade-off between the number of communication steps and the ...
Richard Ekwall, André Schiper
PDP
2002
IEEE
13 years 10 months ago
Eventually Consistent Failure Detectors
The concept of unreliable failure detector was introduced by Chandra and Toueg as a mechanism that provides information about process failures. This mechanism has been used to sol...
Mikel Larrea, Antonio Fernández, Sergio Ar&...
DSN
2006
IEEE
13 years 11 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
PODC
2009
ACM
14 years 6 months ago
Partial synchrony based on set timeliness
d Abstract] Marcos K. Aguilera Microsoft Research Silicon Valley Mountain View, CA, USA Carole Delporte-Gallet Universit? Paris 7 Paris, France Hugues Fauconnier Universit? Paris ...
Marcos Kawazoe Aguilera, Carole Delporte-Gallet, H...
SRDS
2010
IEEE
13 years 3 months ago
Swift Algorithms for Repeated Consensus
We introduce the notion of a swift algorithm. Informally, an algorithm that solves the repeated consensus is swift if, in a partial synchronous run of this algorithm, eventually no...
Fatemeh Borran, Martin Hutle, Nuno Santos, Andr&ea...