Subconsensus Tasks: Renaming Is Weaker Than Set Agreement
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.
KeywordsInternal Face Protocol Complex Combinatorial Topology Private Output Asynchronous Computation
Unable to display preview. Download preview PDF.
- 3.Borowsky, E., Gafni, E.: Generalized FLP impossibility result for t-resilient asynchronous computations. In: Proceedings of the 1993 ACM Symposium on Theory of Computing, pp. 206–215 (May 1993)Google Scholar
- 6.Chaudhuri, S.: Agreement is harder than consensus: Set consensus problems in totally asynchronous systems. In: Proceedings Of The Ninth Annual ACM Symposium On Principles of Distributed Computing, pp. 311–234 (August 1990) Google Scholar
- 7.Fischer, M., Lynch, N.A., Paterson, M.S.: Impossibility of distributed commit with one faulty process. Journal of the ACM 32(2) (April 1985)Google Scholar
- 13.Saks, M., Zaharoglou, F.: Wait-free k-set agreement is impossible: The topology of public knowledge. In: Proceedings of the 1993 ACM Symposium on Theory of Computing, pp. 101–110 (May 1993)Google Scholar