Skip to main content
SpringerLink
Log in

Quiescent Uniform Reliable Broadcast as an Introduction to Failure Detector Oracles

  • Conference paper
  • First Online:
Parallel Computing Technologies (PaCT 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2127))

Included in the following conference series:

Abstract

This paper is a short and informal introduction to failure detector oracles for asynchronous distributed systems prone to process crashes and fair lossy channels. A distributed coordination problem (the implementation of Uniform Reliable Broadcast with a quiescent protocol) is used as a paradigm to visit two types of such oracles. One of them is a “guessing” oracle in the sense that it provides a process with information that the processes could only approximate if they had to compute it. The other is a “hiding” oracle in the sense that it allows to isolate and encapsulate the part of a protocol that has not the required behavioral properties. A quiescent uniform reliable broadcast protocol is described. The guessing oracle is used to ensure the “uniformity” requirement stated in the problem specification. The hiding oracle is used to ensure the additional “quiescence” property that the protocol behavior has to satisfy.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Afek Y., Attiya H., Fekete A.D., Fischer M., Lynch N., Mansour Y., Wang D. and Zuck L., Reliable Communication over Unreliable Channels. Journal of the ACM, 41(6): 1267–1297, 1994.

    Article  MathSciNet  Google Scholar 

  2. Aguilera M.K., Chen W. and Toueg S., On Quiescent Reliable Communication. SI AM Journal of Computing, 29(6):2040–2073, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  3. Aguilera M.K. and Toueg S., Failure Detection and Randomization: a Hybrid Approach to Solve Consensus. SI AM Journal of Computing, 28(3):890–903, 1998.

    Article  MathSciNet  Google Scholar 

  4. Aguilera M.K., Toueg S. and Deianov B., Revisiting the Weakest Failure Detector for Uniform Reliable Broadcast. Proc. 13th Int. Symposium on DIStributed Computing (DISC’99), Springer-Verlag LNCS #1693, pp. 21–34, 1999.

    Google Scholar 

  5. Attiya H. and Welch J., Distributed Computing: Fundamentals, Simulations and Advanced Topics, McGraw-Hill, 451 pages, 1998.

    Google Scholar 

  6. Basu A., Charron-Bost B. and Toueg S., Simulating Reliable Links with Unreliable Links in the Presence of Process Crashes. Proc. 10th Int. Workshop on Distributed Algorithms (now, DISC), Springer-Verlag LNCS #1051, pp. 105–121, 1996.

    Google Scholar 

  7. Ben-Or M., Another Advantage of Free Choice: Completely Asynchronous Agreement Protocols. Proc. 2nd ACM Symposium on Principles of Distributed Computing (PODC’83), ACM Press, pp. 27–30, Montréal (Canada), 1983.

    Google Scholar 

  8. Biran O., Moran S. and Zaks S., A Combinatorial Characterization of the Distributed 1-Solvable Tasks. Journal of Algorithms, 11:420–440, 1990.

    Article  MATH  MathSciNet  Google Scholar 

  9. Chandra T. and Toueg S., Unreliable Failure Detectors for Reliable Distributed Systems. Journal of the ACM, 43(2):225–267, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  10. Chandra T., Hadzilacos V. and Toueg S., The Weakest Failure Detector for Solving Consensus. Journal of the ACM, 43(4):685–722, July 1996.

    Google Scholar 

  11. Chaudhuri S., More Choices Allow More Faults: Set Consensus Problems in Totally Asynchronous Systems. Information and Computation, 105:132–158, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  12. Dolev D., Lynch N., Pinter S., Stark E.W., and Weihl W.E., Reaching Approximate Agreement in the Presence of Faults. Journal of the ACM, 33(3):499–516, 1986.

    Article  MathSciNet  Google Scholar 

  13. Fekete A.D., Lynch N., Mansour Y. and Spinelli J., The Impossibility of Implementing Reliable Communication in Face of Crashes. Journal of the ACM, 40(5):1087–1107, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  14. Fischer M.J., Lynch N. and Paterson M.S., Impossibility of Distributed Consensus with One Faulty Process. Journal of the ACM, 32(2):374–382, 1985.

    Article  MATH  MathSciNet  Google Scholar 

  15. Garey M.R. and Johnson D.S., Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman W.H. & Co, New York, 340 pages, 1979.

    MATH  Google Scholar 

  16. Hadzilacos V. and Toueg S., Reliable Broadcast and Related Problems. In Distributed Systems, ACM Press (S. Mullender Ed.), New-York, pp. 97–145, 1993.

    Google Scholar 

  17. Halpern J.Y. and Ricciardi A., A Knowledge-Theoretic Analysis of Uniform Distributed Coordination and Failure Detectors. Proc. 18th ACM Symposium on Principles of Distributed Computing (PODC’99), pp. 73–82, Atlanta (GA), 1999.

    Google Scholar 

  18. Hélary J.-M., Hurfin M., Mostefaoui A., Raynal M. and Tronel F., Computing Global Functions in Asynchronous Distributed Systems with Perfect Failure Detectors. IEEE Transactions on Parallel and Distributed Systems, 11(9):897–909, 2000.

    Article  Google Scholar 

  19. Hopcroft J.E. and Ullman J.D. Introduction to Automata Theory, Languages and Computation. Addison Wesley, Reading (MA), 418 pages, 1979.

    MATH  Google Scholar 

  20. Lynch N., A Hundred Impossibility Proofs for Distributed Computing. Invited Talk, Proc. 8th ACM Symposium on Principles of Distributed Computing (PODC’89), ACM Press, pp. 1–27, Edmonton (Canada), 1989.

    Google Scholar 

  21. Lynch N., Distributed Algorithms. Morgan Kaufmann Pub., San Francisco (CA), 872 pages, 1996.

    MATH  Google Scholar 

  22. Mostefaoui A., Rajsbaum S. and Raynal M., Conditions on Input Vectors for Consensus Solvability in Asynchronous Distributed Systems. Proc. 33rd ACM Symposium on Theory of Computing (STOC’01), ACM Press, Crete (Greece), July 2001.

    Google Scholar 

  23. Mostefaoui A., Rajsbaum S., Raynal M. and Roy M., A Hierarchy of Conditions for Consensus Solvability. Proc. 20th ACM Symposium on Principles of Distributed Computing (PODC’01), ACM Press, Newport (RI), August 2001.

    Google Scholar 

  24. Mostefaoui A., Rajsbaum S., Raynal M. and Roy M., Condition-Based Protocols for Set Agreement Problems. Research Report #1393, IRISA, University of Rennes, France, April 2001, 21 pages. http://www.irisa.fr/bibli/publi/pi/2001/1393/1393.html.

    Google Scholar 

  25. Mostefaoui A. and Raynal M., Solving Consensus Using Chandra-Toueg’s Unreli-able Failure Detectors: a General Quorum-Based Approach. Proc. 13th Symp. on DIStributed Computing (DISC’99), Springer Verlag LNCS #1693, pp. 49–63, 1999.

    Google Scholar 

  26. Mostefaoui A. and Raynal M., k-Set Agreement with Limited Accuracy Failure Detectors. Proc. 19th ACM Symposium on Principles of Distributed Computing (PODC’00), Portland (OR), pp. 143–152, 2000.

    Google Scholar 

  27. Mostefaoui A. and Raynal M., Randomized k-Set Agreement. Proc. 13th th ACM Symposium on Parallel Algorithms and Architectures (SPAA’ 01), ACM Press, Crete (Greece), July 2001. Research Report #1340, IRISA, University of Rennes, France, July 2000, 14 pages. http://www.irisa.fr/bibli/publi/pi/2000/1340/1340.html.

    Google Scholar 

  28. Mostefaoui A., Raynal M. and Tronel F., The Best of Both Worlds: a Hybrid Approach to Solve Consensus. Proc. Int. Conference on Dependable Systems and Networks (DSN’00, previously FTCS), IEEE Computer Society Press, pp. 513–522, New-York City, June 2000.

    Google Scholar 

  29. Raynal M. and Tronel F., Restricted Failure Detectors: Definition and Reduction Protocols. Information Processing Letters, 72:9197, 1999.

    Article  MathSciNet  Google Scholar 

  30. Wang D.-W. and Zuck L.D., Tight Bounds for the Sequence Transmission Problem. Proc. 8th ACM Symposium on Principles of Distributed Computing (PODC’89), ACM Press, pp. 73–83, Edmonton (Canada), 1989.

    Google Scholar 

  31. Yang J., Neiger G. and Gafni E., Structured Derivations of Consensus Algorithms for Failure Detectors. Proc. 17th ACM Symposium on Principles of Distributed Computing (PODC’98), Puerto Vallarta (Mexico), pp. 297–308, 1998.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IRISA - Campus de Beaulieu, 35042, Rennes, France

    Michel Raynal

Authors
  1. Michel Raynal
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Supercomputer Software Department, ICMand MG SB RAS, pr. Lavrentiev 6, 630090, Novosibirsk, Russia

    Victor Malyshkin

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Raynal, M. (2001). Quiescent Uniform Reliable Broadcast as an Introduction to Failure Detector Oracles. In: Malyshkin, V. (eds) Parallel Computing Technologies. PaCT 2001. Lecture Notes in Computer Science, vol 2127. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44743-1_10

Download citation

  • DOI: https://doi.org/10.1007/3-540-44743-1_10

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42522-9

  • Online ISBN: 978-3-540-44743-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation