Download:
|
by Hagit Attiya, Arie Fouren
SIAM Journal on Computing
http://www.cs.technion.ac.il/~hagit/pubs/AF98rev.ps.gz
Add To MetaCart
Abstract:
In a shared-memory system, n independent asynchronous processes, with distinct names in the range f0; : : : ; N \Gamma 1g, communicate by reading and writing to shared registers. An algorithm is wait-free if a process completes its execution regardless of the behavior of other processes. This paper considers wait-free algorithms whose complexity adjusts to the level of contention in the system: An algorithm is adaptive (to total contention) if its step complexity depends only on the actual number of active processes, k; this number is unknown in advance and may change in different executions of the algorithm. Adaptive algorithms are presented for two important decision problems, lattice agreement and (6k \Gamma 1)-renaming; the step complexity of both algorithms is O(k log k). An interesting component of the (6k \Gamma 1)-renaming algorithm is an O(N) algorithm for (2k \Gamma 1)-renaming; this substantially improves on the best previously known (2k \Gamma 1)-renaming algorithm, which has O(Nnk) step complexity. The efficient renaming algorithm can be modified into an O(N) implementation of atomic snapshots using dynamic single-writer multi-reader registers. The best known implementations of atomic snapshots have step complexity O(N log N) using static single-writer multi-reader registers, and O(N) using multi-writer multi-reader registers.
Citations
|
179
|
A Fast Mutual Exclusion Algorithm
– Lamport
- 1983
|
|
161
|
A new solution of Dijkstra’s concurrent programming problem
– Lamport
- 1974
|
|
118
|
Atomic Snapshots of Shared Memory
– Afek, Attiya, et al.
|
|
94
|
Shavit The Asynchronous Computability Theorem for t-resilent Tasks
– Herlihy, N
- 1993
|
|
76
|
Renaming in an asynchronous environment
– Attiya, Bar-Noy, et al.
- 1990
|
|
60
|
Immediate atomic snapshots and fast renaming
– Borowsky, Gafni
- 1993
|
|
53
|
The topological Structure of Asynchronous Computability
– Herlihy, Shavit
- 1999
|
|
52
|
Adaptive solutions to the mutual exclusion problem
– Choy, Singh
- 1994
|
|
52
|
Wait-free algorithms for fast, long-lived renaming
– Moir, Anderson
- 1995
|
|
47
|
Wait-Free Made Fast
– Afek, Dauber, et al.
- 1995
|
|
37
|
Adaptive wait-free algorithms for lattice agreement and renaming
– Attiya, Fouren
- 1998
|
|
36
|
Long-lived renaming made adaptive
– Afek, Attiya, et al.
- 1999
|
|
35
|
Results about fast mutual exclusion
– Alur, Taubenfeld
- 1992
|
|
33
|
Atomic snapshots in O(n log n) operations
– Attiya, Rachman
- 1998
|
|
33
|
The ambiguity of choosing
– Burns, Peterson
- 1989
|
|
30
|
Long-lived and adaptive collect with applications
– Afek, Stupp, et al.
- 1999
|
|
21
|
An adaptive collect algorithm with applications. Submitted for publication. Available at www.cs.technion.ac.il/,hagit/pubs/AF99ful.ps.gz
– Attiya, Fouren, et al.
- 1999
|
|
20
|
Adaptive and efficient mutual exclusion
– Attiya, Bortnikov
- 2000
|
|
19
|
Atomic snapshots using lattice agreement
– Attiya, Herlihy, et al.
- 1995
|
|
14
|
A partial equivalence between shared-memory and messagepassing in an asynchronous fail-stop distributed environment. Mathematical Systems Theory
– Bar-Noy, Dolev
- 1993
|
|
14
|
wait-free (2k \Gamma 1)-renaming
– Fast
- 1999
|
|
12
|
Using local-spin k-exclusion algorithms to improve wait-free object implementation
– Anderson, Moir
- 1997
|
|
12
|
long-lived renaming improved and simplified
– Fast
- 1998
|
|
10
|
Linear-time snapshot using multi-writer multi-reader registers
– Inoue, Chen, et al.
- 1994
|
|
8
|
long-lived renaming improved and simplified
– Moir, Fast
- 1998
|
|
4
|
Long-lived adaptive splitter and applications. Unpublished manuscript
– Afek, Stupp, et al.
- 1999
|
|
4
|
Exponential examples for two renaming algorithms. Available at www.cs.technion.ac.il/hagit/pubs/expo.ps.gz
– Fouren
- 1999
|
|
2
|
wait-free (2k \Gamma 1)-renaming
– Afek, Merritt, et al.
- 1999
|
|
1
|
and adaptive collect with applications
– Long-lived
- 1999
|
|
1
|
and adaptive atomic snapshot and immediate snapshot
– Long-lived
|
|
1
|
and adaptive long-lived (2k-1)-renaming
– Polynomial
|
