MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  A bounded first-in, first-enabled solution to the `-exclusion problem (1994) [15 citations — 3 self]

Download:
pdf | ps
by Yehuda Afek, Danny Dolev, Eli Gafni, Michael Merritt, Nir Shavit
ACM Transactions on Programming Languages and Systems
ftp://ftp.math.tau.ac.il/pub/afek/fifolx.ps
Add To MetaCart

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---Mutual exclusion Additional Key Words and Phrases: concurrency, time stamps, atomic registers.

Citations

498 Wait-Free Synchronization – Herlihy - 1991
449 Self-Stabilizing Systems in Spite of Distributed Control – Dijkstra - 1974
213 Solution of a Problem in Concurrent Programming Control – Dijkstra - 1974
161 A new solution of Dijkstra’s concurrent programming problem – Lamport - 1974
142 Hierarchical ordering of sequential processes – Dijkstra - 1971
122 The drinking philosophers problem – Chandy, MiSra - 1984
118 Atomic Snapshots of Shared Memory – Afek, Attiya, et al.
107 Myths About the Mutual Exclusion Problem – Peterson - 1981
52 The mutual exclusion problem—part ii: Statement and solutions – Lamport - 1985
42 Bounded concurrent time-stamp systems are constructible – Dolcv, Shavit - 1989
38 Achievable cases in an asynchronous environment – Attiya, Bar-Noy, et al. - 1987
31 Resource Allocation with Immunity to Limited Process Failure (preliminary report – Fischer, Lynch, et al. - 1979
30 Time-Lapse snapshots – Dwork, Herlihy, et al. - 1992
28 A Borodin. Distributed fifo allocation of identical resources using small shared space – Fischer, Lynch, et al. - 1989
25 Concurrent timestamping made simple – Gawlick, Lynch, et al. - 1992
23 Simple and Efficient Bounded Concurrent Timestamping or Bounded Concurrent Timestamp Systems are Comprehensible – Dwork, Waarts - 1992
18 A concurrent Time-Stamp scheme which is linear in time and space – Israeli, Pinhasov - 1992
8 Toward a non-atomic era: `-exclusion as a test case – Dolev, Gafni, et al. - 1988
8 A new solution to the critical section problem – Katseff - 1978
5 Software structures for ultraparallel computing – Rudolph - 1981
View or Download | Add to My Collection | Correct Errors