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. © 2012 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Castañeda, A., Herlihy, M., & Rajsbaum, S. (2012). An equivariance theorem with applications to renaming. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7256 LNCS, pp. 133–144). https://doi.org/10.1007/978-3-642-29344-3_12
Mendeley helps you to discover research relevant for your work.