Abstract
We address the problem of solving a task T=(T 1,...T m ) (called (m,1)-BG), in which a processor returns in an arbitrary one of m simultaneous consensus subtasks T 1,...T m . Processor p i submits to T an input vector of proposals (prop i,1,...,prop i,m ), one entry per subtask, and outputs, from just one subtask ℓ, a pair (ℓ, prop j,l ) for some j. All processors that output at ℓ output the same proposal.
Let d be a bound on the number of distinct input vectors that may be submitted to T. For example, d=3 if Democrats always vote Democrats across the board, and similarly for Republicans and Libertarians. A wait-free algorithm that immaterial of the number of processors solves T provided m ≥d is presented. In addition, if in each T j we allow k-set consensus rather than consensus, i.e., for each ℓ, the outputs satisfy |{j | prop j , ℓ}| ≤k, then the same algorithm solves T if m ≥⌈d/k ⌉.
What is the power of T=(T 1,...,T m ) when given as a subroutine, to be used by any number of processors with any number of input vectors? Obviously, T solves m-set consensus since each processor p i can submit the vector (id i ,id i ,...id i ), but can m-set consensus solve T? We show it does, and thus simultaneous consensus is a new characterization of set-consensus.
Finally, what if each T j is just a binary-consensus rather than consensus? Then we get the novel problem that was recently introduced of the Committee-Decision. It was shown that for 3 processors and m=2, the simultaneous binary-consensus is equivalent to (3,2)-set consensus. Here, using a variation of our wait-free algorithms mentioned above, we show that a task, in which a processor is required to return in one of m simultaneous binary-consensus subtasks, when used by n processors, is equivalent to (n,m)-set consensus. Thus, while set-consensus unlike consensus, has no binary version, now that we characterize m-set consensus through simultaneous consensus, the notion of binary-set-consensus is well defined. We have then showed that binary-set-consensus is equivalent to set consensus as it was with consensus.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Afek, Y., Attiya, H., Dolev, D., Gafni, E., Merrit, M., Shavit, N.: Atomic Snapshots of Shared Memory. In: Proc. 9th ACM Symposium on Principles of Distributed Computing (PODC 1990), pp. 1–13. ACM Press, New York (1990)
Borowsky, E., Gafni, E.: Generalized FLP Impossibility Results for t-Resilient Asynchronous Computations. In: Proc. 25th ACM Symposium on the Theory of Computing (STOC 1993), pp. 91–100. ACM Press, New York (1993)
Borowsky, E., Gafni, E.: Immediate Atomic Snapshots and Fast Renaming (Extended Abstract). In: Proc. 12th ACM Symposium on Principles of Distributed Computing (PODC 1993), pp. 41–51. ACM Press, New York (1993)
Borowsky, E., Gafni, E., Lynch, N., Rajsbaum, S.: The BG Distributed Simulation Algorithm. Distributed Computing 14(3), 127–146 (2001)
Chaudhuri, S.: More Choices Allow More Faults: Set Consensus Problems in Totally Asynchronous Systems. Information and Computation 105, 132–158 (1993)
Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of Distributed Consensus with One Faulty Process. Journal of the ACM 32(2), 374–382 (1985)
Gafni, E.: Group-Solvability. In: Guerraoui, R. (ed.) DISC 2004. LNCS, vol. 3274, pp. 30–40. Springer, Heidelberg (2004)
Gafni, E., Kouznetsov, P.: Two Front Agreement with Application to Emulation and Robustness (to appear)
Gafni, E., Merritt, M., Taubenfeld, G.: The Concurrency Hierarchy, and Algorithms for Unbounded Concurrency. In: Proc. 21st ACM Symposium on Principles of Distributed Computing (PODC 2001), pp. 161–169. ACM Press, New York (2001)
Gafni, E., Rajsbaum, S.: Musical Benches. In: Fraigniaud, P. (ed.) DISC 2005. LNCS, vol. 3724, pp. 63–77. Springer, Heidelberg (2005)
Gafni, E., Rajsbaum, S., Raynal, M., Travers, C.: The Committee Decision Problem. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol. 3887, pp. 502–514. Springer, Heidelberg (2006)
Herlihy, M.P.: Wait-Free Synchronization. ACM Transactions on programming Languages and Systems 11(1), 124–149 (1991)
Herlihy, M.P., Shavit, N.: The Topological Structure of Asynchronous Computability. Journal of the ACM 46(6), 858–923 (1999)
Mostefaoui, A., Raynal, M., Tronel, F.: From Binary Consensus to Multivalued Consensus in Asynchronous Message-Passing Systems. Information Processing Letters 73, 207–213 (2000)
Merrit, M., Taubenfeld, G.: Computing with infinitely many processes. In: Herlihy, M.P. (ed.) DISC 2000. LNCS, vol. 1914, pp. 164–178. Springer, Heidelberg (2000)
Saks, M., Zaharoglou, F.: Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge. SIAM Journal on Computing 29(5), 1449–1483 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Afek, Y., Gafni, E., Rajsbaum, S., Raynal, M., Travers, C. (2006). Simultaneous Consensus Tasks: A Tighter Characterization of Set-Consensus. In: Chaudhuri, S., Das, S.R., Paul, H.S., Tirthapura, S. (eds) Distributed Computing and Networking. ICDCN 2006. Lecture Notes in Computer Science, vol 4308. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11947950_36
Download citation
DOI: https://doi.org/10.1007/11947950_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68139-7
Online ISBN: 978-3-540-68140-3
eBook Packages: Computer ScienceComputer Science (R0)