Subconsensus tasks: renaming is weaker than set agreement

Authors:
Eli Gafni;Sergio Rajsbaum;Maurice Herlihy
Affiliations:
Computer Science Department, UCLA, Los Angeles, CA;Instituto de Matemáticas, Universidad Nacional Autónoma de México, Ciudad Universitaria, D.F., Mexico;Computer Science Department, Brown University, Providence, RI
Venue:
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Year:
2006

Citing 13
Cited 27

Renaming in an asynchronous environment

Journal of the ACM (JACM)
Agreement is harder than consensus: set consensus problems in totally asynchronous systems

PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Wait-free synchronization

ACM Transactions on Programming Languages and Systems (TOPLAS)
Immediate atomic snapshots and fast renaming

PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Generalized FLP impossibility result for t-resilient asynchronous computations

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Wait-free k-set agreement is impossible: the topology of public knowledge

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
The asynchronous computability theorem for t-resilient tasks

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Impossibility of distributed consensus with one faulty process

Journal of the ACM (JACM)
A simple algorithmically reasoned characterization of wait-free computation (extended abstract)

PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Round-by-round fault detectors (extended abstract): unifying synchrony and asynchrony

PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
The topological structure of asynchronous computability

Journal of the ACM (JACM)
Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge

SIAM Journal on Computing
The Combinatorial Structure of Wait-Free Solvable Tasks

SIAM Journal on Computing

Failure detectors are schedulers

Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Anti-Ω: the weakest failure detector for set agreement

Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Failure detectors in loosely named systems

Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
New combinatorial topology upper and lower bounds for renaming

Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
An impossibility about failure detectors in the iterated immediate snapshot model

Information Processing Letters
The Iterated Restricted Immediate Snapshot Model

COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
The 0---1-Exclusion Families of Tasks

OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
From adaptive renaming to set agreement

Theoretical Computer Science
The extended BG-simulation and the characterization of t-resiliency

Proceedings of the forty-first annual ACM symposium on Theory of computing
The topology of shared-memory adversaries

Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Recursion in distributed computing

SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Distributed programming with tasks

OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Turning adversaries into friends: simplified, made constructive, and extended

OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
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
Read-write reductions

ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
New combinatorial topology bounds for renaming: The upper bound

Journal of the ACM (JACM)
Iterated shared memory models

LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
An equivariance theorem with applications to renaming

LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Renaming is weaker than set agreement but for perfect renaming: a map of sub-consensus tasks

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)
Brief announcement: there are plenty of tasks weaker than perfect renaming and stronger than set agreement

PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
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
Upper bound on the complexity of solving hard renaming

Proceedings of the 2013 ACM symposium on Principles of distributed computing
A non-topological proof for the impossibility of k-set agreement

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the the relative power of two important synchronization problems: set agreement and renaming. We show that renaming is strictly weaker than set agreement, in a round-by-round model of computation. We introduce new techniques, including previously unknown connections between properties of manifolds and computation, as well as novel “symmetry-breaking” constructions.