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

  • Yehuda Afek
  • Danny Dolev
  • Eli Gafni
  • Michael Merritt
  • Nir Shavit
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 486)


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [ABND+87]
    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. [AG88]
    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. [DGS88]
    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. [Dij65]
    E.W. Dijkstra. Solution of a problem in concurrent programming control. Communications Of The ACM, 8:165, 1965.Google Scholar
  5. [DS89]
    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. [FLBB79]
    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. [FLBB89]
    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. [H88]
    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. [Kat78]
    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. [Lam74]
    L. Lamport. A new solution of dijkstra's concurrent programming problem. Communications of the ACM, 78(8):453–455, 1974.Google Scholar
  11. [L86a]
    L. Lamport, On interprocess communication. Part I: Basic formalism. Distributed Computing 1, 2 1986, 77–85.Google Scholar
  12. [L86b]
    L. Lamport, On interprocess communication. Part II: Algorithms. Distributed Computing 1, 2 1986, pp. 86–101.Google Scholar
  13. [Lam86]
    Leslie Lamport. The mutual exclusion problem.part ii: Statement and solutions. J. ACM, 33(2):327–348, 1986.Google Scholar
  14. [Pet81]
    G. L. Peterson. Myths about the mutual exclusion problem. Information Processing Letters, 12(3):115–116, 1981.Google Scholar
  15. [P83]
    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. [Pet88]
    G. Peterson. personal communication. unpublished, 1988.Google Scholar
  17. [Rud81]
    Larry Rudolph. Software Structures for Ultra-Parallel Computing. PhD thesis, New York University, 1981.Google Scholar

Copyright information

© Springer-Verlag 1991

Authors and Affiliations

  • Yehuda Afek
    • 1
  • Danny Dolev
    • 2
  • Eli Gafni
    • 3
    • 1
  • Michael Merritt
    • 4
  • Nir Shavit
    • 5
  1. 1.AT&T Bell Laboratories and Tel-Aviv UniversityIsrael
  2. 2.IBM Almaden Research Center and Hebrew University JerusalemIsrael
  3. 3.Tel-Aviv UniversityIsrael
  4. 4.AT&T Bell LaboratoriesUSA
  5. 5.IBM Almaden Research Center and Stanford UniversityUSA

Personalised recommendations