Abstract
In the consensus task each process proposes a value, and all correct processes have to decide the same value. In addition, validity requires that the decided value is a proposed value. Afek, Gafni and Lieber (DISC’09) introduced the safe-consensus task, by weakening the validity requirement: if the first process to invoke the task returns before any other process invokes it, then it outputs its input; otherwise, when there is concurrency, the consensus output can be arbitrary, not even the input of any process. Surprisingly, they showed that safe-consensus is equivalent to consensus, in a system where any number of processes can crash (e.g., wait-free).
We show that safe-consensus is nevertheless a much weaker communication primitive, in the sense that any wait-free implementation of consensus requires \(\binom{n}{2}\) safe-consensus black-boxes, and this bound is tight. The lower bound proof uses connectivity arguments based on subgraphs of Johnson graphs. For the upper bound protocol that we present, we introduce the g-2coalitions-consensus task, which may be of independent interest. We work in an iterated model of computation, where the processes repeatedly: write their information to a (fresh) shared array, invoke safe-consensus boxes and snapshot the contents of the shared array.
Keywords
Partially supported by PAPIIT-UNAM IN107714.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Afek, Y., Attiya, H., Dolev, D., Gafni, E., Merritt, M., Shavit, N.: Atomic snapshots of shared memory. J. ACM 40(4), 873–890 (1993)
Afek, Y., Gafni, E., Lieber, O.: Tight group renaming on groups of size g is equivalent to g-consensus. In: Keidar, I. (ed.) DISC 2009. LNCS, vol. 5805, pp. 111–126. Springer, Heidelberg (2009)
Afek, Y., Gamzu, I., Levy, I., Merritt, M., Taubenfeld, G.: Group renaming. In: Baker, T.P., Bui, A., Tixeuil, S. (eds.) OPODIS 2008. LNCS, vol. 5401, pp. 58–72. Springer, Heidelberg (2008)
Attiya, H., Bar-Noy, A., Dolev, D., Peleg, D., Reischuk, R.: Renaming in an Asynchronous Environment. Journal of the ACM (July 1990)
Attiya, H., Dwork, C., Lynch, N., Stockmeyer, L.: Bounds on the time to reach agreement in the presence of timing uncertainty. J. ACM 41, 122–152 (1994), http://dx.doi.org/10.1145/174644.174649
Attiya, H., Welch, J.: Distributed Computing: Fundamentals, Simulations and Advanced Topics. John Wiley & Sons (2004)
Borowsky, E., Gafni, E., Lynch, N., Rajsbaum, S.: The bg distributed simulation algorithm. Distrib. Comput. 14(3), 127–146 (2001)
Borowsky, E., Gafni, E.: Generalized flp impossibility result for t-resilient asynchronous computations. In: STOC 1993: Proceedings of the Twenty-fifth Annual ACM Symposium on Theory of Computing, pp. 91–100. ACM, New York (1993)
Borowsky, E., Gafni, E.: Immediate atomic snapshots and fast renaming. In: PODC 1993: Proceedings of the Twelfth Annual ACM Symposium on Principles of Distributed Computing, pp. 41–51. ACM, New York (1993)
Borowsky, E., Gafni, E.: A simple algorithmically reasoned characterization of wait-free computation (extended abstract). In: PODC 1997: Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing, pp. 189–198. ACM, New York (1997)
Castañeda, A., Herlihy, M., Rajsbaum, S.: An equivariance theorem with applications to renaming. In: Fernández-Baca, D. (ed.) LATIN 2012. LNCS, vol. 7256, pp. 133–144. Springer, Heidelberg (2012), http://dx.doi.org/10.1007/978-3-642-29344-3_12
Castañeda, A., Rajsbaum, S.: New combinatorial topology upper and lower bounds for renaming. In: Proceedings of the Twenty-seventh ACM Symposium on Principls of Distributed Computing, PODC 2008, pp. 295–304. ACM, New York (2008), http://doi.acm.org/10.1145/1400751.1400791
Castañeda, A., Rajsbaum, S.: New combinatorial topology bounds for renaming: The upper bound. J. ACM 59(1), 3:1–3:49 (2012), http://doi.acm.org/10.1145/2108242.2108245
Castañeda, A., Rajsbaum, S., Raynal, M.: The renaming problem in shared memory systems: An introduction. Computer Science Review 5(3), 229–251 (2011), http://www.sciencedirect.com/science/article/pii/S1574013711000116
Conde, R., Rajsbaum, S.: An introduction to the topological theory of distributed computing with safe-consensus. Electronic Notes in Theoretical Computer Science 283, 29–51 (2012), http://www.sciencedirect.com/science/article/pii/S1571066112000059 , proceedings of the workshop on Geometric and Topological Methods in Computer Science (GETCO)
Dwork, C., Moses, Y.: Knowledge and common knowledge in a byzantine environment: Crash failures. Information and Computation 88(2), 156–186 (1990), http://www.sciencedirect.com/science/article/pii/0890540190900149
Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. J. ACM 32(2), 374–382 (1985)
Gafni, E., Rajsbaum, S.: Distributed programming with tasks. In: Lu, C., Masuzawa, T., Mosbah, M. (eds.) OPODIS 2010. LNCS, vol. 6490, pp. 205–218. Springer, Heidelberg (2010), http://dx.doi.org/10.1007/978-3-642-17653-1_17
Gafni, E., Rajsbaum, S.: Recursion in distributed computing. In: Dolev, S., Cobb, J., Fischer, M., Yung, M. (eds.) SSS 2010. LNCS, vol. 6366, pp. 362–376. Springer, Heidelberg (2010), http://dx.doi.org/10.1007/978-3-642-16023-3_30
Gafni, E., Rajsbaum, S., Herlihy, M.: Subconsensus tasks: Renaming is weaker than set agreement. In: Dolev, S. (ed.) DISC 2006. LNCS, vol. 4167, pp. 329–338. Springer, Heidelberg (2006)
Herlihy, M.: Wait-free synchronization. ACM Trans. Program. Lang. Syst. 13(1), 124–149 (1991), http://dx.doi.org/10.1145/114005.102808
Herlihy, M., Kozlov, D., Rajsbaum, S.: Distributed Computing Through Combinatorial Topology. Morgan Kaufmann (2013), http://store.elsevier.com/Distributed-Computing-Through-Combinatorial-Topology/Maurice-Herlihy/isbn-9780124045781/
Herlihy, M., Rajsbaum, S.: The topology of shared-memory adversaries. In: PODC 2010: Proceeding of the 29th ACM Symposium on Principles of Distributed Computing, pp. 105–113. ACM, New York (2010)
Herlihy, M., Rajsbaum, S.: The topology of distributed adversaries. Distributed Computing 26(3), 173–192 (2013), http://dx.doi.org/10.1007/s00446-013-0189-9
Herlihy, M., Shavit, N.: The topological structure of asynchronous computability. J. ACM 46(6), 858–923 (1999)
Loui, M.C., Abu-Amara, H.H.: Memory requirements for agreement among unreliable asynchronous processes. In: Preparata, F.P. (ed.) Parallel and Distributed Computing, Advances in Computing Research, pp. 163–183. JAI Press, Greenwich (1987)
Moses, Y., Rajsbaum, S.: A layered analysis of consensus. SIAM J. Comput. 31(4), 989–1021 (2002)
Rajsbaum, S.: Iterated shared memory models. In: López-Ortiz, A. (ed.) LATIN 2010. LNCS, vol. 6034, pp. 407–416. Springer, Heidelberg (2010)
Rajsbaum, S., Raynal, M., Travers, C.: An impossibility about failure detectors in the iterated immediate snapshot model. Inf. Process. Lett. 108(3), 160–164 (2008)
Rajsbaum, S., Raynal, M., Travers, C.: The iterated restricted immediate snapshot model. In: Hu, X., Wang, J. (eds.) COCOON 2008. LNCS, vol. 5092, pp. 487–497. Springer, Heidelberg (2008)
Saks, M., Zaharoglou, F.: Wait-free k-set agreement is impossible: The topology of public knowledge. SIAM J. Comput. 29(5), 1449–1483 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Conde, R., Rajsbaum, S. (2014). The Complexity Gap between Consensus and Safe-Consensus. In: Halldórsson, M.M. (eds) Structural Information and Communication Complexity. SIROCCO 2014. Lecture Notes in Computer Science, vol 8576. Springer, Cham. https://doi.org/10.1007/978-3-319-09620-9_7
Download citation
DOI: https://doi.org/10.1007/978-3-319-09620-9_7
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-09619-3
Online ISBN: 978-3-319-09620-9
eBook Packages: Computer ScienceComputer Science (R0)