The Community for Technology Leaders
2015 IEEE 29th International Conference on Advanced Information Networking and Applications (AINA) (2015)
Gwangiu, South Korea
March 24, 2015 to March 27, 2015
ISSN: 1550-445X
ISBN: 978-1-4799-7904-2
pp: 106-111
ABSTRACT
Consensus is one of the most important problems encountered in fault-tolerant distributed computing. Basically, consensus allows processes to agree on a common value. Unfortunately, no deterministic algorithm can solve this problem in an asynchronous message-passing system prone to process crash failures. One way to circumvent this impossibility, consists in enriching the system with random numbers and design a randomized algorithm. This paper considers such a consensus algorithm and presents a simple predicate that allows to expedite its termination.
INDEX TERMS
Computer crashes, Algorithm design and analysis, Distributed computing, Detectors, Fault tolerance, Fault tolerant systems, Protocols
CITATION

M. Raynal, "A Simple Predicate to Expedite the Termination of a Randomized Consensus Algorithm," 2015 IEEE 29th International Conference on Advanced Information Networking and Applications (AINA), Gwangiu, South Korea, 2015, pp. 106-111.
doi:10.1109/AINA.2015.173
586 ms
(Ver 3.3 (11022016))