The Combinatorial Structure of Wait-Free Solvable Tasks

Authors:
Hagit Attiya;Sergio Rajsbaum
Affiliations:
-;-
Venue:
SIAM Journal on Computing
Year:
2002

Citing 0
Cited 18

Condition-Based Protocols for Set Agreement Problems

DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Hundreds of impossibility results for distributed computing

Distributed Computing - Papers in celebration of the 20th anniversary of PODC
New combinatorial topology upper and lower bounds for renaming

Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Asynchronous exclusive selection

Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Stability of Multi-Valued Continuous Consensus11Preliminary Version, Some proofs are omitted from this version.

Electronic Notes in Theoretical Computer Science (ENTCS)
Transforming worst-case optimal solutions for simultaneous tasks into all-case optimal solutions

Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
The universe of symmetry breaking tasks

SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
A non-topological proof for the impossibility of k-set agreement

SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
New combinatorial topology bounds for renaming: The upper bound

Journal of the ACM (JACM)
Subconsensus tasks: renaming is weaker than set agreement

DISC'06 Proceedings of the 20th international conference on Distributed Computing
Musical benches

DISC'05 Proceedings of the 19th international conference on Distributed Computing
An equivariance theorem with applications to renaming

LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
An Inductive-style Procedure for Counting Monochromatic Simplexes of Symmetric Subdivisions with Applications to Distributed Computing

Electronic Notes in Theoretical Computer Science (ENTCS)
An Introduction to the Topological Theory of Distributed Computing with Safe-consensus

Electronic Notes in Theoretical Computer Science (ENTCS)
The renaming problem in shared memory systems: An introduction

Computer Science Review
Computability in distributed computing: a Tutorial

ACM SIGACT News
Counting-based impossibility proofs for renaming and set agreement

DISC'12 Proceedings of the 26th international conference on Distributed Computing
A non-topological proof for the impossibility of k-set agreement

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a self-contained study of wait-free solvable tasks. A new necessary condition for wait-free solvability, based on a restricted set of executions, is proved. This set of executions induces a very simple-to-understand structure, which is used to prove tight bounds for k-set consensus and renaming. The framework is based on topology, but uses only elementary combinatorics, and, in contrast to previous works, does not rely on algebraic or geometric arguments.