An Equivariance Theorem with Applications to Renaming

  • Armando Castañeda
  • Maurice Herlihy
  • Sergio Rajsbaum
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7256)

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.

Keywords

Chain Complex Prime Power Algebraic Topology Output Complex Protocol Complex 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Attiya, H., Bar-Noy, A., Dolev, D., Peleg, D., Reischuck, R.: Renaming in Asynchronous Environment. Journal of the ACM 37(3), 524–548 (1990)CrossRefMATHGoogle Scholar
  2. 2.
    Attiya, H., Rajsbaum, S.: The Combinatorial Structure of Wait-Free Solvable Tasks. SIAM Journal on Computing 31(4), 1286–1313 (2002)MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    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)Google Scholar
  4. 4.
    Dickson, L.E.: History of the Theory of Numbers - I. Carnegie Institution of WashingtonGoogle Scholar
  5. 5.
    tom Dieck, T.: Transformation Groups. Gruiter Studies in Mathematics (1987)Google Scholar
  6. 6.
    Gafni, E.: The extended BG-simulation and the characterization of t-resiliency. In: STOC 2009, pp. 85–92 (2009)Google Scholar
  7. 7.
    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)CrossRefGoogle Scholar
  8. 8.
    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)Google Scholar
  9. 9.
    Herlihy, M., Shavit, N.: The Topological Structure of Asynchronous Computability. Journal of the ACM 46(6), 858–923 (1999)MathSciNetCrossRefMATHGoogle Scholar
  10. 10.
    Herlihy, M., Rajsbaum, S.: Algebraic Spans. Mathematical Structures in Computer Science 10(4), 549–573 (2000)MathSciNetCrossRefMATHGoogle Scholar
  11. 11.
    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)Google Scholar
  12. 12.
    Munkres, J.R.: Elements of Algebraic Topology. Addison-Wesley (1993)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Armando Castañeda
    • 1
  • Maurice Herlihy
    • 2
  • Sergio Rajsbaum
    • 3
  1. 1.IRISA-INRIARennes CedexFrance
  2. 2.Computer Science DepartmentBrown UniversityProvidenceUSA
  3. 3.Instituto de MatemáticasUniversidad Nacional Autónoma de MéxicoMexico

Personalised recommendations