Abstract
In the wait-free shared memory model substantial attention has been devoted to understanding the relative power of sub-consensus tasks. Two important sub-consensus families of tasks have been identified: k-set agreement and M-renaming. When 2 ≤ k ≤ n − 1 and n ≤ M ≤ 2n − 2, these tasks are more powerful than read/write registers, but not strong enough to solve consensus for two processes.
This paper studies the power of renaming with respect to set agreement. It shows that, in a system of n processes, n-renaming is strictly stronger than (n − 1)-set agreement, but not stronger than (n − 2)-set agreement. Furthermore, (n + 1)-renaming cannot solve even (n − 1)-set agreement. As a consequence, there are cases where set agreement and renaming are incomparable when looking at their power to implement each other.
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
Attiya, H., Bar-Noy, A., Dolev, D., Peleg, D., Reischuck, R.: Renaming in an Asynchronous Environment. Journal of the ACM 37(3), 524–548 (1990)
Borowsky, E., Gafni, E., Generalized, F.L.P.: Impossibility Result for t-Resilient Asynchronous Computations. In: Proc. 25th ACM Symposium on Theory of Computing (STOC 1993), pp. 91–100. ACM Press (1993)
Borowsky, E., Gafni, E.: A Simple Algorithmically Reasoned Characterization of Wait-Free Computations (Extended Abstract). In: Proc. 16th ACM Symposium on Principles of Distributed Computing (PODC 1997), pp. 189–198 (1997)
Castañeda, A., Rajsbaum, S.: New Combinatorial Topology Upper and Lower Bounds for Renaming. In: Proc. 27th Annual ACM Symposium on Principles on Distributed Computing (PODC 2008), pp. 295–304. ACM Press (2008)
Castañeda, A., Rajsbaum, S., Raynal, M.: The Renaming Problem in Shared Memory Systems: an Introduction. Computer Science Review 5(3), 229–251 (2011)
Chaudhuri, S.: More Choices Allow More Faults: Set Consensus Problems in Totally Asynchronous Systems. Information and Computation 105(1), 132–158 (1993)
Chaudhuri, S., Reiners, P.: Understanding the Set Consensus Partial Order Using the Borowsky-Gafni Simulation (Extended Abstract). In: Babaoğlu, Ö., Marzullo, K. (eds.) WDAG 1996. LNCS, vol. 1151, pp. 362–379. Springer, Heidelberg (1996)
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.: Renaming with k-Set-Consensus: An Optimal Algorithm into n + k – 1 Slots. In: Shvartsman, M.M.A.A. (ed.) OPODIS 2006. LNCS, vol. 4305, pp. 36–44. Springer, Heidelberg (2006)
Gafni, E.: The 0–1-Exclusion Families of Tasks. In: Baker, T.P., Bui, A., Tixeuil, S. (eds.) OPODIS 2008. LNCS, vol. 5401, pp. 246–258. Springer, Heidelberg (2008)
Gafni, E., Kuznetsov, P.: N-Consensus is the Second Strongest Object for N + 1 Processes. In: Tovar, E., Tsigas, P., Fouchal, H. (eds.) OPODIS 2007. LNCS, vol. 4878, pp. 260–273. Springer, Heidelberg (2007)
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)
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)
Gafni, E., Raynal, M., Travers, C.: Test&Set, Adaptive Renaming and Set Agreement: a Guided Visit to Asynchronous Computability. In: Proc. 26th Int’l IEEE Symposium on Reliable Dist. Systems (SRDS 2007), pp. 93–102. IEEE Press (2007)
Gafni, E., Mostéfaoui, M., Raynal, M., Travers, C.: From Adaptive Renaming to Set Agreement. Theoretical Computer Science 410(14-15), 1328–1335 (2009)
Herlihy, M.: Wait-Free Synchronization. ACM Transactions Programming Languages and Systems 13(1), 124–149 (1991)
Herlihy, M.P., Rajsbaum, S.: Set Consensus Using Arbitrary Objects (Preliminary Version). In: Proc. 13th Annual ACM Symposium on Principles on Distributed Computing (PODC 1994), pp. 324–333. ACM Press (1994)
Herlihy, M.P., Rajsbaum, S.: A Classification of Wait-free Loop Agreement Tasks. Theoretical Computer Science 291(1), 55–77 (2003)
Herlihy, M.P., Shavit, N.: The Topological Structure of Asynchronous Computability. J. of the ACM 46(6), 858–923 (1999)
Imbs, D., Rajsbaum, S., Raynal, M.: The Universe of Symmetry Breaking Tasks. In: Kosowski, A., Yamashita, M. (eds.) SIROCCO 2011. LNCS, vol. 6796, pp. 66–77. Springer, Heidelberg (2011)
Mostéfaoui, A., Raynal, M., Travers, C.: Exploring Gafni’s Reduction Land: from Ωk to Wait-Free Adaptive (\(2p-\lceil\frac{p}{k}\rceil\))-Renaming via k-Set Agreement. In: Dolev, S. (ed.) DISC 2006. LNCS, vol. 4167, pp. 1–15. Springer, Heidelberg (2006)
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
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Castañeda, A., Imbs, D., Rajsbaum, S., Raynal, M. (2012). Renaming Is Weaker Than Set Agreement But for Perfect Renaming: A Map of Sub-consensus Tasks. In: Fernández-Baca, D. (eds) LATIN 2012: Theoretical Informatics. LATIN 2012. Lecture Notes in Computer Science, vol 7256. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29344-3_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-29344-3_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-29343-6
Online ISBN: 978-3-642-29344-3
eBook Packages: Computer ScienceComputer Science (R0)