Skip to main content

Brief Announcement: Wait-Free Dining for Eventual Weak Exclusion

  • Conference paper
Stabilization, Safety, and Security of Distributed Systems (SSS 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4280))

Included in the following conference series:

Abstract

We present the first wait-free solution to dining philosophers under eventual weak exclusion in partially synchronous environments subject to crash faults. Potential applications include distributed daemon refinement for self-stabilizing algorithms.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

References

  1. Beauquier, J., Datta, A.K., Gradinariu, M., Magniette, F.: Self-Stabilizing Local Mutual Exclusion and Daemon Refinement. Chicago J. Theor. Comput. Sci. (2002)

    Google Scholar 

  2. Chandra, T.D., Toueg, S.: Unreliable failure detectors for reliable distributed systems. Journal of the ACM 43(2), 225–267 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  3. Choy, M., Singh, A.K.: Localizing Failures in Distributed Synchronization. IEEE Transactions on Parallel and Distribruted Systems (TPDS) 7(7), 705–716 (1996)

    Article  Google Scholar 

  4. Dijkstra, E.W.: Hierarchical ordering of sequential processes. Acta Informatica 1(2), 115–138 (1971), Reprinted in Hoare, C.A.R., Perrot, R.H. (eds.): Operating Systems Techniques, pp. 72–93. Academic Press, London (1972) (Appeared also as EWD310)

    Google Scholar 

  5. Lynch, N.: Fast allocation of nearby resources in a distributed system. In: Proceedings of the 12th ACM Symposium on Theory of Computing (STOC), pp. 70–81 (1980)

    Google Scholar 

  6. Nesterenko, M., Arora, A.: Stabilization-Preserving Atomicity Refinement. Journal of Parallel and Distributed Computing 62(5), 766–791 (2002)

    Article  MATH  Google Scholar 

  7. Pike, S.M., Sivilotti, P.A.G.: Dining Philosophers with Crash Locality 1. In: Proceedings of the 24th IEEE International Conference on Distributed Computing Systems (ICDCS), pp. 22–29. IEEE, Los Alamitos (2004)

    Chapter  Google Scholar 

  8. Pike, S.M., Song, Y., Ghoshal, K.: Wait-Free Dining under Eventual Weak Exclusion. Tech Report 2006-5-1, Texas A&M University (May 2006), Available at: http://www.cs.tamu.edu/academics/tr/tamu-cs-tr-2006-5-1

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pike, S.M., Song, Y., Ghoshal, K. (2006). Brief Announcement: Wait-Free Dining for Eventual Weak Exclusion. In: Datta, A.K., Gradinariu, M. (eds) Stabilization, Safety, and Security of Distributed Systems. SSS 2006. Lecture Notes in Computer Science, vol 4280. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-49823-0_46

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-49823-0_46

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-49018-0

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics