231 search results - page 16 / 47 » Asynchronous failure detectors |
WDAG
1997
Springer
15 years 1 months ago
1997
Springer
This paper addresses the problem of atomic multicasting messages in asynchronous distributed systems. Firstly, we give a characterization of the notion of genuine atomic multicast...
65
Voted
CONCUR
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. We give a process calculus model that formalizes a wellknown algorithm (introduced by Chandra and Toueg) solving consensus in the presence of a particular class of failur...
SSS
2009
Springer
15 years 2 months ago
2009
Springer
We present a simple algorithm that implements the Omega failure detector in the crash-recovery model. The algorithm is quiescent, i.e., eventually all the processes but the leader ...
SSS
2007
Springer
15 years 3 months ago
2007
Springer
We present a modular redesign of TrustedPals, a smartcard-based security framework for solving secure multiparty computation (SMC)[?]. TrustedPals allows to reduce SMC to the probl...
WDAG
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. We give randomized agreement algorithms with constant expected running time in asynchronous systems subject to process failures, where up to a minority of processes may f...