About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Paper
A Bounded First-in, First-Enabled Solution to the l-Exclusion Problem
Abstract
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. © 1994, ACM. All rights reserved.