Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

The Price of Anonymity: Optimal Consensus Despite Asynchrony, Crash, and Anonymity

The Price of Anonymity: Optimal Consensus Despite Asynchrony, Crash, and Anonymity 23 The Price of Anonymity: Optimal Consensus Despite Asynchrony, Crash, and Anonymity FRANCOIS BONNET and MICHEL RAYNAL, IRISA, University of Rennes ¸ This article addresses the consensus problem in asynchronous systems prone to process crashes, where additionally the processes are anonymous (they cannot be distinguished one from the other: they have no name and execute the same code). To circumvent the three computational adversaries (asynchrony, failures, and anonymity) each process is provided with a failure detector of a class denoted , that gives it an upper bound on the number of processes that are currently alive (in a nonanonymous system, the classes and P ”the class of perfect failure detectors ”are equivalent). The article rst presents a simple -based consensus algorithm where the processes decide in 2t + 1 asynchronous rounds (where t is an upper bound on the number of faulty processes). It then shows one of its main results, namely 2t + 1 is a lower bound for consensus in the anonymous systems equipped with . The second contribution addresses early-decision. The article presents and proves correct an earlydeciding algorithm where the processes decide in min(2 f + 2, 2t + 1) asynchronous rounds (where f http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM Transactions on Autonomous and Adaptive Systems (TAAS) Association for Computing Machinery

The Price of Anonymity: Optimal Consensus Despite Asynchrony, Crash, and Anonymity

Loading next page...
 
/lp/association-for-computing-machinery/the-price-of-anonymity-optimal-consensus-despite-asynchrony-crash-and-hjWpS00gYj

References (53)

Publisher
Association for Computing Machinery
Copyright
Copyright © 2011 by ACM Inc.
ISSN
1556-4665
DOI
10.1145/2019591.2019592
Publisher site
See Article on Publisher Site

Abstract

23 The Price of Anonymity: Optimal Consensus Despite Asynchrony, Crash, and Anonymity FRANCOIS BONNET and MICHEL RAYNAL, IRISA, University of Rennes ¸ This article addresses the consensus problem in asynchronous systems prone to process crashes, where additionally the processes are anonymous (they cannot be distinguished one from the other: they have no name and execute the same code). To circumvent the three computational adversaries (asynchrony, failures, and anonymity) each process is provided with a failure detector of a class denoted , that gives it an upper bound on the number of processes that are currently alive (in a nonanonymous system, the classes and P ”the class of perfect failure detectors ”are equivalent). The article rst presents a simple -based consensus algorithm where the processes decide in 2t + 1 asynchronous rounds (where t is an upper bound on the number of faulty processes). It then shows one of its main results, namely 2t + 1 is a lower bound for consensus in the anonymous systems equipped with . The second contribution addresses early-decision. The article presents and proves correct an earlydeciding algorithm where the processes decide in min(2 f + 2, 2t + 1) asynchronous rounds (where f

Journal

ACM Transactions on Autonomous and Adaptive Systems (TAAS)Association for Computing Machinery

Published: Oct 1, 2011

There are no references for this article.