Abstract
In the renaming problem, each process in a distributed system is issued a unique name from a large name space, and the processes must coordinate with one another to choose unique names from a much smaller name space.
We show that lower bounds on the solvability of renaming in an asynchronous distributed system can be formulated as a purely topological question about the existence of an equivariant chain map from a “topological disk” to a “topological annulus”. Proving the non-existence of such a map implies the non-existence of a distributed renaming algorithm in several related models of computation.
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
Attiya, H., Bar-Noy, A., Dolev, D., Peleg, D., Reischuck, R.: Renaming in Asynchronous Environment. Journal of the ACM 37(3), 524–548 (1990)
Attiya, H., Rajsbaum, S.: The Combinatorial Structure of Wait-Free Solvable Tasks. SIAM Journal on Computing 31(4), 1286–1313 (2002)
Castañeda, A., Rajsbaum, S.: New Combinatorial Topology Upper and Lower Bounds for Renaming. In: Proceedings of the 27th Annual ACM Symposium on Principles on Distributed Computing, pp. 295–304 (2008)
Dickson, L.E.: History of the Theory of Numbers - I. Carnegie Institution of Washington
tom Dieck, T.: Transformation Groups. Gruiter Studies in Mathematics (1987)
Gafni, E.: The extended BG-simulation and the characterization of t-resiliency. In: STOC 2009, pp. 85–92 (2009)
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., Rajsbaum, S., Tuttle, M.: Unifying Synchronous and Asynchronous Message-Passing Models. In: Proceedings of the 17th Annual ACM Symposium on Principles of Distributed Computing, pp. 133–142 (1998)
Herlihy, M., Shavit, N.: The Topological Structure of Asynchronous Computability. Journal of the ACM 46(6), 858–923 (1999)
Herlihy, M., Rajsbaum, S.: Algebraic Spans. Mathematical Structures in Computer Science 10(4), 549–573 (2000)
Herlihy, M., Rajsbaum, S.: The topology of shared-memory adversaries. In: Proceedings of the 29th Annual ACM Symposium on Principles on Distributed Computing, pp. 105–113 (2010)
Munkres, J.R.: Elements of Algebraic Topology. Addison-Wesley (1993)
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., Herlihy, M., Rajsbaum, S. (2012). An Equivariance Theorem with Applications to Renaming. 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_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-29344-3_12
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)