Distributed Algorithms

Volume 486 of the series Lecture Notes in Computer Science pp 422-431


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

  • Yehuda AfekAffiliated withAT&T Bell Laboratories and Tel-Aviv University
  • , Danny DolevAffiliated withIBM Almaden Research Center and Hebrew University Jerusalem
  • , Eli GafniAffiliated withTel-Aviv UniversityAT&T Bell Laboratories and Tel-Aviv University
  • , Michael MerrittAffiliated withAT&T Bell Laboratories
  • , Nir ShavitAffiliated withIBM Almaden Research Center and Stanford University

* Final gross prices may vary according to local VAT.

Get Access


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.