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

  • Yehuda Afek
  • Danny Dolev
  • Eli Gafni
  • Michael Merritt
  • Nir Shavit
Conference paper

DOI: 10.1007/3-540-54099-7_28

Part of the Lecture Notes in Computer Science book series (LNCS, volume 486)
Cite this paper as:
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

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

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