Abstract
In the (n,M)-renaming problem, there are n processes, each with an initial name known only from itself, and these processes have to compute new names from the set {1,...,M}, despite asynchrony and any number of process crashes, such that no two processes have the same new name. If M = n, the renaming is said to be perfect. If M is only on function on the number n of the processes in the system, the renaming is said to be non-adaptive. In contrast, if M is on function on the number of processes that actually participate in a given execution, renaming is adaptive. The consensus number of a concurrent object is an integer which measures its synchronization power in presence of any number of process crashes.
This paper investigates the consensus number of non-adaptive perfect renaming objects. It shows that, while a non-adaptive perfect renaming object for two processes (ports) has consensus number 2, its consensus number decreases to 1 when the number of processes which can access it increases beyond 2.
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.
References
Afek, Y., Gafni, E., Morisson, A.: Common2 Extended to Stacks and Unboudned Concurrency. Distributed Computing 20, 239–252 (2007)
Afek, Y., Weisberger, E., Weisman, H.: A Completeness Theorem for a Class of Synchronization Objects (Extended Abstract). In: Proc. 12th ACM Symposium on Principles of Distributed Computing (PODC 1993), pp. 159–170 (1993)
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)
Castañeda, A., Rajsbaum, S.: New Combinatorial Topology Upper and Lower Bounds for Renaming: The Lower Bound. Distributed Computing 22(5-6), 287–301 (2010)
Castañeda, A., Rajsbaum, S.: New Combinatorial Topology Upper and Lower Bounds for Renaming: The Upper Bound. Journal of the ACM 59(1), 3 (2012)
Castañeda, A., Rajsbaum, S., Raynal, M.: The Renaming Problem in Shared Memory Systems: an Introduction. Computer Science Review 5(3), 229–251 (2011)
Castañeda, A., Imbs, D., Rajsbaum, S., Raynal, M.: Renaming is Weaker than Set Agreement but for Perfect Renaming: A Map of Sub-Consensus Tasks. In: Fernández-Baca, D. (ed.) LATIN 2012. LNCS, vol. 7256, pp. 145–156. Springer, Heidelberg (2012)
Castañeda, A., Rajsbaum, S., Raynal, M.: There are plenty of tasks weaker than perfect renaming and stronger than set agreement (Brief announcement). In: Proc. 31st ACM Symposium on Principles of Distributed Computing (PODC 2012), pp. 97–98 (2012)
Chaudhuri, S.: More Choices Allow More Faults: Set Consensus Problems in Totally Asynchronous Systems. Information and Computation 105(1), 132–158 (1993)
Gafni, E., Raynal, M., Travers, C.: Test&set, Adaptive Renaming and Set Agreement: a Guided Visit to Asynchronous Computability. In: Proc. 26th IEEE Symposium on Reliable Distributed Systems (SRDS 2007), pp. 93–102. IEEE Computer Society Press (2007)
Herlihy, M.: Wait-Free Synchronization. ACM Transactions Programminf Languages and Systems 13(1), 124–149 (1991)
Herlihy, M.P., Shavit, N.: The Topological Structure of Asynchronous Computability. Journal of the ACM 46(6), 858–923 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Castañeda, A., Raynal, M. (2013). On the Consensus Number of Non-adaptive Perfect Renaming. In: Gramoli, V., Guerraoui, R. (eds) Networked Systems. NETYS 2013. Lecture Notes in Computer Science, vol 7853. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40148-0_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-40148-0_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40147-3
Online ISBN: 978-3-642-40148-0
eBook Packages: Computer ScienceComputer Science (R0)