The weakest failure detector to solve nonuniform consensus

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

The weakest failure detector to solve nonuniform consensus

Full text

Pdf (130 KB)

Source

Annual ACM Symposium on Principles of Distributed Computing archive
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing table of contents

Las Vegas, NV, USA

SESSION: Consensus table of contents

Pages: 189 - 196

Year of Publication: 2005

ISBN:1-59593-994-2

Authors

Jonathan Eisler	University of Toronto
Vassos Hadzilacos	University of Toronto
Sam Toueg	University of Toronto

Sponsors

SIGOPS: ACM Special Interest Group on Operating Systems
ACM: Association for Computing Machinery
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 0, Downloads (12 Months): 21, Citation Count: 2

Additional Information:

abstract references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/1073814.1073849 What is a DOI?

ABSTRACT

We determine the weakest failure detector to solve nonuniform consensus in any environment, i.e., regardless of the number of faulty processes. Together with previous results, this closes all aspects of the following question: What is the weakest failure detector to solve (uniform or nonuniform) consensus in any environment?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Tushar Deepak Chandra , Vassos Hadzilacos , Sam Toueg, The weakest failure detector for solving consensus, Journal of the ACM (JACM), v.43 n.4, p.685-722, July 1996 [doi>10.1145/234533.234549]
	2	Tushar Deepak Chandra , Sam Toueg, Unreliable failure detectors for reliable distributed systems, Journal of the ACM (JACM), v.43 n.2, p.225-267, March 1996 [doi>10.1145/226643.226647]
	3	C. Delporte-Gallet, H. Fauconnier, and R. Guerraoui. Shared memory vs. message passing. Technical report, Ecole Polytechnique Fédérale de Lausanne, Dec. 2003.
	4	Michael J. Fischer , Nancy A. Lynch , Michael S. Paterson, Impossibility of distributed consensus with one faulty process, Journal of the ACM (JACM), v.32 n.2, p.374-382, April 1985 [doi>10.1145/3149.214121]
	5	A. Mostéfaoui and M. Raynal. Leader-based consensus. Parallel Processing Letters, 11(1):95--107, 2001.

CITED BY 2

	Michel Paquette , Andrzej Pelc, Optimal decision strategies in Byzantine environments, Journal of Parallel and Distributed Computing, v.66 n.3, p.419-427, March 2006
	Vibhor Bhatt , Nicholas Christman , Prasad Jayanti, Extracting quorum failure detectors, Proceedings of the 28th ACM symposium on Principles of distributed computing, August 10-12, 2009, Calgary, AB, Canada