Article

Free access

Unreliable failure detectors for asynchronous systems (preliminary version)

Authors:

Tushar Deepak Chandra,

Sam TouegAuthors Info & Claims

PODC '91: Proceedings of the tenth annual ACM symposium on Principles of distributed computing

Pages 325 - 340

https://doi.org/10.1145/112600.112627

Published: 01 July 1991 Publication History

First page of PDF

References

[1]

Hagit Attiya, A. Bar-Noy, Danny Dolev, K. Koller, David Peleg, and Riidiger Reischuk. Achievable cases in an asynchronous environment. In Proceedings of the Twenty-Eighth Symposium on Foundations of Compurer Science, pages 337-346. IEEE Computer Society Press, October 1987.

Digital Library

[2]

Hagit Attiya, Cynthia Dwork, Nancy Lynch, and Larry $tockmeyer. Bounds on the time to reach agreement in the presence of timing uncertainity. In Proceedings of the Twenty third A CM Symposium on Theory of Computing, May 1991.

Digital Library

[3]

Kenneth P. Birman, Robert Cooper, Thomas A. Joseph, Kenneth P. Kane, and Frank Bernhard Schmuck. ISIS- A Distributed Programming Environment, June 1990.

[4]

Navin Budhiraja, Ajei GopM, and Sam Toueg. Early-stopping distributed bidding and applications. In Proceedings of the Fourth International Workshop on Distributed Algorithms. Springer-Verlag, September 1990. In press.

Digital Library

[5]

Kenneth P. Birman and Thomas A. Joseph. Reliable communication in the presence of failures. A CM Transactions on Computer Systems, 5(1):47-76, February 1987.

Digital Library

[6]

M. Bridgland and R. Watro. Faulttolerant decision making in totally asynchronous distributed systems. In Proceedings of the Sixth A CM Symposium on Principles of Distributed Computing, pages 52-63, August 1987.

Digital Library

[7]

Fhviu Cristian, Houtan Aghili, H. Raymond Strong, and Danny Dolev. Atomic broadcast: From ~imple message diffusion to Byzantine agreement. In Proceedings of the Fifteenth International Symposium on Fault-Tolerant Computing, pages 200-206, June 1985. A revised version appears ~s IBM Research Laboratory Technical Report RJ5244 (April 1989).

[8]

Benny Chor and Cynthia Dwork. Randomization in byzantine agreement. Advances in Computer Research, 5:443-497, 1989.

[9]

J. Chang and N. Maxemchuk. Reliable broadcast protocols. ACM Transactions on Computer Systems, 2(3)'251-273, August 1984.

Digital Library

[10]

Tushar Deepak Chandra and Sam Toueg. Time and message efficient reliable broadcasts. In Proceedings of the Fourth International Workshop on Distributed Algorithms. Springer- Verlag, September 1990. In press.

Digital Library

[11]

Tushar Deepak Chandra and Sam Toueg. Unreliable failure detectors for asynchronous systems. Technical report, Department of Computer Science, Cornell University, 1991. In preparation.

[12]

Danny Dolev, Cynthia Dwork, and Larry S tockmeyer. On the minimal synchronism needed for distributed consensus. Journal of the A CM, 34(1)'77-97, January 1987.

Digital Library

[13]

Danny Dolev, Nancy A. Lynch, Shlomit S. Pinter, Eugene W. Stark, and William E. Weihl. Reaching approximate agreement in the presence of faults. Journal of the A CM, 33(3)'499-516, July 1986.

Digital Library

[14]

Cynthia, Dwork, Nancy A. Lynch, and Larry S tockmeyer. Consensus in the presence of partial synchrony. Journal of the A CM, 35(2):288-323, April 1988.

Digital Library

[15]

Michael J. Fischer, Nancy A. Lynch, and Michael S. Paterson Impossibility of distributed consensus with one faulty process. Journal of the A CM, 32(2)'374-382, April 1985.

Digital Library

[16]

Ajei Gopal, Ray Strong, Sam Toueg, and Flaviu Cristian. Early-delivery atomic broadcast. In Proceedings of the Ninth A CM Symposium on Principles of Distributed Computing, pages 297-310, August 1990.

Digital Library

[17]

Joseph Y. Halpern and Yoram Moses. Knowledge and common knowledge in a distributed environment. Journal of the ACM, 37(3):549-587, July 1990.

Digital Library

[18]

Yoram Moses, Danny Dolev, and Joseph Y. Halpern. Cheating husbands and other stories: a case study of knowledge, action, and communication. Distributed Computing, 1(3):167-~76, 19S6.

[19]

Aleta Ricciardi and Ken Birman. Using process groups to implement failure detection in asynchronous environments. In Proceedings of the Tenth A CM Symposium on Principles of Distributed Computing, August 1991.

Digital Library

[20]

Riidiger Reischuk. A new solultion for the Byzantine general's problem. Technical Report RJ 3673, IBM Research Laboratory, November 1982.

[21]

Fred B. Schneider. Byzantine generals in action: Implementing t{ailstop processors. A CM Transactions on Computer Systems, 2(2) :145-154, May 1984.

Digital Library

[22]

Fred B. Schneider. The state :machine approach: a tutorial. Technical Report 86-800, Department of Computer Science, Cornell University, December 1986. Revised June 1987.

Digital Library

[23]

Richard D. Schlichting and Fred B. Schneider. Fail-stop processors: an approach to designing faulttolerant computing systems. ACM Transactions on Computer Systems, 1 (3):222-238, August 1983.

Digital Library

Cited By

Chaurasia BVerma AVerma P(2024)An in-depth and insightful exploration of failure detection in distributed systemsComputer Networks10.1016/j.comnet.2024.110432247(110432)Online publication date: Jun-2024
https://doi.org/10.1016/j.comnet.2024.110432
Gramoli VNicolaou NSchwarzmann A(2021)Consistent Distributed StorageSynthesis Lectures on Distributed Computing Theory10.2200/S01069ED1V01Y202012DCT01720:1(1-192)Online publication date: 28-Jun-2021
https://doi.org/10.2200/S01069ED1V01Y202012DCT017
Van Renesse RAltinbuken D(2015)Paxos Made Moderately ComplexACM Computing Surveys10.1145/267357747:3(1-36)Online publication date: 17-Feb-2015
https://dl.acm.org/doi/10.1145/2673577
Show More Cited By

Index Terms

Unreliable failure detectors for asynchronous systems (preliminary version)

Recommendations

Unreliable failure detectors for reliable distributed systems

We introduce the concept of unreliable failure detectors and study how they can be used to solve Consensus in asynchronous systems with crash failures. We characterise unreliable failure detectors in terms of two properties—completeness and accuracy. We ...
Unreliable failure detectors for asynchronous distributed systems
Unreliable Failure Detectors for Asynchronous Distributed Systems

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences

PODC '91: Proceedings of the tenth annual ACM symposium on Principles of distributed computing

July 1991

355 pages

ISBN:0897914392

DOI:10.1145/112600

Chairman:
Luigi Logrippo
Univ. of Ottawa

Copyright © 1991 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

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 July 1991

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

PODC91

Sponsor:

PODC91: 10th Annual ACM Symposium in Principles of Distibuted Computing

August 19 - 21, 1991

Quebec, Montreal, Canada

Acceptance Rates

Overall Acceptance Rate 740 of 2,477 submissions, 30%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

94
Total Citations
View Citations
877
Total Downloads

Downloads (Last 12 months)53
Downloads (Last 6 weeks)13

Reflects downloads up to 25 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Chaurasia BVerma AVerma P(2024)An in-depth and insightful exploration of failure detection in distributed systemsComputer Networks10.1016/j.comnet.2024.110432247(110432)Online publication date: Jun-2024
https://doi.org/10.1016/j.comnet.2024.110432
Gramoli VNicolaou NSchwarzmann A(2021)Consistent Distributed StorageSynthesis Lectures on Distributed Computing Theory10.2200/S01069ED1V01Y202012DCT01720:1(1-192)Online publication date: 28-Jun-2021
https://doi.org/10.2200/S01069ED1V01Y202012DCT017
Van Renesse RAltinbuken D(2015)Paxos Made Moderately ComplexACM Computing Surveys10.1145/267357747:3(1-36)Online publication date: 17-Feb-2015
https://dl.acm.org/doi/10.1145/2673577
Duan SPeisert SLevitt K(2015)hBFT: Speculative Byzantine Fault Tolerance with Minimum CostIEEE Transactions on Dependable and Secure Computing10.1109/TDSC.2014.231233112:1(58-70)Online publication date: Jan-2015
https://doi.org/10.1109/TDSC.2014.2312331
Guerraoui R(2014)Distributed AlgorithmsComputing Handbook, Third Edition10.1201/b16812-19(1-16)Online publication date: 8-May-2014
https://doi.org/10.1201/b16812-19
Alistarh DGilbert SGuerraoui RTravers C(2012)Generating Fast Indulgent AlgorithmsTheory of Computing Systems10.1007/s00224-012-9407-251:4(404-424)Online publication date: 4-May-2012
https://doi.org/10.1007/s00224-012-9407-2
Birman KBirman K(2012)The Way of the CloudGuide to Reliable Distributed Systems10.1007/978-1-4471-2416-0_2(45-67)Online publication date: 2012
https://doi.org/10.1007/978-1-4471-2416-0_2
Birman KBirman K(2012)Group Communication SystemsGuide to Reliable Distributed Systems10.1007/978-1-4471-2416-0_12(369-405)Online publication date: 2012
https://doi.org/10.1007/978-1-4471-2416-0_12
Birman KBirman K(2012)Dynamic MembershipGuide to Reliable Distributed Systems10.1007/978-1-4471-2416-0_11(339-367)Online publication date: 2012
https://doi.org/10.1007/978-1-4471-2416-0_11
Alistarh DGilbert SGuerraoui RTravers C(2011)Generating fast indulgent algorithmsProceedings of the 12th international conference on Distributed computing and networking10.5555/1946143.1946147(41-52)Online publication date: 2-Jan-2011
https://dl.acm.org/doi/10.5555/1946143.1946147
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Figures

Tables

Media

View Table of Conten