Reaching approximate agreement in the presence of faults
Journal of the ACM (JACM)
Extended impossibility results for asynchronous complete networks
Information Processing Letters
Renaming in an asynchronous environment
Journal of the ACM (JACM)
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
More choices allow more faults: set consensus problems in totally asynchronous systems
Information and Computation
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
The decidability of distributed decision tasks (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
ACM Transactions on Computer Systems (TOCS)
Fast, wait-free (2k-1)-renaming
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
The topological structure of asynchronous computability
Journal of the ACM (JACM)
The Combinatorial Structure of Wait-Free Solvable Tasks
SIAM Journal on Computing
A classification of wait-free loop agreement tasks
Theoretical Computer Science - Special issue: Distributed computing
Local and global properties in networks of processors (Extended Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
New combinatorial topology upper and lower bounds for renaming
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
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
Communication and Agreement Abstractions for Fault-tolerant Asynchronous Distributed Systems
Communication and Agreement Abstractions for Fault-tolerant Asynchronous Distributed Systems
Subconsensus tasks: renaming is weaker than set agreement
DISC'06 Proceedings of the 20th international conference on Distributed Computing
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
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
Hi-index | 0.00 |
Processes in a concurrent system need to coordinate using a shared memory or a message-passing subsystem in order to solve agreement tasks such as, for example, consensus or set agreement. However, coordination is often needed to "break the symmetry" of processes that are initially in the same state, for example, to get exclusive access to a shared resource, to get distinct names or to elect a leader. This paper introduces and studies the family of generalized symmetry breaking (GSB) tasks, that includes election, renaming and many other symmetry breaking tasks. Differently from agreement tasks, a GSB task is "inputless", in the sense that processes do not propose values; the task only specifies the symmetry breaking requirement, independently of the system's initial state (where processes differ only on their identifiers). Among various results characterizing the family of GSB tasks, it is shown that (non adaptive) perfect renaming is universal for all GSB tasks.