A Bounded First-in, First-Enabled Solution to the l-Exclusion Problem

Yehuda Afek, Danny Dolev, Eli Gafni, Michael Merritt, Nir Shavit

Research output: Contribution to journalArticlepeer-review


This article presents a solution to the first-come, first-enabled[Formulla Omitted]-exclusionproblem of Fischer et al. [1979]. Unlike their solution, thissolution does not use powerful read-modify-write synchronizationprimitives and requires only bounded shared memory. Use of the concurrent timestamp system of Dolevand Shavir [1989] is key in solving the problem within bounded sharedmemory.

Original languageEnglish
Pages (from-to)939-953
Number of pages15
JournalACM Transactions on Programming Languages and Systems
Issue number3
StatePublished - 5 Jan 1994


  • atomic registers
  • concurrency
  • timestamps


Dive into the research topics of 'A Bounded First-in, First-Enabled Solution to the l-Exclusion Problem'. Together they form a unique fingerprint.

Cite this