Skip to main content
SpringerLink
Log in

A bounded first-in, first-enabled solution to the l-exclusion problem

  • Conference paper
  • First Online:
Distributed Algorithms (WDAG 1990)

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

Included in the following conference series:

Abstract

This paper presents a solution to the first-in, first out l-exclusion problem of [FLBB79]. Unlike the solution in [FLBB79], this solution is achieved without the use of powerful readmodify-write synchronization primitives, and it requires only bounded size shared memory. Moreover, this solution has the extra property of being first-in, first-enabled, a property which subsumes first-in, first-out. Use of the concurrent time-stamp system of [DS89] is key in solving the problem within bounded size shared memory.

Supported by NSF Presidential Young Investigator Award under grant DCR84-51396 & matching funds from XEROX Co. under grant W881111.

Parts of this research were conducted while the author was at the Hebrew University, visiting AT&T Bell Laboratories and MIT.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H. Attiya, A. Bar-Noy, D. Dolev, D. Koller, D. Peleg, and R. Reischuk. Achievable cases in an asynchronous environment. In Proc. of the 28th IEEE Annual Symp. on Foundation of Computer Science, pages 337–346, October 1987.

    Google Scholar 

  2. J. H. Anderson, and M. G. Gouda, The virtue of patience: concurrent programming with and without waiting. unpublished manuscript, Dept. of Computer Science, Austin, Texas, January 1988.

    Google Scholar 

  3. D. Dolev, E. Gafni, and N. Shavit. Towards a non-atomic era: l-exclusion as a test case. In Proceedings of the 20th Annual ACM Symposium on Theory of Computing. ACM SIGACT, ACM, 1988.

    Google Scholar 

  4. E.W. Dijkstra. Solution of a problem in concurrent programming control. Communications Of The ACM, 8:165, 1965.

    Google Scholar 

  5. D. Dolev and N. Shavit. Bounded concurrent time-stamp systems are constructible. In Proceedings of the 21st Annual ACM Symposium on Theory of Computing, Seattle, Washington, pages 454–465. ACM SIGACT, ACM, 1989.

    Google Scholar 

  6. M. Fischer, N. Lynch, J. Burns, and A. Borodin. Resource allocation with immunity to limited process failure. In Proceedings of 20th FOCS, pages 234–254, October 1979.

    Google Scholar 

  7. M. Fischer, N. Lynch, J. Burns, and A. Borodin. Distributed fifo allocation of identical resources using small shared space. ACM Transactions on Programming Languages and Systems, 11(1):90–114, January 1989.

    Google Scholar 

  8. M. P. Herlihy, Wait free implementations of concurrent objects, Proc. 7th ACM Symp. on Principles of Distributed Computing, 1988, pp. 276–290.

    Google Scholar 

  9. H. Katseff. A new solution to the critical section problem. In Proceedings of the 10th Annual ACM Symposium on Theory of Computing, pages 86–88. ACM, 1978.

    Google Scholar 

  10. L. Lamport. A new solution of dijkstra's concurrent programming problem. Communications of the ACM, 78(8):453–455, 1974.

    Google Scholar 

  11. L. Lamport, On interprocess communication. Part I: Basic formalism. Distributed Computing 1, 2 1986, 77–85.

    Google Scholar 

  12. L. Lamport, On interprocess communication. Part II: Algorithms. Distributed Computing 1, 2 1986, pp. 86–101.

    Google Scholar 

  13. Leslie Lamport. The mutual exclusion problem.part ii: Statement and solutions. J. ACM, 33(2):327–348, 1986.

    Google Scholar 

  14. G. L. Peterson. Myths about the mutual exclusion problem. Information Processing Letters, 12(3):115–116, 1981.

    Google Scholar 

  15. G. L. Peterson, Concurrent reading while writing. ACM Transactions on Programming Languages and Systems, Vol. 5, No. 1 (January 1983), pp. 46–55.

    Google Scholar 

  16. G. Peterson. personal communication. unpublished, 1988.

    Google Scholar 

  17. Larry Rudolph. Software Structures for Ultra-Parallel Computing. PhD thesis, New York University, 1981.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. AT&T Bell Laboratories and Tel-Aviv University, Israel

    Yehuda Afek & Eli Gafni

  2. IBM Almaden Research Center and Hebrew University Jerusalem, Israel

    Danny Dolev

  3. Tel-Aviv University, Israel

    Eli Gafni

  4. AT&T Bell Laboratories, USA

    Michael Merritt

  5. IBM Almaden Research Center and Stanford University, USA

    Nir Shavit

Authors
  1. Yehuda Afek
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Danny Dolev
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Eli Gafni
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Michael Merritt
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Nir Shavit
    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

Afek, Y., Dolev, D., Gafni, E., Merritt, M., Shavit, N. (1991). A bounded first-in, first-enabled solution to the l-exclusion problem. 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_28

Download citation

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

  • 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