The Combinatorial Structure of Wait-free Solvable Tasks (Extended Abstract) (1996)
Cached
Download Links
- [theory.lcs.mit.edu]
- [www.cs.technion.ac.il]
- [www.cs.technion.ac.il]
- [gsd.di.uminho.pt]
- [www.cs.technion.ac.il]
- [www.cs.technion.ac.il]
- DBLP
Other Repositories/Bibliography
by
Hagit Attiya
,
Sergio Rajsbaum
| Citations: | 22 - 13 self |
BibTeX
@MISC{Attiya96thecombinatorial,
author = {Hagit Attiya and Sergio Rajsbaum},
title = {The Combinatorial Structure of Wait-free Solvable Tasks (Extended Abstract) },
year = {1996}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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.
