Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Distributed Computing

DISC 2000: Distributed Computing pp 1–28Cite as

Lower Bounds in Distributed Computing

  • Conference paper
  • First Online:

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

Abstract

What can be computed in a distributed system in which faults can occur? This is a very broad question. There are many different models of distributed systems and many different kinds of faults that can occur. Unlike the situation in sequen- tial models of computation, small changes in the model of a distrubuted system can radically alter the class of problems that can be solved. Another important goal in the theory of distributed computing is to understand how efficiently a distributed system can compute those things which are computable. There are a variety of resource to consider, including time, contention, and the number and sizes of messages and shared objects.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Yehuda Afbk, Dalia Dauber, and Dan Touitou.Wait-free made fast.In Proc. 27th ACM Symposium on Theory of Computing, pages 538–547, 1995.

    Google Scholar 

  2. Yehuda Afek, David S. Greenberg, Michael Merritt, and Gadi Taubenfeld. Computing with faulty shared objects. Journal of the ACM, 42(6), pages1231–1274, November 1995.

    Article  MATH  MathSciNet  Google Scholar 

  3. Yehuda Afek, Michael Merritt, and Gadi Taubenfeld. The power of multi-objects. Information and Computation, 153(1), pages 117–138, August1999.

    Article  MATH  MathSciNet  Google Scholar 

  4. Yehuda Afek and Gideon Stupp. Optimal time-space tradeoff for shared memory leader election. Journal of Algorithms, 25(1), pages 95–117, October 1997.

    Article  MATH  MathSciNet  Google Scholar 

  5. Rajeev Alur, Hagit Attiya, and Gadi Taubenfeld. Time-adaptive algorithms for synchronization. SIAM Journal on Computing, 26(2), pages 539–556,1997.

    Article  MATH  MathSciNet  Google Scholar 

  6. James H. Anderson and Mark Moir. Wait-free synchronization in multiprogrammed systems: Integrating priority-based and quantum-based scheduling.In Proceedings of the 18th Annual ACM Symposium on Principles of Distributed Computing, pages 123–132, 1999.

    Google Scholar 

  7. Richard Anderson and Heather Woll. Wait-free parallel algorithms for the union-find problem. In ACM Symposium on Theory of Computing, pages 370–380,1991.

    Google Scholar 

  8. James Aspnes. Lower bounds for distributed coin-flipping and randomized consensus. Journal of the ACM, 45(3), pages 415–450, 1998.

    Article  MathSciNet  Google Scholar 

  9. James Aspnes and Maurice Herlihy. Fast, randomized consensus using shared memory. Journal of Algorithms, 11(2), pages 441–461, September 1990.

    Article  MATH  MathSciNet  Google Scholar 

  10. James Aspnes and Orli Waarts. Randomized consensus in O(n log2 n) operations per processor. SIAM Journal on Computing, 25(5), pages 1024–1044, October 1996.

    Article  MATH  MathSciNet  Google Scholar 

  11. Hagit Attiya. A direct proof of the asynchronous lower bound for fe-set consensus. Technical Report0930, Computer Science Department, Technion, 1998.Available from http://wwM.cs.technion.ac.il/Reports.

  12. Hagit Attiya, Cynthia Dwork, Nancy Lynch, and Larry Stockmeyer.Bounds on the time to reach agreement in the presence of timing uncertainty.Journal of the ACM, 41(1), pages 122–152, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  13. Hagit Attiya, Alla Gorbach, and Shlomo Moran. Computing in totally anonymous asynchronous shared memory systems. In Distributed Computing,12th International Symposium, volume 1499 of LNCS, pages 49–61, 1998. Full version available from http://www.cs.technion.ac.il/~hagit.

    Google Scholar 

  14. Hagit Attiya, Nancy Lynch, and Nir Shavit. Are wait-free algorithms fast?Journal of the ACM, 41(4), pages 725–763, 1994.

    Article  MATH  Google Scholar 

  15. Hagit Attiya and Sergio Rajsbaum. The combinatorial structure of wait-free solvable tasks. In Distributed Algorithms, 10th International Workshop, volume 1151 of LNCS, 1996. Full version available from http://www.cs.technion.ac.il/~hagit.

    Google Scholar 

  16. Hagit Attiya and Jennifer Welch. Distributed Computing: Fundamentals, Simulations and Advanced Topics. McGraw-Hill, 1998.

    Google Scholar 

  17. Ziv Bar-Joseph and Michael Ben-Or. A tight lower bound for randomized synchronous consensus. In Proceedings of the 11th Annual ACM Symposium on Principles of Distributed Computing, pages 193–199, 1998.

    Google Scholar 

  18. Ofer Biran, Shlomo Moran, and Shmubl Zaks. A combinatorial characterization of the distributed 1-solvable tasks. Journal of Algorithms, 11(3), pages 420–440, September 1990.

    Article  MATH  MathSciNet  Google Scholar 

  19. Ofer Biran, Shlomo Moran, and Shmubl Zaks. Deciding 1-solvability of distributed task is NP-hard. In Graph-Theoretic Concepts in Computer Science.16th International Workshop, volume 484 of LNCS, pages 206–220, 1990.

    Google Scholar 

  20. Ofer Biran, Shlomo Moran, and Shmubl Zaks. Tight bounds on the round complexity of distributed 1-solvable tasks. Theoretical Computer Science, 145(1-2), pages 271–290, July 1995.

    Article  MATH  MathSciNet  Google Scholar 

  21. Elizabeth Borowsky and Eli Gafni. Generalized FLP impossibility result for-resilient asynchronous computations. In Proc. 25th ACM Symposium on Theory of Computing, pages 91–100, 1993.

    Google Scholar 

  22. Elizabeth Borowsky and Eli Gafni. Immediate atomic snapshots and fast renaming. In Proceedings of the 12th Annual ACM Symposium on Principles of Distributed Computing, pages 41–52, 1993.

    Google Scholar 

  23. Elizabeth Borowsky and Eli Gafni. A simple algorithmically reasoned characterization of wait-free computations. In Proceedings of the 16th Annual ACM Symposium on Principles of Distributed Computing, pages 189–198, 1997.

    Google Scholar 

  24. Elizabeth Borowsky, Eli Gafni, Nancy Lynch, and Sergio Rajsbaum.The BG distributed simulation algorithm. Technical Report TM-573, Laboratory for Computer Science, Massachusetts Institute of Technology, December 1997.

    Google Scholar 

  25. Gadi Bracha and Ophir Rachman. Randomized consensus in expected O(n log n) operations. In Distributed Algorithms, 5th International Workshop,volume 579 of LNCS, pages 143–150, 1991.

    Chapter  Google Scholar 

  26. James Burns, Paul Jackson, Nancy Lynch, Michael Fischer, and Gary Peterson. Data requirements for implementation of n-process mutual exclusion using a single shared variable. Journal of the ACM, 29(1), pages 183–205, January 1982.

    Article  MATH  MathSciNet  Google Scholar 

  27. James Burns and Nancy Lynch. Bounds on shared memory for mutual exclusion. Information and Computation, 107(2), pages 171–184, December 1993.

    Article  MATH  MathSciNet  Google Scholar 

  28. Jonathan Buss, Paris Kanellakis, Prabhakar Ragde, and Alex Shvartsman. Parallel algorithms with processor failures and delays. Journal of Algorithms, 20(1), pages 45–86, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  29. John Cage. An autobiographical statement. Southwest Review, 76(1), page 59,1991.

    Google Scholar 

  30. Tushar Chandra. Polylog randomized wait-free consensus. In Proceedings of the 15th Annual ACM Symposium on Principles of Distributed Computing, pages 166–175, 1996.

    Google Scholar 

  31. Tushar Chandra, Vassos Hadzilacos, Prasad Jayanti, and Sam Toueg. The h hierarchy is not robust. Manuscript, 1994.

    Google Scholar 

  32. Tushar Chandra, Vassos Hadzilacos, Prasad Jayanti, and Sam Toueg. Wait-freedom vs. t-resiliency and the robustness of wait-free hierarchies. In Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing, pages 334–343, 1994.

    Google Scholar 

  33. Tushar Deepak Chandra, Prasad Jayanti, and King Tan. A polylog time wait-free construction for closed objects. In Proc. 17th ACM Symposium on Principles of Distributed Computing, pages 287–296, 1998.

    Google Scholar 

  34. Soma Chaudhuri. More choices allow more faults: Set consensus problems in totally asynchronous systems. Information and Computation, 105(1), pages 132–158, July 1993.

    Article  MATH  MathSciNet  Google Scholar 

  35. Soma Chaudhuri, Maurice Hbrlihy, Nancy A. Lynch, and Mark R. Tuttlb. A tight lower bound for k-set agreement. In Proc. 34th IEEE Symposium on Foundations of Computer Science, pages 206–215, 1993. A full version will appear in the Journal of the ACM.

    Google Scholar 

  36. Soma Chaudhuri and Paul Rbinbrs. Understanding the set consensus partial order using the Borowsky-Gafni simulation. In Distributed Algorithms, 10th International Workshop, volume 1151 of LNCS, 1996.

    Google Scholar 

  37. Benny Chor, Michael Merritt, and David Shmoys. Simple constant-time consensus protocols in realistic failure models. Journal of the ACM, 36(3), pages 591–614, 1989.

    Article  MATH  MathSciNet  Google Scholar 

  38. Benny Chor and Lee-Bath Nelson. Solvability in asynchronous environments II: Finite interactive tasks. SIAM Journal on Computing, 29(2), pages 351–377,April 2000.

    Article  MathSciNet  Google Scholar 

  39. Israel Cidon and Yuval Shavitt. Message terminating algorithms for anonymous rings of unknown size. Information Processing Letters, 54(2), pages 111–119, April 1995.

    Article  MATH  MathSciNet  Google Scholar 

  40. Robert Cori and Shlomo Moran. Exotic behaviour of consensus numbers. In Distributed Algorithms, 8th International Workshop, volume 857 of LNCS, pages 101–115, 1994.

    Google Scholar 

  41. Roberto DePrisco, Dahlia Malkhi, and Michael K. Reiter. On fe-set consensus in asynchronous systems. In Proceedings of the 18th Annual ACM Symposium on Principles of Distributed Computing, pages 257–265, 1999.

    Google Scholar 

  42. Cynthia Dwork, Maurice Herlihy, and Orli Waarts. Contention in shared memory algorithms. Journal of the ACM, 44(6), pages 779–805, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  43. Cynthia Dwork and Yoram Moses. Knowledge and common knowledge in a Byzantine environment: Crash failures. Information and Computation, 88(2), pages 156–186, October 1990.

    Article  MATH  MathSciNet  Google Scholar 

  44. Pesech Feldman and Silvio Micali. An optimal probabilistic protocol for synchronous Byzantine agreement. SIAM Journal on Computing, 26(4), pages 873–933, August 1997.

    Article  MATH  MathSciNet  Google Scholar 

  45. Faith Fich, Maurice Herlihy, and Nir Shavit. On the space complexity of randomized synchronization. Journal of the ACM, 45(5), pages 843–862, September 1998.

    Article  MATH  MathSciNet  Google Scholar 

  46. Michael J. Fischer, Nancy A. Lynch, and Michael S. Paterson. Impossibility of distributed consensus with one faulty process. Journal of the ACM, 32(2), pages 374–382, April 1985.

    Article  MATH  MathSciNet  Google Scholar 

  47. Eli Gafni. Distributed computing. In Mikhail J. Atallah, ed., Algorithms and Theory of Computation Handbook, chapter 48. CRC Press, 1998.

    Google Scholar 

  48. Eli Gafni. Round-by-round fault detectors: Unifying synchrony and asynchrony. In Proceedings of the 17th Annual ACM Symposium on Principles of Distributed Computing, pages 143–152, 1998.

    Google Scholar 

  49. Eli Gafni and Elias Koutsoupias. Three-processor tasks are undecidable. SIAM Journal on Computing, 28(3), pages 970–983, January 1999.

    Article  MATH  MathSciNet  Google Scholar 

  50. Eric Goubault and Thomas P. Jensen. Homology of higher dimensional automata. In Proc. 3rd International Conference on Concurrency Theory, volume 630 of LNCS, pages 254–268, 1992.

    Google Scholar 

  51. Jeremy Gunawardena. Homotopy and concurrency. Bulletin of the EATCS,54, pages 184–193, October 1994.

    Google Scholar 

  52. John Havlicek. Computable obstructions to wait-free computability. Distributed Computing, 13(2), pages 59–83, 2000.

    Article  Google Scholar 

  53. Maurice Hbrlihy. Wait-free synchronization. ACM Transactions on Programming Languages and Systems, 13(1), pages 124–149, January 1991.

    Article  Google Scholar 

  54. Maurice Herlihy. A methodology for implementing highly concurrent data objects. ACM Transactions on Programming Languages and Systems, 15(5), pages 745–770, November 1993.

    Article  Google Scholar 

  55. Maurice Herlihy and Sergio Rajsbaum. Set consensus using arbitrary objects. In Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing, pages 324–333, 1994.

    Google Scholar 

  56. Maurice Herlihy and Sergio Rajsbaum. Algebraic spans. In Proceedings of the 14th Annual ACM Symposium on Principles of Distributed Computing, pages 90–99, 1995.

    Google Scholar 

  57. Maurice Herlihy and Sergio Rajsbaum. Algebraic topology and distributed computing: A primer. In Jan vanLeeuwen, ed., Computer Science Today: Recent Trends and Developments, volume 1000 of LNCS, pages 203–217. Springer,1995.

    Google Scholar 

  58. Maurice Herlihy and Sergio Rajsbaum. The decidability of distributed decision tasks. In Proc. 29th ACM Symposium on Theory of Computing, pages 589–598, 1997. Full version available from http://www.cs.brown.edu/people/mph/decide.html.

  59. Maurice Herlihy and Sergio Rajsbaum. A wait-free classification of loop agreement tasks. In Distributed Computing, 12th International Symposium, volume 1499 of LNCS, pages 175–185, 1998.

    Google Scholar 

  60. Maurice Herlihy and Sergio Rajsbaum. New perspectives in distributed computing. In Mathematical Foundations of Computer Science: 24th International Symposium, volume 1672 of LNCS, pages 170–186, 1999.

    Google Scholar 

  61. Maurice Herlihy, Sergio Rajsbaum, and Mark R. Tuttle. Unifying synchronous and asynchronous message-passing models. In Proceedings of the 17th Annual ACM Symposium on Principles of Distributed Computing, pages 133–142,1998. Full version available from http://www.cs.brown.edu/people/mph/hrt.html.

  62. Maurice Herlihy and Eric Ruppert. On the existence of booster types. In Proc. 32nd IEEE Symposium on Foundations of Computer Science, 2000. To appear.

    Google Scholar 

  63. Maurice Herlihy and Nir Shavit. The topological structure of asynchronous computability. Journal of the ACM, 46(6), pages 858–923, November 1999.

    Article  MATH  MathSciNet  Google Scholar 

  64. Maurice P. Herlihy and Jeannette M. Wing. Linearizability: A correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems, 12(3), pages 463–492, July 1990.

    Article  Google Scholar 

  65. Gunnar Hoest and Nir Shavit. Towards a topological characterization of asynchronous complexity. In Proceedings of the 16th Annual ACM Symposium on Principles of Distributed Computing, pages 199–208, 1997.

    Google Scholar 

  66. Prasad Jayanti. Robust wait-free hierarchies. Journal of the ACM, 44(4), pages 592–614, July 1997.

    Article  MATH  MathSciNet  Google Scholar 

  67. Prasad Jayanti. A lower bound on the local time complexity of universal constructions. In Proceedings of the 17th Annual ACM Symposium on Principles of Distributed Computing, pages 183–192, 1998.

    Google Scholar 

  68. Prasad Jayanti. Solvability of consensus: Composition breaks down for nonde-terministic types. SI AM Journal on Computing, 28(3), pages 782–797, September 1998.

    Article  MathSciNet  Google Scholar 

  69. Prasad Jayanti. A time complexity lower bound for randomized implementations of some shared objects. In Proceedings of the 17th Annual ACM Symposium on Principles of Distributed Computing, pages 201–210, 1998.

    Google Scholar 

  70. Prasad Jayanti, Tushar Deepak Chandra, and Sam Toueg. Fault-tolerant wait-free shared objects. Journal of the ACM, 45(3), pages 451–500, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  71. Prasad Jayanti, King Tan, and Sam Toueg. Time and space lower bounds for nonblocking implementations. SIAM Journal on Computing, 30(2), pages 438–456, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  72. Prasad Jayanti and Sam Toueg. Wakeup under read/write atomicity. In Distributed Algorithms, 4th International Workshop, volume 486 of LNGS, pages 277–288, 1990.

    Google Scholar 

  73. Prasad Jayanti and Sam Toueg. Some results on the impossibility, universality and decidability of consensus. In Distributed Algorithms, 6th International Workshop, volume 647 of LNCS, pages 69–84, 1992.

    Google Scholar 

  74. C. Kaklamanis, A. R. Karlin, F. T. Leighton, V. Milenkovic, P. Raghavan, S. Rao, C. Thomborson, and A. Tsantilas. Asymptotically tight bounds for computing with faulty arrays of processors. In Proc. 31st IEEE Symposium on Foundations of Computer Science, pages 285–296, 1990.

    Google Scholar 

  75. Jon M. Kleinberg and Sendhil Mullainathan. Resource bounds and combinations of consensus objects. In Proceedings of the 12th Annual ACM Symposium on Principles of Distributed Computing, pages 133–144, 1993.

    Google Scholar 

  76. Clyde P. Kruskal, Larry Rudolph, and Marc Snir. Efficient synchronization on multiprocessors with shared memory. ACM Transactions on Programming Languages and Systems, 10(4), pages 579–601, October 1988.

    Article  MATH  Google Scholar 

  77. Eyal Kushilevitz, Yishay Mansour, Michael O. Rabin, and DavidT Zuckerman. Lower bounds for randomized mutual exclusion. SIAM Journal on Computing, 27(6), pages 1550–1563, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  78. Leslie Lamport. A new solution of Dijkstra’s concurrent programming problem.Communications of the ACM, 17(8), pages 453–455, 1974.

    Article  MATH  MathSciNet  Google Scholar 

  79. Leslie Lamport. The mutual exclusion problem. Part II: Statement and solutions. Journal of the ACM, 33(2), pages 327–348, 1986.

    Article  MATH  MathSciNet  Google Scholar 

  80. Leslie Lamport and Nancy Lynch. Distributed computing: Models and methods. In Handbook of Theoretical Computer Science, volume B, chapter 18. Elsevier,1990.

    Google Scholar 

  81. Leslie Lamport, Robert Shostak, and Marshall Pease. The Byzantine generals problem. ACM Transactions on Programming Languages and Systems,4(3), pages 382–401, July 1982.

    Article  MATH  Google Scholar 

  82. Wai-Kau Lo. More on t-resilience vs. wait-freedom. In Proceedings of the 14th Annual ACM Symposium on Principles of Distributed Computing, pages 110–119,1995.

    Google Scholar 

  83. Wai-Kau Lo and Vassos Hadzilacos. All of us are smarter than any of us: wait-free hierarchies are not robust. In Proc. 29th ACM Symposium on Theory of Computing, pages 579–588, 1997.

    Google Scholar 

  84. Michael C. Loui and Hosame H. Abu-Amara. Memory requirements for agreement among unreliable asynchronous processes. In Franco P. Preparata,ed., Advances in Computing Research, volume 4, pages 163–183. JAI Press, Greenwich, Connecticut, 1987.

    Google Scholar 

  85. Ronit Lubitch and Shlomo Moran. Closed schedulers: A novel technique for analyzing asynchronous protocols. Distributed Computing, 8(4), pages 203–210,1995.

    Article  Google Scholar 

  86. Nancy A. Lynch. A hundred impossibility proofs for distributed computing. In Proceedings of the 8th Annual ACM Symposium on Principles of Distributed Computing, pages 1–27, 1989.

    Google Scholar 

  87. Nancy A. Lynch. Distributed Algorithms. Morgan Kaufmann, 1996.

    Google Scholar 

  88. Shlomo Moran and Lihu Rappoport. On the robustness of h. In Distributed Algorithms, 10th International Workshop, volume 1151 of LNCS, pages 344–361, 1996.

    Google Scholar 

  89. Shlomo Moran, Gadi Taubbnfeld, and Irit Yadin. Concurrent counting.Journal of Computer and System Sciences, 53(1), pages 61–78, August 1996.

    Article  MATH  MathSciNet  Google Scholar 

  90. Shlomo Moran and Yaron Wolfstahl. Extended impossibility results for asynchronous complete networks. Information Processing Letters, 26(3), pages145–151, November 1987.

    Article  MathSciNet  Google Scholar 

  91. Yoram Moses and Sergio Rajsbaum. The unified structure of consensus: a layered analysis approach. In Proceedings of the 17th Annual ACM Symposium on Principles of Distributed Computing, pages 123–132, 1998.

    Google Scholar 

  92. Naor and Roth. Parallel algorithms with processor failures and delays. Random Structures and Algorithms, 1995.

    Google Scholar 

  93. M. Pease, R. Shostak, and L. Lamport. Reaching agreement in the presence of faults. Journal of the ACM, 27(2), pages 228–234, April 1980.

    Article  MATH  MathSciNet  Google Scholar 

  94. Gary L. Peterson. Properties of a family of booster types. In Proceedings of the 18th Annual ACM Symposium on Principles of Distributed Computing, page 281, 1999.

    Google Scholar 

  95. Michael Rabin. Randomized Byzantine generals. In Proc. 24th IEEE Symposium on Foundations of Computer Science, pages 403–409, 1983.

    Google Scholar 

  96. Ophir Rachman. Anomalies in the wait-free hierarchy. In Distributed Algorithms, 8th International Workshop, volume 857 of LNCS, pages 156–163, 1994.

    Google Scholar 

  97. G. M. Reed, A. W. Roscoe, and R. F. Wachter, eds. Topology and Category Theory in Computer Science. Clarendon Press, Oxford, 1991.

    Google Scholar 

  98. Eric Ruppert. Determining consensus numbers. SIAM Journal on Computing. To appear.

    Google Scholar 

  99. Eric Ruppert. Consensus numbers of multi-objects. In Proceedings of the 17th Annual ACM Symposium on Principles of Distributed Computing, pages 211–217,1998.

    Google Scholar 

  100. Michael Saks and Fotios Zaharoglou. Wait-free fe-set agreement is impossible: The topology of public knowledge. SIAM Journal on Computing, 29(5),pages 1449–1483, March 2000.

    Article  MATH  MathSciNet  Google Scholar 

  101. Eric Schenk. Faster approximate agreement with multi-writer registers. In Proc.36th IEEE Symposium on Foundations of Computer Science, pages 714–723, 1995.

    Google Scholar 

  102. Eric Schenk. Computability and Complexity Results for Agreement Problems in Shared Memory Distributed Systems. Ph.D. thesis, Department of Computer Science, University of Toronto, September 1996.

    Google Scholar 

  103. Eric Schenk. The consensus hierarchy is not robust. In Proceedings of the 16th Annual ACM Symposium on Principles of Distributed Computing, page 279, 1997.

    Google Scholar 

  104. E. Sperner. Neuer Beweis fur die Invarianz der Dimensionszahl und des Gebietes.Abhandlungen aus dem Mathematischen Seminar der Hamburgischen Universitat,6(3/4), pages 265–272, September 1928.

    Article  MATH  Google Scholar 

  105. Gadi Taubenfeld, Shmuel Katz, and Shlomo Moran. Initial failures in distributed computations. International Journal of Parallel Programming, 18(4), pages 255–276, August 1989.

    Article  MATH  MathSciNet  Google Scholar 

  106. Gadi Taubenfeld and Shlomo Moran. Possibility and impossibility results in a shared memory environment. Ada Informatica, 33(1), pages 1–20, February 1996.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Toronto, Toronto

    Faith Fich

  2. Department of Computer Science, Brown University, Toronto

    Eric Ruppert

Authors
  1. Faith Fich
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Eric Ruppert
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Brown University, 115 Waterman Street, Providence, RI 02912, USA

    Maurice Herlihy

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fich, F., Ruppert, E. (2000). Lower Bounds in Distributed Computing. In: Herlihy, M. (eds) Distributed Computing. DISC 2000. Lecture Notes in Computer Science, vol 1914. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-40026-5_1

Download citation

  • DOI: https://doi.org/10.1007/3-540-40026-5_1

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41143-7

  • Online ISBN: 978-3-540-40026-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation