Skip to main content
SpringerLink
Log in

Algebraic topology and distributed computing a primer

  • Chapter
  • First Online:
Computer Science Today

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1000))

Abstract

Models and techniques borrowed from classical algebraic topology have recently yielded a variety of new lower bounds and impossibility results for distributed and concurrent computation. This paper explains the basic concepts underlying this approach, and shows how they apply to a simple distributed problem.

Research partly supported by ONR N00014-91-J-4052, ARPA Order 8225.

On leave from Instituto de Matemáticas, U.N.A.M., México. Part of this work was done while visiting the Laboratory for Computer Science, MIT. Partly supported by DGAPA Projects.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H. Attiya, A. Bar-Noy, D. Dolev, D. Peleg, and R. Reischuk. Renaming in an asynchronous environment. Journal of the ACM, 37(3):524–548, July 1990.

    Article  Google Scholar 

  2. H. Attiya and S. Rajsbaum. A combinatorial topology framework for wait-free computability. Preprint.

    Google Scholar 

  3. O. Biran, S. Moran, and S. Zaks. A combinatorial characterization of the distributed tasks which are solvable in the presence of one faulty processor. In Proceedings 7th Annual ACM Symposium on Principles of Distributed Computing, pages 263–275, August 1988.

    Google Scholar 

  4. E. Borowsky and E. Gafni. Generalized FLP impossibility result for t-resilient asynchronous computations. In Proceedings 25th Annual ACM Symposium on Theory of Computing, pages 206–215, May 1993.

    Google Scholar 

  5. E. Borowsky, E. Gafni, and Y. Afek. Consensus power makes (some) sense! In Proceedings 13th Annual ACM Symposium on Principles of Distributed Computing, pages 363–373, August 1994.

    Google Scholar 

  6. T Chandra, V. Hadzilacos, P. Jayanti, and S. Toueg. Wait-freedom vs. t-resiliency and the robustness of wait-free hierarchies. In Proceedings 13th Annual ACM Symposium on Principles of Distributed Computing, pages 334–343, August 1994.

    Google Scholar 

  7. S. Chaudhuri. Agreement is harder than consensus: Set consensus problems in totally asynchronous systems. In Proceedings 9th Annual ACM Symposium On Principles of Distributed Computing, pages 311–234, August 1990.

    Google Scholar 

  8. S. Chaudhuri, M.P. Herlihy, N. Lynch, and M.R. Tuttle. A tight lower bound for k-set agreement. In Proceedings 34th annual IEEE Symposium on Foundations of Computer Science, pages 206–215, October 1993.

    Google Scholar 

  9. M. Fischer, N.A. Lynch, and M.S. Paterson. Impossibility of distributed commit with one faulty process. Journal of the ACM, 32(2):374–382, April 1985.

    Article  Google Scholar 

  10. E. Gafni and E. Koutsoupias. 3-processor tasks are undecidable. In Proceedings 14th Annual ACM Symposium on Principles of Distributed Computing, August 1995.

    Google Scholar 

  11. M.P. Herlihy. Wait-free synchronization. ACM Transactions on Programming Languages and Systems, 13(1):123–149, January 1991.

    Article  Google Scholar 

  12. M.P. Herlihy and S. Rajsbaum. Set consensus using arbitrary objects. In Proceedings 13th Annual ACM Symposium on Principles of Distributed Computing, August 1994.

    Google Scholar 

  13. M.P. Herlihy and S. Rajsbaum. Algebraic spans. In Proceedings 14th Annual ACM Symposium on Principles of Distributed Computing, August 1995.

    Google Scholar 

  14. M.P. Herlihy and N. Shavit. The asynchronous computability theorem for t-resilient tasks. In Proceedings 25th Annual ACM Symposium on Theory of Computing, pages 111–120, May 1993.

    Google Scholar 

  15. M.P. Herlihy and N. Shavit. A simple constructive computability theorem for wait-free computation. In Proceedings 26th Annual ACM Symposium on Theory of Computing, pages 243–252, May 1994.

    Google Scholar 

  16. P. Jayanti. On the robustness of Herlihy's hierarchy. In Proceedings 12th Annual ACM Symposium on Principles of Distributed Computing, pages 145–158, August 1993.

    Google Scholar 

  17. J. Kleinberg and S. Mullainathan. Resource bounds and combinations of consensus objects. In Proceedings 12th Annual ACM Symposium on Principles of Distributed Computing, pages 133–145, August 1993.

    Google Scholar 

  18. J.R. Munkres. Elements Of Algebraic Topology. Addison Wesley, Reading MA, 1984. ISBN 0-201-04586-9.

    Google Scholar 

  19. G. Peterson, R. Bazzi, and G. Neiger. A gap theorem for consensus types. In Proceedings 13th Annual ACM Symposium on Principles of Distributed Computing, pages 344–354, August 1994.

    Google Scholar 

  20. M. Saks and F. Zaharoglou. Wait-free k-set agreement is impossible: The topology of public knowledge. In Proceedings 25th Annual ACM Symposium on Theory of Computing, pages 101–110, May 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Brown University, 02912, Providence, RI

    Maurice Herlihy

  2. Cambridge Research Lab, Digital Equipment Corporation, One Kendall Square, 02139, Cambridge, MA

    Sergio Rajsbaum

Authors
  1. Maurice Herlihy
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sergio Rajsbaum
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jan van Leeuwen

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Herlihy, M., Rajsbaum, S. (1995). Algebraic topology and distributed computing a primer. In: van Leeuwen, J. (eds) Computer Science Today. Lecture Notes in Computer Science, vol 1000. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0015245

Download citation

  • DOI: https://doi.org/10.1007/BFb0015245

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60105-0

  • Online ISBN: 978-3-540-49435-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation