Tight bounds for asynchronous randomized consensus

A distributed consensus algorithm allows n processes to reach a common decision value starting from individual inputs. Wait-free consensus, in which a process always terminates within a finite number of its own steps, is impossible in an asynchronous shared-memory system. However, consensus becomes solvable using randomization when a pro

• Type: Conference
• Year: 2007
• Where: STOC
• Authors: Hagit Attiya, Keren Censor
• Keywords: Algorithms, Asynchronous Shared-memory System, Distributed Consensus Algorithm, STOC 2007, Wait-free Consensus