This article presents a solution to the first-come, first-enabled[Formulla Omitted]-exclusionproblem of Fischer et al. . 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  is key in solving the problem within bounded sharedmemory.
|Number of pages||15|
|Journal||ACM Transactions on Programming Languages and Systems|
|State||Published - 5 Jan 1994|
- atomic registers