Title :
A Simple Predicate to Expedite the Termination of a Randomized Consensus Algorithm
Author_Institution :
Inst. Univ. de France, Univ. de Rennes 1, Rennes, France
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.
Keywords :
fault tolerant computing; message passing; randomised algorithms; asynchronous message-passing system; fault-tolerant distributed computing; process crash failures; randomized consensus algorithm; Algorithm design and analysis; Computer crashes; Detectors; Distributed computing; Fault tolerance; Fault tolerant systems; Protocols; Asynchronous distributed system; Consensus; Message-passing; Randomized algorithm;
Conference_Titel :
Advanced Information Networking and Applications (AINA), 2015 IEEE 29th International Conference on
Conference_Location :
Gwangiu
Print_ISBN :
978-1-4799-7904-2
DOI :
10.1109/AINA.2015.173
