Early-stopping distributed bidding and applications

  • Navin Budhiraja
  • Ajei Gopal
  • Sam Toueg
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 486)


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.


Correct Process Message Delivery Outcome Vector Broadcast Algorithm Faulty Process 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [CDDS85]
    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. [Coa88]
    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. [Cri89]
    Flaviu Cristian. Probabilistic clock synchronization. Distributed Computing, 3:146–158, 1989.Google Scholar
  4. [CS87]
    Flaviu Cristian and Ray Strong. A family of early-delivery atomic broadcast protocols, June 1987. IBM Almaden Research Center, Unpublished manuscript.Google Scholar
  5. [DRS82]
    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. [DS83]
    Danny Dolev and H. Ray Strong. Authenticated algorithms for Byzantine agreement. SIAM Journal on Computing, 12(4):656–666, November 1983.Google Scholar
  7. [GSTC90]
    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. [HK89]
    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. [LSP82]
    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. [MW88]
    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. [NT88]
    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. [PT84]
    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. [PT86]
    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. [Sch90]
    Fred Schneider. Implementing fault-tolerant services using the state machine approach: A tutorial. ACM Computing Surveys, 1990. To Appear.Google Scholar
  15. [ST87]
    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. [TPS87]
    Sam Toueg, Kenneth J. Perry, and T. K. Srikanth. Fast distributed agreement. SIAM Journal on Computing, 16(3):445–457, June 1987.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Navin Budhiraja
    • 1
  • Ajei Gopal
    • 1
  • Sam Toueg
    • 1
  1. 1.Department of Computer ScienceCornell UniversityIthaca

Personalised recommendations