Skip to main content
SpringerLink
Log in

Self Stabilizing Distributed Queuing

  • Conference paper
  • First Online:
Book cover Distributed Computing (DISC 2001)

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

Included in the following conference series:

Abstract

Distributed queuing is a fundamental problem in distributed computing, arising in a variety ofapplications. In a distributed queuing protocol, each participating process informs its predecessor of its identity, and (when appropriate) learns the identity ofits successor. This paper presents a new, self-stabilizing distributed queuing protocol. This protocol adds self-stabilizing actions to the Arrow distributed queuing protocol, a simple path-reversal protocol that runs on a network spanning tree.

The protocol is structured as a layer that runs on top ofan y selfstabilizing spanning tree protocol. This additional layer stabilizes in constant time, establishing that self-stabilizing distributed queuing is no more difficult than self-stabilizing spanning tree maintenance. The key idea is that the global predicate defining the legality ofa protocol state can be written as the conjunction ofman y purely local predicates, one for each edge of the spanning tree.

Acknowledgments

The second author is grateful to Steve Reiss for helpful discussions and ideas.

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. S. Aggarwal and S. Kutten. Time optimal self-stabilizing spanning tree algorithm. In FSTTCS93 Proceedings of the 13th Conference on Foundations of Software Technology and Theoretical Computer Science, Springer-Verlag LNCS:761, pages 400–410, 1993.

    Google Scholar 

  2. G. Antonoiu and P. Srimani. Distributed self-stabilizing algorithm for minimum spanning tree construction. In Euro-par’97 Parallel Processing, Proceedings LNCS:1300, pages 480–487. Springer-Verlag, 1997.

    Chapter  Google Scholar 

  3. B. Awerbuch, B. Patt-Shamir, and G. Varghese. Self-stabilization by local checking and correction. In FOCS91 Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science, pages 268–277, 1991.

    Google Scholar 

  4. M. Demmer and M. Herlihy. The arrow directory protocol. In Proceedings of 12th International Symposium on Distributed Computing, Sept. 1998.

    Google Scholar 

  5. E. Dijkstra. Selfstabilizing systems in spite ofdistributed control. Communications of the ACM, 17:643–644, 1974.

    Article  MATH  Google Scholar 

  6. S. Dolev, A. Israeli, and S. Moran. Self-stabilization of dynamic systems assuming only read/write atomicity. Distributed Computing, 7:3–16, 1993.

    Article  Google Scholar 

  7. M. Gouda and N. Multari. Stabilizing communication protocols. IEEE Transactions on Computers, 40:448–458, 1991.

    Article  Google Scholar 

  8. M. Herlihy. The aleph toolkit: Support for scalable distributed shared objects. In Workshop on Communication, Architecture, and Applications for Network-based Parallel Computing (CANPC), January 1999.

    Google Scholar 

  9. M. Herlihy, S. Tirthapura, and R. Wattenhofer. Competitive concurrent distributed queuing. In Proceedings of the ACM Symposium on Principles of Distributed Computing (to appear), August 2001.

    Google Scholar 

  10. M. Herlihy, S. Tirthapura, and R. Wattenhofer. Ordered multicast and distributed swap. Operating Systems Review, 35(1):85–96, January 2001.

    Article  Google Scholar 

  11. M. Herlihy and M. Warres. A tale oft wo directories: implementing distributed shared objects in java. Concurrency-Practice and Experience, 12(7):555–572, 2000.

    Article  MATH  Google Scholar 

  12. K. Raymond. A tree-based algorithm for distributed mutual exclusion. ACM Transactions on Computer Systems, 7(1):61–77, 1989.

    Article  MathSciNet  Google Scholar 

  13. M. Schneider. Self-stabilization. ACM Computing Surveys, 25:45–67, 1993.

    Article  Google Scholar 

  14. G. Varghese. Self-stabilization by counter flushing. In Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, pages 244–253, 1994.

    Google Scholar 

  15. G. Varghese, A. Arora, and M. Gouda. Self-stabilization by tree correction. Chicago Journal of Theoretical Computer Science, (3):1–32, 1997.

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Brown University, Providence, RI, 02912-1910, USA

    Maurice Herlihy & Srikanta Tirthapura

Authors
  1. Maurice Herlihy
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Srikanta Tirthapura
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Texas A&M University, College Station, TX, 77843-3112, USA

    Jennifer Welch

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Herlihy, M., Tirthapura, S. (2001). Self Stabilizing Distributed Queuing. In: Welch, J. (eds) Distributed Computing. DISC 2001. Lecture Notes in Computer Science, vol 2180. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45414-4_15

Download citation

  • DOI: https://doi.org/10.1007/3-540-45414-4_15

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-45414-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation