by Extended Abstract, Hagit Attiya, Sergio Rajsbaum
http://theory.lcs.mit.edu/~rajsbaum/wdag96.ps
Add To MetaCart
Abstract:
y Abstract. This paper presents a self-contained study of wait-free solvable tasks. A new necessary and sufficient condition for wait-free solvability is proved, providing a characterization of the wait-free solvable tasks. The necessary condition is used to prove tight bounds on renaming and k-set consensus. The framework is based on topology, but uses only elementary combinatorics, and does not rely on algebraic or geometric arguments. 1
Citations
|
249
|
Algebraic Topology
– Spanier
- 1966
|
|
198
|
Elements of algebraic topology
– Munkres
- 1984
|
|
98
|
Generalized FLP impossibility result for t-resilient asynchronous computations
– Borowsky, Gafni
- 1993
|
|
94
|
Shavit The Asynchronous Computability Theorem for t-resilent Tasks
– Herlihy, N
- 1993
|
|
77
|
Reaching Approximate Agreement in the Presence of Faults
– Dolev, Lynch, et al.
- 1986
|
|
76
|
Renaming in an asynchronous environment
– Attiya, Bar-Noy, et al.
- 1990
|
|
60
|
Immediate atomic snapshots and fast renaming
– Borowsky, Gafni
- 1993
|
|
60
|
Wait-free k-set agreement is impossible: The topology of public knowledge
– Saks, Zaharoglou
|
|
54
|
More choices allow more faults: Set consensus problems in totally asynchronous systems
– Chaudhuri
- 1993
|
|
54
|
Impossibility of distributed commit with one faulty process
– Fischer, Lynch, et al.
- 1985
|
|
45
|
A Combinatorial Introduction to Topology
– HENLE
- 1997
|
|
39
|
A simple constructive computability theorem for wait-free computation
– Herlihy, Shavit
- 1994
|
|
37
|
Rajsbaum Set Consensus Using Arbitrary Objects
– Herlihy, S
- 1994
|
|
33
|
Algebraic spans
– Herlihy, Rajsbaum
- 2000
|
|
25
|
A tight lower bound for k-set agreement
– Chaudhuri, Herlihy, et al.
- 1993
|
|
19
|
A combinatorial characterization of the distributed 1-solvable tasks
– Biran, Moran, et al.
- 1990
|
|
19
|
A Tutorial on Algebraic Topology and Distributed Computation
– Herlihy
- 1994
|
|
10
|
The implication of the Borowsky-Gafni simulation on the set consensus hierarchy
– Borowsky, Gafni
- 1993
|
|
2
|
3-processor tasks are undecidable," brief announcement
– Gafni, Koutsoupias
- 1995
|
|
1
|
Lynch and Nir Shavit, "Are Wait-Free Algorithms Fast
– Attiya, Nancy
- 1994
|
|
1
|
On the Decidability of Distributed Decision Tasks," http://www.cs.brown.edu/people/mph/decide.html. Brief Announcement
– Herlihy, Rajsbaum
- 1996
|
