Lower bounds in distributed computing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1914, Issue , 2000, Pages 1-28

  Fich, Faith ^a   Ruppert, Eric ^b  

^a UNIVERSITY OF TORONTO   (Canada)

^b Brown Univerity   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84958749505     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-40026-5_1     Document Type: Conference Paper

References (105)

1. Yehuda Afek, Dalia Dauber, and Dan Touitou. Wait-free made fast. In Proc. 27th ACM Symposium on Theory of Computing, pages 538-547, 1995.
2. Yehuda Afek, David S. Greenberg, Michael Merritt, and Gadi Tauben- feld. Computing with faulty shared objects. Journal of the ACM, 42(6), pages 1231-1274, November 1995.
3. Yehuda Afek, Michael Merritt, and Gadi Taubenfeld. The power of multi-objects. Information and Computation, 153(1), pages 117-138, August 1999.
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.
5. Rajeev Alur, Hagit Attiya, and Gadi Taubenfeld. Time-adaptive algo¬rithms for synchronization. SIAM Journal on Computing, 26(2), pages 539-556, 1997.
6. James H. Anderson and Mark Moir. Wait-free synchronization in multi¬programmed 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.
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.
8. James Aspnes. Lower bounds for distributed coin-flipping and randomized con¬sensus. Journal of the ACM, 45(3), pages 415-450, 1998.
9. James Aspnes and Maurice Herlihy. Fast, randomized consensus using shared memory. Journal of Algorithms, 11(2), pages 441-461, September 1990.
10. James Aspnes and Orli Waarts. Randomized consensus in 0(n log2 n) op¬erations per processor. SIAM Journal on Computing, 25(5), pages 1024-1044, October 1996.
11. Hagit Attiya. A direct proof of the asynchronous lower bound for k-set consensus. Technical Report 0930, Computer Science Department, Technion, 1998. Available from http://wHH.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.
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 HHH.cs.technion.ac.il/~hagit.
14. Hagit Attiya, Nancy Lynch, and Nir Shavit. Are wait-free algorithms fast? Journal of the ACM, 41(4), pages 725-763, 1994.
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 HHH.CS. technion.ac. il/~hagit.
16. Hagit Attiya and Jennifer "Welch. Distributed Computing: Fundamentals, Simulations and Advanced Topics. McGraw-Hill, 1998.
17. Ziv Bar-Joseph and Michael Ben-Or. A tight lower bound for randomized synchronous consensus. In Proceedings of the 17th, Annual ACM Symposium, on, Principles of Distributed Computing, pages 193-199, 1998.
18. Ofer BIRAN, Shlomo Moran, and Shmuel Zaks. A combinatorial character¬ization of the distributed 1-solvable tasks. Journal of Algorithms, 11(3), pages 420-440, September 1990.
19. Ofer Biran, Shlomo Moran, and Shmuel 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.
20. Ofer Biran, Shlomo Moran, and Shmuel Zaks. Tight bounds on the round complexity of distributed 1-solvable tasks. Theoretical Computer Science, 145(1- 2), pages 271-290, July 1995.
21. Elizabeth Borowsky and Eli Gafni. Generalized FLP impossibility result for t-resilient asynchronous computations. In Proc. 25th ACM Symposium on Theory of Computing, pages 91-100, 1993.
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.
23. Elizabeth Borowsky and Eli Gafni. A simple algorithmically reasoned char¬acterization of wait-free computations. In Proceedings of the 16th Annual ACM Symposium on Principles of Distributed Computing, pages 189-198, 1997.
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.
25. Gadi Bracha and Ophir Rachman. Randomized consensus in expected 0(n2 log n) operations. In Distributed Algorithms, 5th International Workshop, volume 579 of LNCS, pages 143-150, 1991.
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.
27. James Burns and Nancy Lynch. Bounds on shared memory for mutual exclu¬sion. Information and Computation, 107(2), pages 171-184, December 1993.
28. Jonathan Buss, Paris Kanellakis, Prabhakar Ragde, and Alex Shvarts- man. Parallel algorithms with processor failures and delays. Journal of Algo¬rithms, 20(1), pages 45-86, 1996.
29. John Cage. An autobiographical statement. Southwest Review, 76(1), page 59, 1991.
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.
31. TUSHAR CHANDRA, VASSOS HADZILACOS, PRASAD JAYANTI, AND SAM TOUEG. The lirra hierarchy is not robust. Manuscript, 1994.
32. Tushar Chandra, Vassos Hadzilacos, Prasad Jayanti, and Sam Toueg. Wait-freedom vs. 4-resiliency and the robustness of wait-free hierarchies. In Pro¬ceedings of the 13th, Annual ACM Symposium on Principles of Distributed Com-puting, pages 334-343, 1994.
33. Tushar Deepak Chandra, Prasad Jayanti, and King Tan. A polylog time wait-free construction for closed objects. In Proc. 17th, ACM Symposium, on, Prin¬ciples of Distributed Computing, pages 287-296, 1998.
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.
35. Soma Chaudhuri, Maurice Herlihy, Nancy A. Lynch, and Mark E. Tuttle. 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.
36. SOMA CHAUDHURI AND PAUL REINERS. Understanding the set consensus par¬tial order using the Borowsky-Gafni simulation. In Distributed Algorithms, 10th International Workshop, volume 1151 of LNCS, 1996.
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.
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.
39. ISRAEL CIDON AND YUVAL SHAVITT. Message terminating algorithms for anony¬mous rings of unknown size. Information Processing Letters, 54(2), pages 111-119, April 1995.
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.
41. Roberto De Prisco, Dahlia Malkhi, and Michael K. Reiter. On k-set consensus in asynchronous systems. In Proceedings of the 18th, Annual ACM Symposium on Principles of Distributed Computing, pages 257-265, 1999.
42. Cynthia Dwork, Maurice Herlihy, and Orli Waarts. Contention in shared memory algorithms. Journal of the ACM, 44(6), pages 779-805, 1997.
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.
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.
45. Faith Fich, Maurice Herlihy, and Nir Shavit. On the space complexity of randomized synchronization. Journal of the ACM, 45(5), pages 843-862, Septem¬ber 1998.
46. Michael J. Fischer, Nancy A. Lynch, and Michael S. Paterson. Impos¬sibility of distributed consensus with one faulty process. Journal of the ACM, 32(2), pages 374-382, April 1985.
47. ELI GAFNI. Distributed computing. In MIKHAIL J. ATALLAH, ED., Algorithms and Theory of Computation Handbook, chapter 48. CRC Press, 1998.
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.
49. ELI GAFNI AND ELIAS KOUTSOUPIAS. Three-processor tasks are undecidable. SIAM Journal on, Computing, 28(3), pages 970-983, January 1999.
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.
51. JEREMY GUNAWARDENA. Homotopy and concurrency. Bulletin of the EATCS, 54, pages 184-193, October 1994.
52. JOHN HAVLICEK. Computable obstructions to wait-free computability. Distributed Computing, 13(2), pages 59-83, 2000.
53. Maurice Herlihy. Wait-free synchronization. ACM Transactions on Program¬ming Languages and Systems, 13(1), pages 124-149, January 1991.
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.
55. MAURICE HERLIHY AND SERGIO RAJSBAUM. Set consensus using arbitrary ob¬jects. In Proceedings of the 13th Annual ACM Symposium on Principles of Dis¬tributed Computing, pages 324-333, 1994.
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.
57. MAURICE HERLIHY AND SERGIO RAJSBAUM. Algebraic topology and distributed computing: A primer. In JAN VAN LEEUWEN, ED., Computer Science Today: Recent Trends and Developments, volume 1000 of LNCS, pages 203-217. Springer, 1995.
58. MAURICE HERLIHY AND SERGIO RAJSBAUM. The decidability of dis¬tributed decision tasks. In Proc. 29th ACM Symposium on The¬ory of Computing, pages 589-598, 1997. Full version available from 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, vol¬ume 1499 of LNCS, pages 175-185, 1998.
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.
61. MAURICE HERLIHY, SERGIO RAJSBAUM, AND MARK R. TUTTLE. Unifying syn¬chronous 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 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.
63. MAURICE HERLIHY AND NIR SHAVIT. The topological structure of asynchronous computability. Journal of the ACM, 46(6), pages 858-923, November 1999.
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.
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.
66. PRASAD JAYANTI. Robust wait-free hierarchies. Journal of the ACM, 44(4), pages 592- 614, July 1997.
67. PRASAD JAYANTI. A lower bound on the local time complexity of universal con¬structions. In Proceedings of the 17th Annual ACM Symposium, on, Principles of Distributed Computing, pages 183-192, 1998.
68. PRASAD JAYANTI. Solvability of consensus: Composition breaks down for nonde- terministic types. SIAM Journal on, Computing, 28(3), pages 782-797, September 1998.
69. PRASAD JAYANTI. A time complexity lower bound for randomized implementa¬tions of some shared objects. In Proceedings of the 17th Annual ACM Symposium, on, Principles of Distributed Computing, pages 201-210, 1998.
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.
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.
72. PRASAD JAYANTI AND SAM TOUEG. Wakeup under read/write atomicity. In Distributed Algorithms, 4th International Workshop, volume 486 of LNCS, pages 277-288, 1990.
73. PRASAD JAYANTI AND Sam TOUEG. Some results on the impossibility, univer¬sality and decidability of consensus. In Distributed Algorithms, 6th, International Workshop, volume 647 of LNCS, pages 69-84, 1992.
74. C. KAKLAMANIS, A. E. KARLIN, F. T. LEIGHTON, V. MILENKOVIC, P. RAGHA- VAN, 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.
75. JON M. KLEINBERG AND SENDHIL MULLAINATHAN. Resource bounds and combi¬nations of consensus objects. In Proceedings of the 12th Annual ACM Symposium, on, Principles of Distributed Computing, pages 133-144, 1993.
76. CLYDE P. KRUSKAL, LARRY RUDOLPH, AND MARC SNIR. Efficient synchroniza¬tion on multiprocessors with shared memory. ACM Transactions on Programming Languages and Systems, 10(4), pages 579-601, October 1988.
77. EYAL KUSHILEVITZ, YISHAY MANSOUR, MICHAEL O. RABIN, AND DAVID ZUCK- ERMAN. Lower bounds for randomized mutual exclusion. SIAM Journal on Com¬puting, 27(6), pages 1550-1563, 1998.
78. LESLIE LAMPORT. A new solution of Dijkstra’s concurrent programming problem. Communications of the ACM, 17(8), pages 453-455, 1974.
79. LESLIE LAMPORT. The mutual exclusion problem. Part II: Statement and solu¬tions. Journal of the ACM, 33(2), pages 327-348, 1986.
80. LESLIE LAMPORT AND NANCY LYNCH. Distributed computing: Models and meth¬ods. In Handbook of Theoretical Computer Science, volume B, chapter 18. Elsevier, 1990.
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.
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.
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.
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.
85. RONIT LUBITCH AND SHLOMO MORAN. Closed schedulers: A novel technique for analyzing asynchronous protocols. Distributed Computing, 8(4), pages 203-210, 1995.
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.
87. NANCY A. LYNCH. Distributed Algorithms. Morgan Kaufmann, 1996.
88. SHLOMO MORAN AND LIHU RAPPOPORT. On the robustness of hrm. In Distributed Algorithms, 10th International Workshop, volume 1151 of LNCS, pages 344-361, 1996.
89. SHLOMO MORAN, GADI TAUBENFELD, AND IRIT YADIN. Concurrent counting. Journal of Computer and System Sciences, 53(1), pages 61-78, August 1996.
90. SHLOMO MORAN AND YARON WOLFSTAHL. Extended impossibility results for asynchronous complete networks. Information Processing Letters, 26(3), pages 145-151, November 1987.
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.
92. NAOR AND ROTH. Parallel algorithms with processor failures and delays. Random Structures and Algorithms, 1995.
93. 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.
94. MICHAEL RABIN. Randomized Byzantine generals. In Proc. 24th IEEE Sympo¬sium, on, Foundations of Computer Science, pages 403-409, 1983.
95. OPHIR RACHMAN. Anomalies in the wait-free hierarchy. In Distributed Algorithms, 8th International Workshop, volume 857 of LNCS, pages 156-163, 1994.
96. G. M. REED, A. W. ROSCOE, AND R. F. WACHTER, EDS. Topology and Category Theory in Computer Science. Clarendon Press, Oxford, 1991.
97. ERIC RUPPERT. Determining consensus numbers. SIAM Journal on, Computing. To appear.
98. ERIC RUPPERT. Consensus numbers of multi-objects. In Proceedings of the 17th Annual ACM Symposium, on, Principles of Distributed Computing, pages 211-217, 1998.
99. MICHAEL SAKS AND FOTIOS ZAHAROGLOU. Wait-free k-set agreement is impos¬sible: The topology of public knowledge. SIAM Journal on, Computing, 29(5), pages 1449-1483, March 2000.
100. ERIC SCHENK. Faster approximate agreement with multi-writer registers. In Proc. 36th, IEEE Symposium, on, Foundations of Computer Science, pages 714-723, 1995.
101. 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.
102. ERIC SCHENK. The consensus hierarchy is not robust. In Proceedings of the 16th, Annual ACM Symposium, on, Principles of Distributed Computing, page 279, 1997.
103. 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.
104. GADI TAUBENFELD, SHMUEL KATZ, AND SHLOMO MORAN. Initial failures in distributed computations. International Journal of Parallel Programming, 18(4), pages 255-276, August 1989.
105. GADI TAUBENFELD AND SHLOMO MORAN. Possibility and impossibility results in a shared memory environment. Acta Inform,atica, 33(1), pages 1-20, February 1996.