In a shared-memory distributed system, n independent asynchronous processes communicate by reading and writing to shared memory. An algorithm is adaptive (to total contention) if its step complexity depends only on the actual number, k, of active processes in the execution; this number is unknown in advance and may change in different executions of the algorithm. Adaptive algorithms are inherently wait-free, providing fault-tolerance in the presence of an arbitrary number of crash failures and different processes ' speed. A wait-free adaptive collect algorithm with O(k) step complexity is presented, together with its applications in wait-free adaptive algorithms for atomic snapshots, immediate snapshots and renaming.
|
531
|
Linearizability: a correctness condition for concurrent objects
– Herlihy, Wing
- 1990
|
|
498
|
Wait-Free Synchronization
– Herlihy
- 1991
|
|
179
|
A Fast Mutual Exclusion Algorithm
– Lamport
- 1983
|
|
118
|
Atomic Snapshots of Shared Memory
– Afek, Attiya, et al.
|
|
97
|
Generalized FLP impossibility result for t-resilient asynchronous computations
– Borowsky, Gafni
- 1993
|
|
76
|
Renaming in an asynchronous environment
– Attiya, Bar-Noy, et al.
- 1990
|
|
69
|
On achieving consensus using a shared memory
– Abrahamson
- 1988
|
|
60
|
Immediate atomic snapshots and fast renaming
– Borowsky, Gafni
- 1993
|
|
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
|
|
26
|
Capturing the Power of Resiliency and Set-Consensus in Distributed Systems
– Borowsky
- 1995
|
|
19
|
Atomic snapshots using lattice agreement
– Attiya, Herlihy, et al.
- 1995
|
|
18
|
The combinatorial structure of wait-free solvable tasks
– Attiya, Rajsbaum
- 1996
|
|
14
|
wait-free (2k \Gamma 1)-renaming
– Fast
- 1999
|
|
14
|
A partial equivalence between shared-memory and messagepassing in an asynchronous fail-stop distributed environment. Mathematical Systems Theory
– Bar-Noy, Dolev
- 1993
|
|
13
|
Modular competitiveness for distributed algorithms
– Aspnes, Waarts
- 1996
|
|
13
|
Bounded round numbers
– Dwork, Herlihy, et al.
- 1993
|
|
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
|
Long-lived and adaptive atomic snapshot and immediate snapshot
– Afek, Stupp, et al.
- 2000
|
|
8
|
long-lived renaming improved and simplified
– Moir, Fast
- 1998
|
|
6
|
The instancy of snapshots and commuting objects
– Afek, Weisberger
- 1999
|
|
6
|
Polynomial and adaptive long-lived (2k-1)-renaming
– Attiya, Fouren
- 2000
|
|
5
|
Public communication
– Gafni
- 1998
|
|
4
|
Exponential examples for two renaming algorithms. Available at www.cs.technion.ac.il/hagit/pubs/expo.ps.gz
– Fouren
- 1999
|
|
2
|
On uniform protocols. Unpublished manuscript
– Gafni, Koutsoupias
- 1998
|
|
