Cited By
View all- Newport CHalldórsson MDolev S(2014)Consensus with an abstract MAC layerProceedings of the 2014 ACM symposium on Principles of distributed computing10.1145/2611462.2611479(66-75)Online publication date: 15-Jul-2014
Agreement without knowing everybody: a first step to dynamicity
Article No.: 49, Pages 1 - 5
Abstract
We study in this paper the consensus problem in asynchronous models where the set of participating processes is not known. We prove that in this model the consensus is impossible to be solved even if no process may crash. We prove that the asynchronous model augmented with failure detector Σ, which enables to realize a quorum, is sufficient to circumvent this impossibility result. For this, we present an algorithm solving the consensus problem in this model.
References
[1]
David Cavin, Yoav Sasson, and André Schiper. Consensus with unknown participants or fundamental self-organization. In Ioanis Nikolaidis, Michel Barbeau, and Evangelos Kranakis, editors, ADHOC-NOW, volume 3158 of Lecture Notes in Computer Science, pages 135--148. Springer, 2004.
[2]
Tushar Deepak Chandra and Sam Toueg. Unreliable failure detectors for reliable distributed systems. Journal of the ACM, 43(2):225--267, March 1996.
[3]
Carole Delporte-Gallet, Hugues Fauconnier, and Rachid Guerraoui. Shared memory vs. message passing. Technical Report IC/2003/77, EPFL, December 2003. Availabe at http://icwww.epfl.ch/publications/.
[4]
Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Vassos Hadzilacos, Petr Kouznetsov, and Sam Toueg. The weakest failure detectors to solve certain fundamental problems in distributed computing. In Soma Chaudhuri and Shay Kutten, editors, PODC, pages 338--346. ACM, 2004.
[5]
Antonio Fernández, Ernesto Jiménez, and Michel Raynal. Eventual leader election with weak assumptions on initial knowledge, communication reliability, and synchrony. In DSN, pages 166--178. IEEE Computer Society, 2006.
[6]
Michael J. Fischer, Nancy A. Lynch, and Michael S. Paterson. Impossibility of distributed consensus with one faulty process. Journal of the ACM, 32(2):374--382, April 1985.
[7]
Fabíola Greve and Sébastien Tixeuil. Knowledge connectivity vs. synchrony requirements for fault-tolerant agreement in unknown networks. In DSN, pages 82--91. IEEE Computer Society, 2007.
[8]
Nancy A. Lynch. Distributed Algorithms. Morgan Kaufmann, 1996.
Index Terms
- Agreement without knowing everybody: a first step to dynamicity
Recommendations
Agreement and consistency without knowing the number of processes
NOTERE '08: Proceedings of the 8th international conference on New technologies in distributed systemsWe study in this paper three classical problems of fault tolerance in a system where the set of processes is unknown. These three problems are: the consensus, the implementation of atomics registers and the eventual leader election.
For this, we ...
The incremental agreement
To achieve reliable distributed systems, the fault-tolerance must be studied. One of the most important problems of fault-tolerance issues lies in the Byzantine Agreement (BA) problem. The primary issue surrounding BA is that fault-free processors must ...
Comments
Information & Contributors
Information
Published In
June 2008
399 pages
Copyright © 2008 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
- Lyon 1 University
- SIGAPP: ACM Special Interest Group on Applied Computing
- Mairie de Villeurbanne
- Conseil Général du Rhône
- INSA Lyon: Institut National des Sciences Appliquées de Lyon
- Conseil Régional Rhône-Alpes
- Mutuelle d'assurance MAIF
- I.U.T.A LYON 1: Institute of Technology Lyon 1
- Ministère de l'Enseignement Supérieur et de la Recherche
- Lyon 2 University
- ISTASE: High-Level Engineering School in Telecommunication
- France Telecom
- LIRIS: Lyon Research Center for Images and Intelligent Information Systems
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 23 June 2008
Check for updates
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 81Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 05 Mar 2025
Other Metrics
Citations
Cited By
View all- Newport CHalldórsson MDolev S(2014)Consensus with an abstract MAC layerProceedings of the 2014 ACM symposium on Principles of distributed computing10.1145/2611462.2611479(66-75)Online publication date: 15-Jul-2014
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in