Renaming in an asynchronous environment
Journal of the ACM (JACM)
Atomic snapshots of shared memory
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
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
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
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
Three-Processor Tasks Are Undecidable
SIAM Journal on Computing
The topological structure of asynchronous computability
Journal of the ACM (JACM)
A Simple Algorithmic Characterization of Uniform Solvability
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
New combinatorial topology upper and lower bounds for renaming
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Subconsensus tasks: renaming is weaker than set agreement
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Distributed programming with tasks
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
A survey on some recent advances in shared memory models
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
The universe of symmetry breaking tasks
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
New combinatorial topology bounds for renaming: The upper bound
Journal of the ACM (JACM)
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
Counting-based impossibility proofs for renaming and set agreement
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Hi-index | 0.00 |
Interesting tasks are scarce. Yet, they are essential as an investigation material, if we are to understand the structure of the tasks world. We propose a new collection of families of tasks called 0-1 Exclusion tasks, and show that families in this collection are interesting. A 0-1 Exclusion task on n processors is specified by a sequence of n *** 1 bits b (1),b (2),...,b (n *** 1). For participating set of size k , 0 k n , each processor is to output 0 or 1 but they should not all output b (k ). When the participating set is of size n , then they should all output neither all 0's nor all 1's. A family of tasks, one for each n , is created by considering an infinite sequence of bits b (k ), k = 2,3,..., such that the sequence that specifies instant n , is a prefix of the sequence that specifies the n + 1'st instance. Only one family in the collection, the one specified by b (1) = b (2) = ...= 1, was implicitly considered in the past and shown to be equivalent to Set- Consensus. In this initial investigation of the whole collection we show that not all of its members are created equal. We take the family specified by b (1) = 1,b (2) = b (3) = ... = 0, and show that it is read-write unsolvable for all n , but is strictly weaker than Set-Consensus for n odd. We show some general results about the whole collection. It is sandwiched between Set-Consensus from above and Weak-Symmetry-Breaking from below. Any Black-Box of n ports that solves a 0-1 Exclusion task, can be used to solve that task for n processors with ids from unbounded domain. Finally we show an intriguing relation between Strong-Renaming and the 0-1 Exclusion families, and make few conjectures about the implementations relationships among members of the collection, as well as possibly tasks outside it.