Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Distributed Algorithms

WDAG 1990: Distributed Algorithms pp 304–320Cite as

Early-stopping distributed bidding and applications

  • Conference paper
  • First Online:

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

Abstract

We define the problem of Distributed Bidding and derive efficient solutions for several models of process failures. Our algorithms are early-stopping: their performance gracefully degrades as the number of processes that actually fail increases. We use our Distributed Bidding algorithms to derive the first known early-delivery Atomic Broadcast algorithms that deliver messages in time proportional to the number of processes that actually fail during the broadcast, rather than to the maximum number of faulty processes that the algorithm tolerates.

Preliminary Version

Partially supported by the Defense Advanced Research Projects Agency (DoD) under NASA Ames grant number NAG 2-593, Contract N00140-87-C-8904

Partially supported by an IBM Graduate Student Fellowship.

Partially supported by NSF grant CCR-8901780.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Brian A. Coan, Danny Dolev, Cynthia Dwork, and Larry Stockmeyer. The distributed firing squad problem. In Proceedings of the Seventeenth ACM Symposium on Theory of Computing, pages 335–345, Providence, Rhode Island, May 1985. ACM SIGACT.

    Google Scholar 

  2. Brian A. Coan. Efficient agreement using fault diagnosis. In Proceedings of the Twenty-Sixth Annual Allerton Conference on Communication, Control, and Computing, September 1988.

    Google Scholar 

  3. Flaviu Cristian. Probabilistic clock synchronization. Distributed Computing, 3:146–158, 1989.

    Google Scholar 

  4. Flaviu Cristian and Ray Strong. A family of early-delivery atomic broadcast protocols, June 1987. IBM Almaden Research Center, Unpublished manuscript.

    Google Scholar 

  5. Danny Dolev, R. Reischuk, and Ray Strong. Eventual is earlier than immediate. In Proceedings of Twenty third Symposium on Foundations of Computer Science, pages 196–203, November 1982.

    Google Scholar 

  6. Danny Dolev and H. Ray Strong. Authenticated algorithms for Byzantine agreement. SIAM Journal on Computing, 12(4):656–666, November 1983.

    Google Scholar 

  7. Ajei Gopal, Ray Strong, Sam Toueg, and Flaviu Cristian. Early-delivery atomic broadcast. In Proceedings of Ninth ACM Symposium on Principles of Distributed Computing, Quebec City, Canada, August 1990.

    Google Scholar 

  8. Amir Herzberg and Shay Kutten. Efficient detection of message forwarding faults. In Proceedings of the Eight ACM Symposium on Principles of Distributed Computing, Edmonton, Alberta, August 1989. ACM SIGOPS-SIGACT.

    Google Scholar 

  9. Leslie Lamport, R. Shostak, and M. Pease. The Byzantine generals problem. ACM Transactions on Programming Languages and Systems, 4(3):382–401, July 1982.

    Google Scholar 

  10. Yoram Moses and Orly Waarts. Coordinated traversal: (t+1)-round Byzantine agreement in polynomial time. In Proceedings of the Twenty-Ninth IEEE Symposium on Foundations of Computer Science, pages 246–255, White Plains, New York, October 1988. IEEE.

    Google Scholar 

  11. Gil Neiger and Sam Toueg. Automatically increasing the fault-tolerance of distributed systems. In Proceedings of the Seventh ACM Symposium on Principles of Distributed Computing, pages 248–262, Toronto, Ontario, August 1988. ACM SIGOPS-SIGACT.

    Google Scholar 

  12. Kenneth J. Perry and Sam Toueg. An authenticated byzantine generals algorithm with early stopping. Technical Report 84-620, Cornell University, Ithaca, June 1984.

    Google Scholar 

  13. Kenneth J. Perry and Sam Toueg. Distributed agreement in the presence of processor and communication faults. IEEE Transactions on Software Engineering, 12(3):477–482, March 1986.

    Google Scholar 

  14. Fred Schneider. Implementing fault-tolerant services using the state machine approach: A tutorial. ACM Computing Surveys, 1990. To Appear.

    Google Scholar 

  15. T. K. Srikanth and Sam Toueg. Simulating authenticated broadcasts to derive simple fault-tolerant algorithms. Distributed Computing, 2(2):80–94, 1987.

    Google Scholar 

  16. Sam Toueg, Kenneth J. Perry, and T. K. Srikanth. Fast distributed agreement. SIAM Journal on Computing, 16(3):445–457, June 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Cornell University, 14853, Ithaca, NY

    Navin Budhiraja, Ajei Gopal & Sam Toueg

Authors
  1. Navin Budhiraja
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ajei Gopal
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sam Toueg
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jan van Leeuwen Nicola Santoro

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Budhiraja, N., Gopal, A., Toueg, S. (1991). Early-stopping distributed bidding and applications. In: van Leeuwen, J., Santoro, N. (eds) Distributed Algorithms. WDAG 1990. Lecture Notes in Computer Science, vol 486. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54099-7_21

Download citation

  • DOI: https://doi.org/10.1007/3-540-54099-7_21

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54099-1

  • Online ISBN: 978-3-540-47405-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation