A Bounded First-In, First-Enabled Solution to the l-Exclusion Problem
- Publication date
- Publisher
Abstract
This paper presents a solution to the first-come, first-enabled `-exclusion problem of [?]. Unlike the solution in [?], this solution does not use powerful read-modify-write synchronization primitives, and requires only bounded shared memory. Use of the concurrent timestamp system of [?] is key in solving the problem within bounded shared memory. Categories and Subject Descriptors: D.4.1 [Operating Systems]: Process Management---Mutua