Access the full text.
Sign up today, get DeepDyve free for 14 days.
J. Hélary, M. Hurfin, A. Mostéfaoui, M. Raynal, F. Tronel (2000)
Computing Global Functions in Asynchronous Distributed Systems with Perfect Failure DetectorsIEEE Trans. Parallel Distributed Syst., 11
H. Attiya, J. Welch (2004)
Distributed computing - fundamentals, simulations, and advanced topics (2. ed.)
S. Chaudhuri (1993)
More Choices Allow More Faults: Set Consensus Problems in Totally Asynchronous SystemsInf. Comput., 105
C. Delporte-Gallet, H. Fauconnier, R. Guerraoui (2002)
A realistic look at failure detectorsProceedings International Conference on Dependable Systems and Networks
N. Halabi, Guy Even (2005)
Improved bounds on the word error probability of RA(2) codes with linear-programming-based decodingIEEE Transactions on Information Theory, 51
D. Angluin, J. Aspnes, Zoë Diamadi, M. Fischer, R. Peralta (2004)
Computation in networks of passively mobile finite-state sensorsDistributed Computing, 18
(2009)
Received November
M. Yamashita, T. Kameda (1996)
Computing on Anonymous Networks: Part I-Characterizing the Solvable CasesIEEE Trans. Parallel Distributed Syst., 7
E. Borowsky, E. Gafni (1993)
Generalized FLP impossibility result for t-resilient asynchronous computationsProceedings of the twenty-fifth annual ACM symposium on Theory of Computing
Y. Moses, M. Raynal (2008)
No double discount: Condition-based simultaneity yields limited gainInf. Comput., 214
M. Herlihy, N. Shavit (1999)
The topological structure of asynchronous computabilityJ. ACM, 46
T. Chandra, V. Hadzilacos, S. Toueg (1996)
The weakest failure detector for solving consensusJ. ACM, 43
M. Herlihy, Victor Luchangco, Mark Moir (2003)
Obstruction-free synchronization: double-ended queues as an example23rd International Conference on Distributed Computing Systems, 2003. Proceedings.
S. Thomson, Kylie Hillman (2001)
Snapshots
T. Chandra, V. Hadzilacos, S. Toueg (1992)
The weakest failure detector for solving consensus
S. Chaudhuri, M. Herlihy, N. Lynch, M. Tuttle (2000)
Tight bounds for k-set agreementJournal of the ACM (JACM), 47
D. Angluin (1980)
Local and global properties in networks of processors (Extended Abstract)
I. Keidar, S. Rajsbaum (2003)
A simple proof of the uniform consensus synchronous lower boundInf. Process. Lett., 85
M. Fischer, N. Lynch (1982)
A Lower Bound for the Time to Assure Interactive ConsistencyInf. Process. Lett., 14
J. Welch, H. Attiya (1998)
Distributed Computing: Fundamentals, Simulations and Advanced Topics
Y. Moses, M. Tuttle (1987)
Programming simultaneous actions using common knowledgeAlgorithmica, 3
M. Saks, Fotios Zaharoglou (1993)
Wait-free k-set agreement is impossible: the topology of public knowledgeProceedings of the twenty-fifth annual ACM symposium on Theory of Computing
François Bonnet, M. Raynal (2009)
The Price of Anonymity: Optimal Consensus Despite Asynchrony, Crash and Anonymity
Y. Moses, M. Raynal (2009)
Revisiting simultaneous consensus with crash failuresJ. Parallel Distributed Comput., 69
E. Gafni (1998)
Round-by-Round Fault Detectors: Unifying Synchrony and Asynchrony (Extended Abstract).
C. Delporte-Gallet, H. Fauconnier, J. Hélary, M. Raynal (2002)
Early stopping in global data computationIEEE Trans. Parallel Distributed Syst., 14
H. Buhrman, A. Panconesi, R. Silvestri, P. Vitányi (2000)
On the importance of having an identity or, is consensus really universal?Distributed Computing, 18
ACM Transactions on Autonomous and Adaptive Systems
J. Aspnes, Gauri Shah, Jatin Shah (2002)
Wait-free consensus with infinite arrivals
A. Durresi, V. Paruchuri, M. Durresi, L. Barolli (2005)
A Hierarchical Anonymous Communication Protocol for Sensor Networks
M. Fischer, N. Lynch, M. Paterson (1985)
Impossibility of distributed consensus with one faulty processJ. ACM, 32
H. Attiya, M. Snir, Manfred Warmuth (1985)
Computing on an anonymous ring
A. Mostéfaoui, M. Raynal (2001)
Leader-Based ConsensusParallel Process. Lett., 11
A. Mostéfaoui, S. Rajsbaum, M. Raynal, Corentin Travers (2008)
On the computability power and the robustness of set agreement-oriented failure detector classesDistributed Computing, 21
T. Elrad, N. Francez (1982)
Decomposition of Distributed Programs into Communication-Closed LayersSci. Comput. Program., 2
H. Attiya, M. Snir, Manfred Warmuth (1988)
Computing on an anonymous ringJ. ACM, 35
T. Lakshman, V. Wei (1994)
Distributed Computing on Regular Networks with Anonymous NodesIEEE Trans. Computers, 43
Joseph Halpern, Y. Moses (1984)
Knowledge and common knowledge in a distributed environmentArXiv, cs.DC/0006009
H. Attiya, A. Gorbach, S. Moran (1998)
Computing in Totally Anonymous Asynchronous Shared Memory Systems
T. Chandra, S. Toueg (1996)
Unreliable failure detectors for reliable distributed systemsJ. ACM, 43
Tom Chothia, K. Chatzikokolakis (2005)
A Survey of Anonymous Peer-to-Peer File-Sharing
(1987)
Memory requirements for agreement among unreliable asynchronous processes
M. Raynal (2002)
Consensus in synchronous systems: a concise guided tour2002 Pacific Rim International Symposium on Dependable Computing, 2002. Proceedings.
A. Mostéfaoui, S. Rajsbaum, M. Raynal, Corentin Travers (2008)
The Combined Power of Conditions and Information on Failures to Solve Asynchronous Set AgreementSIAM J. Comput., 38
J. Aspnes, Faith Ellen, E. Ruppert (2004)
Relationships between broadcast and shared memory in reliable anonymous distributed systemsDistributed Computing, 18
E. Gafni (1998)
Round-by-round fault detectors (extended abstract): unifying synchrony and asynchrony
Seif Haridi (1992)
Distributed Algorithms, 647
M. Herlihy (1991)
Wait-free synchronizationACM Trans. Program. Lang. Syst., 13
M. Aguilera, S. Toueg (1998)
A Simple Bivalency Proof that t-Resilient Consensus Requires t + 1 RoundsInf. Process. Lett., 71
R. Guerraoui, M. Raynal (2007)
The Alpha of Indulgent ConsensusComput. J., 50
A. Panconesi, M. Papatriantafilou, P. Tsigas, P. Vitányi (1998)
Randomized naming using wait-free shared variablesDistributed Computing, 11
D. Dolev, R. Reischuk, H. Strong (1990)
Early stopping in Byzantine agreementJ. ACM, 37
M. Yamashita, T. Kameda (1996)
Computing on Anonymous Networks: Part II-Decision and Membership ProblemsIEEE Trans. Parallel Distributed Syst., 7
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
ACM Transactions on Autonomous and Adaptive Systems (TAAS) – Association for Computing Machinery
Published: Oct 1, 2011
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.