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.
Original language | English |
---|---|
Pages (from-to) | 939-953 |
Number of pages | 15 |
Journal | ACM Transactions on Programming Languages and Systems |
Volume | 16 |
Issue number | 3 |
DOIs | |
State | Published - 5 Jan 1994 |
Keywords
- atomic registers
- concurrency
- timestamps