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

Open Webpage

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

Published: 1994, Last Modified: 13 Nov 2024ACM Trans. Program. Lang. Syst. 1994EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: This article presents a solution to the first-come, first-enabled ℓ-exclusion problem of Fischer et al. [1979]. Unlike their solution, this solution does not use powerful read-modify-write synchronization primitives and requires only bounded shared memory. Use of the concurrent timestamp system of Dolev and Shavir [1989] is key in solving the problem within bounded shared memory.