New perspectives in distributed computing

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

Volumn 1672, Issue , 1999, Pages 170-186

  Herlihy, Maurice ^a   Rajshaum, Sergio ^b  

^a Brown Univerity   (United States)

^b UNIVERSIDAD NACIONAL AUTÓNOMA DE MÉXICO   (Mexico)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; TOPOLOGY;

ALGEBRAIC TOPOLOGY;

COMPUTATION THEORY;

EID: 84949222007     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48340-3_16     Document Type: Conference Paper

References (44)

1. H. Attiya and J. Welch, Distributed Computing: Fundamentals, Simulations and Advanced Topics, McGraw-Hill, 1998.
2. Baruch Awerbuch, "Complexity of Network Synchronization," Journal of the ACM, Vol. 32, No. 4, Oct. 1985, pp. 804-823.
3. H. Attiya, A. Bar-Noy, and D. Dolev, "Sharing Memory Robustly in message Passing Systems," Journal of the ACM, Vol. 42, No. 1 (January 1995), pp. 124-142.
4. Hagit Attiya, Amotz Bar-Noy, Danny Dolev, David Peleg, and Rudiger Reischuk, "Renaming in an asynchronous environment," Journal of the ACM 37, 3, July 1990, 524-548.
5. Y. Afek, H. Attiya, D. Dolev, E. Gafni, M. Merritt and N. Shavit, "Atomic snapshots of shared memory," J. of the ACM, 40(4), (Sept. 1993), 873-890.
6. Hagit Attiya and Sergio Rajsbaum, "The Combinatorial Structure of Wait-free Solvable Tasks," 10th International Workshop on Distributed Algorithms (WDAG), O. Babaoglu and K. Marzullo, Eds., October 1996, 321-343. Lecture Notes in Computer Science #1151, Springer-Verlag.
7. M.A. Armstrong, Basic Topology, Undergraduate Texts In Mathematics, SpringerVerlag, New York, 1983.
8. E. Borowsky and E. Gafni, "Generalized FLP impossibility result for ŕ-resilient asynchronous computations," in Proceedings of the 1993 ACM Symposium on Theory of Computing, May 1993, 91-100.
9. E. Borowsky, E. Gafni, N. Lynch, and S. Rajsbaum, "The BG Distributed Simulation Algorithm," Technical Memo MIT/LCS/TM-573, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA 02139, December, 1997. Submitted for publication. Includes the results of [8,39].
10. J.A. Bondy and U.S.R. Murty, Graph theory with applications, North-Holland, 1979.
11. O. Biran, S. Moran, S. Zaks, "A combinatorial characterization of the distributed 1-solvable tasks," Journal of Algorithms, 11, 1990, 420-440.
12. S. Chaudhuri, "Agreement is harder than consensus: set consensus problems in totally asynchronous systems," in Proceedings of the Ninth Annual ACM Symposium on Principles of Distributed Computing, 1990, 311-234, 1990.
13. S. Chaudhuri, M.P. Herlihy, N. Lynch, and M.R. Tbttle, "A tight lower bound for k-set agreement," in Proceedings of the 34th IEEE Symposium on Foundations of Computer Science, October 1993, 206-215.
14. D. Dolev and C. Dwork and L Stockmeyer, "On The Minimal Synchronism Needed For Distributed Consensus", in Journal of the ACM, 34(1), January 1987, 77-97.
15. D. Dolev, N. Lynch, S. Pinter, E. Stark and W. Weihl, "Reaching approximate agreement in the presence of faults," Journal of the ACM, 33 (3), 1986, 499-516.
16. D. Dolev, H.R. Strong, " Polynomial algorithms for multiple processor agreement," in Proceedings of the 14th Annual ACM Symposium on Theory of Computing, pp. 401-407, May 1982.
17. C. Dwork, Y. Moses, "Knowledge and common knowledge in a byzantine environment: crash failures," Information and Computation, vol. 8, no. 2, pp. 156-186, October 1990.
18. M. Fischer, "The consensus problem in unreliable distributed systems (a brief survey)," Research Report YALE/DCS/RR-273, Yale University, Department of Computer Science, New Haven, Conn., June 1983.
19. M.J. Fischer, N.A. Lynch, "A lower bound for the time to assure interactive consistency," Information Processing Letters, vol. 14, no. 4, pp. 183-186, June 1982.
20. M. Fischer, N.A. Lynch, and M.S. Paterson, "Impossibility of distributed commit with one faulty process," Journal of the ACM, 32(2), April 1985, 374-382.
21. E. Gafni, "Round-by-round fault detectors: unifying synchrony and asynchrony," Proc. of the 17th ACM Symp. on Principles of Dist. Comp., 1998, pp. 199-208.
22. E. Gafni, E. Koutsoupias, "3-processor tasks are undecidable," Proceedings of the 14-th Annual ACM Symposium on Principles of Distributed Computing, page 271, August 1995.
23. E. Goubault, "Schedulers as abstract interpretations of HDA," Proc. of PEPM'95, 1995.
24. E. Goubault, "The dynamics of wait-free distributed computations," LIENS, Ecole Normale Superieure, 26 (1996), 1-40.
25. E. Goubault, "A semantic view on distributed computability and complexity," Proc. of the 3rd Theory and Formal Methods Section Workshop, 1996.
26. J. Gunawardena, "Homotopy and concurrency," Bulletin of the EATCS, 54 (1994), 184-193.
27. M.P. Herlihy, "Wait-Free Synchronization," ACM Transactions on Programming Languages and Systems, vol. 13, no. 1, pp. 123-149, January 1991.
28. M.P. Herlihy and S. Rajsbaum, "Set Consensus Using Arbitrary Objects," in Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing, pages 324-333, August 1994.
29. M.P. Herlihy and S. Rajsbaum, "Algebraic Spans," in Proc. of the 14th Annual ACM Symp. on Principles of Dist. Comp., 90-99, 1995.
30. M.P. Herlihy and S. Rajsbaum, "The decidability of distributed decision task," in Proc. of the 29th ACM Symposium on Theory of Computing, 589-598, 1997.
31. M.P. Herlihy and S. Rajsbaum, "A Wait-Free Classification of Loop Agreement Tasks," S. Kutten (Ed.) Lecture Notes in Computer Science # 1499, Springer Verlag, 175-185: 12th Int. Symp. on Dist. Comp. (DISC before WDAG), Sept. 24-26, 1998.
32. M.P. Herlihy and S. Rajsbaum, "A Primer on Algebraic Topology and Distributed Computing," in Computer Science Today, Jan van Leeuwen (Ed.), LNCS Vol. 1000, Springer-Verlag, 1995, p. 203-217.
33. M.P. Herlihy, S. Rajsbaum, and M. Tuttle, "Unifying Synchronous and Asynchronous Message-Passing Models," in Proc. of the 17th ACM Symp. on Principles of Dist. Comp. (PODC), 1998, 133-142.
34. M.P. Herlihy and N. Shavit, "The asynchronous computability theorem for t- resilient tasks," In Proceedings of the 1993 ACM Symposium on Theory of Computing, May 1993, 111-120.
35. M.P. Herlihy and N. Shavit, "A simple constructive computability theorem for wait-free computation," Proceedings of the 1994 ACM Symposium on Theory of Computing, May 1994, 243-252.
36. G. Hoest and N. Shavit, "Towards a Topological Characterization of Asynchronous Complexity," Proc. of the 16th ACM Symp. on Principles of Dist. Comp. (PODC), 1997, 199-208.
37. M. C. Loui and H.H. Abu-Amara, "Memory requirements for agreement among unreliable asynchronous processes," In Parralel and Distributed Computing, F. P. Preparata, editor, vol. 4 of Advances in Computing Research, pages 163-183. JAI Press, 1987.
38. N.A. Lynch, Distributed Algorithms, Morgan Kaufmann Publishers, Inc. 1996.
39. N.A. Lynch and S. Rajsbaum, "On the Borowsky-Gafni Simulation Algorithm," In Proceedings of the Fourth Israel Symposium on Theory of Computing and Systems, June 1996, 4-15.
40. S. Moran and Y. Wolfstahl, "Extended impossibility results for asynchronous complete networks," Information Processing Letters, 26 (1987/88), 145-151.
41. Y. Moses and S. Rajsbaum, "The unified structure of consensus: a layered analysis approach," in Proc. of the 17th ACM Symp. Principles of Dist. Comp., 1998, pp. 123-132.
42. M., Pease, R. Shostak and L. Lamport, "Reaching agreement in the presence of faults," Journal of the ACM, Vol. 27, No. 2, (April 1980),. 228-234.
43. John H. Wensley et al. "SIFT: Design and analysis of a fault-tolerant computer for aircraft control," Proceedings of the IEEE, Vol. 66, No. 10, pp. 1240-1255, October 1978.
44. M. Sales and F. Zaharoglou, "Wait-free fc-set agreement is impossible: The topology of public knowledge," In Proceedings of the 1993 ACM Symposium on Theory of Computing, May 1993, 101-110.