Do-all computing in distributed systems: Cooperation in the presence of adversity

Do-All Computing in Distributed Systems: Cooperation in the Presence of Adversity

Volumn , Issue , 2008, Pages 1-219

  Georgiou, Chryssis ^a   Shvartsman, Alexander A ^b  

^a UNIVERSITY OF CYPRUS   (Cyprus)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84891426356     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/978-0-387-69045-2     Document Type: Book

References (109)

1. M. Abdelguerfi and S. Lavington. Emerging Trends in Database and Knowledge-Base Machines: The Application of Parallel Architectures to Smart Information Systems. IEEE Press, 1995.
2. C. Aguirre, J. Martinez-Munoz, F. Corbacho, and R. Huerta. Small-world topology for multi-agent collaboration. In Proceedings of the 11th International Workshop on Database and Expert Systems Applications, pages 231-235, 2000.
3. M. Ajtai, J. Aspnes, C. Dwork, and O.Waarts. A theory of competitive analysis for distributed algorithms. In Proceedings of the 35th Symposium on Foundations of Computer Science (FOCS 1994), pages 401-411, 1994.
4. N. Alon and J.H. Spencer. The Probabilistic Method. J. Wiley and Sons, Inc., second edition, 2000.
5. R.J. Anderson and H. Woll. Algorithms for the certified Write-All problem. SIAM Journal of Computing, 26(5):1277-1283, 1997.
6. H. Attiya and J. Welch. Distributed Computing: Fundamentals, Simulations and Advanced Topics. Wiley-Interscience, second edition, 2004.
7. Y. Aumann and M.O. Rabin. Clock construction in fully asynchronous parallel systems and PRAM simulation. In Proceedings of the 33rd IEEE Symposium on Foundations of Computer Science (FOCS 1992), pages 147-156, 1992.
8. B. Awerbuch, S. Kutten, and D. Peleg. Competitive distributed job scheduling. In Proceedings of the 24th ACM Symposium on Theory of Computing (STOC 1992), pages 571-580, 1992.
9. O. Babaoglu, R. Davoli, L. Giachini, and M. Baker. Relacs: A communication infrastructure for constructing reliable applications in large-scale distributed systems. In Proceedings of the 28th Hawaii International Conference on System Science (HICSS 1995), pages 612-621, 1995.
10. O. Babaoglu, R. Davoli, and A. Montresor. Group communication in partitionable systems: Specification and algorithms. Software Engineering, 27(4):308-336, 2001.
11. Y. Bartal, A. Fiat, and Y. Rabani. Competitive algorithms for distributed data management. In Proceedings of the 24th ACM Symposium on Theory of Computing (STOC 1992), pages 39-50, 1992.
12. S. Ben-David, A. Borodin, R. Karp, G. Tardos, and A. Wigderson. On the power of randomization in on-line algorithms. Algorithmica, 11(1):2-14, 1994.
13. K.P. Birman and R. van Renesse. Reliable Distributed Computing with the Isis Toolkit. IEEE Computer Society Press, 1994.
14. J. Buss, P.C. Kanellakis, P. Ragde, and A.A. Shvartsman. Parallel algorithms with processor failures and delays. Journal of Algorithms, 20(1):45-86, 1996.
15. B. Chlebus, R. De-Prisco, and A.A. Shvartsman. Performing tasks on restartable message-passing processors. Distributed Computing, 14(1):49-64, 2001. A preliminary version has appeared in WDAG 1997.
16. B.S. Chlebus, L. Gasieniec, D.R. Kowalski, and A.A. Shvartsman. Bounding work and communication in robust cooperative computation. In Proceedings of the 16th International Symposium on Distributed Computing (DISC 2002), pages 295-310, 2002.
17. B.S. Chlebus and D.R. Kowalski. Randomization helps to perform independent tasks reliably. Random Structures and Algorithms, 24(1):11-41, 2004. A preliminary version appeared as "Randomization helps to perform tasks on processors prone to failures" in DISC 1999.
18. B.S. Chlebus and D.R. Kowalski. Robust gossiping with an application to consensus. Journal of Computer and System Sciences, 72(8):1262-1281, 2006. A preliminary version appeared as "Gossiping to reach consensus" in SPAA 2002.
19. B.S. Chlebus and D.R. Kowalski. Time and communication efficient consensus for crash failures. In Proceedings of the 20th International Symposium on Distributed Computing (DISC 2006), pages 314-328, 2006.
20. B.S. Chlebus, D.R. Kowalski, and A. Lingas. The Do-All problem in broadcast networks. Distributed Computing, 18(6):435-451, 2006. A preliminary version appeared in PODC 2001.
21. G.V. Chockler, I. Keidar, and R. Vitenberg. Group communication specifications: A comprehensive study. ACM Computing Surveys, 33(4):1-43, 2001.
22. A.E.F. Clementi, A. Monti, and R. Silvestri. Optimal F-reliable protocols for the Do-All problem on single-hop wireless networks. In Proceedings of the 13th International Symposium on Algorithms and Computation (ISAAC 2002), pages 320-331, 2002.
23. F. Cristian. Group, majority and strict agreement in timed asynchronous distributed systems. In Proceedings of the 26th Conference on Fault-Tolerant Computer Systems (FTCS 1996), pages 178-187, 1996.
24. P. Dasgupta, Z. Kedem, and M. Rabin. Parallel processing on networks of workstation: A fault-tolerant, high performance approach. In Proceedings of the 15th IEEE International Conference on Distributed Computer Systems (ICDCS 1995), pages 467-474, 1995.
25. R. De-Prisco, A. Mayer, and M. Yung. Time-optimal message-efficient work performance in the presence of faults. In Proceedings of the 13th ACM Symposium on Principles of Distributed Computing (PODC 1994), pages 161-172, 1994.
26. R.P. Dilworth. A decomposition theorem for partially ordered sets. Annals of Mathematics, 51:161-166, 1950.
27. D. Dolev and D. Malki. The transis approach to high availability cluster communications. Communications of the ACM, 39(4):64-70, 1996.
28. D. Dolev, D. Malki, and R. Strong. A framework for partitionable membership service. Technical Report TR 95-4, Institute of Computer Science, The Hebrew University of Jerusalem, 1995.
29. S. Dolev, R. Segala, and A.A. Shvartsman. Dynamic load balancing with group communication. Theoretical Computer Science, 369(1-3):348-360, 2006. A preliminary version appeared in SIROCCO 1999.
30. C. Dwork, J. Halpern, and O. Waarts. Performing work efficiently in the presence of faults. SIAM Journal on Computing, 27(5):1457-1491, 1998. A preliminary version appears in the Proceedings of the 11th ACM Symposium on Principles of Distributed Computing (PODC 1992), pages 91-102, 1992.
31. R. Elmasri and S.B. Navathe. Fundamentals of Database Systems. Addison-Wesley publishing company, second edition, 1994.
32. P. Ezhilchelvan, R. Macedo, and S. Shrivastava. Newtop: A fault-tolerant group communication protocol. In Proceedings of the 15th IEEE International Conference on Distributed Computing Systems (ICDCS 1995), pages 296-306, 1995.
33. A. Fekete, N. Lynch, and A.A. Shvartsman. Specifying and using a partitionable group communication service. ACM Transactions on Computer Systems, 19(2):171-216, 2001. A preliminary version appeared in PODC 1997.
34. A. Fernández, Ch. Georgiou, L. Lopez, and A. Santos. Reliably executing tasks in the presence of untrusted entities. In Proceedings of the 25th IEEE Symposium on Reliable Distributed Systems (SRDS 2006), pages 39-50, 2006.
35. A. Fernández, Ch. Georgiou, A. Russell, and A.A. Shvartsman. The Do-All problem with byzantine processor failures. Theoretical Computer Science, 333(3):433-454, 2005. A preliminary version appeared in SIROCCO 2003.
36. M.J. Fischer, N.A. Lynch, and M.S. Paterson. Impossibility of distributed consensus with one faulty process. Journal of the ACM, 32(2):374-382, 1985.
37. J.D. Foley, A. van Dam, S.K. Feiner, and J.F. Hughes. Computer Graphics: Principle and Practice. Addison-Wesley publishing company, second edition, 1996.
38. Z. Galil, A. Mayer, and M. Yung. Resolving message complexity of byzantine agreement and beyond. In Proceedings of the 36th IEEE Symposium on Foundations of Computer Science (FOCS 1995), pages 724-733, 1995.
39. G.R. Gallager. A perspective on multi-access channels. IEEE Transactions on Information Theory, 31(2):124-142, 1985.
40. Hui Gao, Jan Friso Groote, and Wim H. Hesselink. Lock-free dynamic hash tables with open addressing. Distributed Computing, 18(1):21-42, 2005.
41. S. Garland and N. Lynch. The IOA language and toolset: Support for designing, analyzing, and building distributed systems. Technical Report MIT/LCS/TR-762, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA, 1998.
42. S. Georgiades, M. Mavronicolas, and P. Spirakis. Optimal, distributed decision-making: The case of no communication. In Proceedings of the 12th International Symposium on Foundamentals of Computation Theory (FCT 1999), pages 293-303, 1999.
43. Ch. Georgiou. Robust Distributed Cooperation in the Presence of Quantified Adversity. PhD thesis, The University of Connecticut, Storrs, CT, 2003.
44. Ch. Georgiou, D.R. Kowalski, and A.A. Shvartsman. Efficient gossip and robust distributed computation. Theoretical Computer Science, 347(1):130-166, 2005. A preliminary version appeared in DISC 2003.
45. Ch. Georgiou, A. Russell, and A.A. Shvartsman. The complexity of synchronous iterative Do-All with crashes. Distributed Computing, 17:47-63, 2004. A preliminary version appeared in DISC 2001.
46. Ch. Georgiou, A. Russell, and A.A. Shvartsman. Work-competitive scheduling for cooperative computing with dynamic groups. SIAM Journal on Computing, 34(4):848-862, 2005. A preliminary version appeared in STOC 2003.
47. Ch. Georgiou, A. Russell, and A.A. Shvartsman. Failure-sensitive analysis of parallel algorithms with controlled memory access concurrency. Parallel Processing Letters, 17(2):153-168, 2007. A preliminary version appeared in OPODIS 2002.
48. Ch. Georgiou and A.A. Shvartsman. Cooperative computing with fragmentable and mergeable groups. Journal of Discrete Algorithms, 1(2):211-235, 2003. A preliminary version appeared in SIROCCO 2000.
49. A. Gharakhani and A.F. Ghoniem. Massively parallel implementation of a 3D vortex-boundary element method. In Proceedings of the European Series in Applied and Industrial Mathematics, volume 1, pages 213-223, 1996.
50. S.A. Green. Parallel Processing for Computer Graphics. MIT Press/Pitman Publishing, 1991.
51. J.F. Groote, W.H. Hesselink, S. Mauw, and R. Vermeulen. An algorithm for the asynchronous Write-All problem based on process collision. Distributed Computing, 14(2):75-81, 2001.
52. R. Guerraoui and Luis Rodrigues. Introduction to Reliable Distributed Programming. Springer, 2006.
53. V. Hadzilacos and S. Toueg. Fault-tolerant broadcasts and related problems. In Distributed Systems, chapter 5, pages 97-145. ACM Press/Addison-Wesley, 1993.
54. F. Harary. Graph Theory. Addison-Wesley, 1994.
55. M. Hayden. The Ensemble System. PhD thesis, Cornell University, 1998.
56. W.H. Hesselink and J.F. Groote. Waitfree distributed memory management by Create and Read until Deletion (CaRuD). Distributed Computing, 14(1):31-39, 2001.
57. M. Hiltunen and R. Schlichting. Properties of membership services. In Proceedings of the 2nd International Symposium on Autonomous Decentralized Systems, pages 200-207, 1995.
58. J.E. Hopcroft and R.M. Karp. An n5/2 algorithm for maximum matching in bipartite graphs. SIAM Journal on Computing, 2(4):225-231, 1973.
59. J. Hromkovic, R. Klasing, A. Pelc, P. Ruzicka, and W. Unger. Dissemination of Information in Communication Networks: Broadcasting, Gossiping, Leader Election, and Fault-Tolerance. Springer, 2005.
60. D.R. Hughes and F.C. Piper. Design Theory. Cambridge University Press, 1985.
61. Veromodo Inc. Tempo toolkit. http://www.veromodo.com.
62. K. Jacobsen, X. Zhang, and K. Marzullo. Group membership and wide-area master-worker computations. In Proceedings of the 23rd IEEE International Conference on Distributed Computing Systems (ICDCS 2003), pages 570-581, 2003.
63. C.B. Jenssen. Parallel Computational Fluid Dynamics 2000: Trends and Applications. Elsevier Science Ltd., first edition, 2001.
64. S.M. Johnson. A new upper bound for error-correcting codes. IEEE Transactions on Information Theory, 8(3):203-207, 1962.
65. P.C. Kanellakis, D. Michailidis, and A.A. Shvartsman. Controlling memory access concurrency in efficient fault-tolerant parallel algorithms. Nordic Journal of Computing, 2(2):146-180, 1995.
66. P.C. Kanellakis and A.A. Shvartsman. Efficient parallel algorithms can be made robust. Distributed Computing, 5(4):201-217, 1992. A preliminary version appears in the Proceedings of the 8th ACM Symposium on Principles of Distributed Computing (PODC 1989), pages 211-222, 1989.
67. P.C. Kanellakis and A.A. Shvartsman. Fault-Tolerant Parallel Computation. Kluwer Academic Publishers, 1997.
68. Z.M. Kedem, K.V. Palem, M.O. Rabin, and A. Raghunathan. Efficient program transformations for resilient parallel computation via randomization. In Proceedings of the 24th ACM Symposium on Theory of Computing (STOC 1992), pages 306-318, 1992.
69. Z.M. Kedem, K.V. Palem, A. Raghunathan, and P. Spirakis. Combining tentative and definite executions for dependable parallel computing. In Proceedings of the 23rd ACM Symposium on Theory of Computing (STOC 1991), pages 381-390, 1991.
70. Z.M. Kedem, K.V. Palem, and P. Spirakis. Efficient robust parallel computations. In Proceedings of the 22nd ACM Symposium on Theory of Computing (STOC 1990), pages 138-148, 1990.
71. D.E. Knuth. The Art of Computer Programming, volume 3. Addison-Wesley Publishers, third edition, 1998.
72. K. M. Konwar, S. Rajasekaran, and A.A. Shvartsman. Robust network super-computing with malicious processes. In Proceedings of the 20th International Symposium on Distributed Computing (DISC 2006), pages 474-488, 2006.
73. E. Korpela, D. Werthimer, D. Anderson, J. Cobb, and M. Lebofsky. SETI@home: Massively distributed computing for SETI. Computing in Science and Engineering, 3(1):78-83, 2001.
74. D.R. Kowalski, M. Momenzadeh, and A.A. Shvartsman. Emulating shared-memory Do-All algorithms in asynchronous message-passing systems. In Proceedings of the 7th International Conference on Principles of Distributed Systems (OPODIS 2003), pages 210-222, 2003.
75. D.R. Kowalski, P. Musial, and A.A. Shvartsman. Explicit combinatorial structures for cooperative distributed algorithms. In Proceedings of the 25th International Conference on Distributed Computing Systems (ICDCS 2005), pages 48-58, 2005.
76. D.R. Kowalski and A.A. Shvartsman. Writing-all deterministically and optimally using a non-trivial number of asynchronous processors. In Proceedings of the 16th ACM Symposium on Parallel Algorithms and Architectures (SPAA 2004), pages 311-320, 2004.
77. D.R. Kowalski and A.A. Shvartsman. Performing work with asynchronous processors: message-delay-sensitive bounds. Information and Computation, 203(2):181-210, 2005. A preliminary version appeared in PODC 2003.
78. L. Lamport, R. Shostak, and M. Pease. The Byzantine generals problem. ACM Transactions on Programming Languages and Systems, 4(3):382-401, 1982.
79. N.A. Lynch. Distributed Algorithms. Morgan Kaufmann Publishers, 1996.
80. N.A. Lynch and M.R. Tuttle. An introduction to Input/Output automata. CWI Quarterly, 2(3):219-246, 1989.
81. G. Malewicz. Distributed Scheduling for Disconnected Cooperation. PhD thesis, The University of Connecticut, Storrs, CT, 2003.
82. G. Malewicz. A work-optimal deterministic algorithm for the certified Write-All problem with a nontrivial number of asynchronous processors. SIAM Journal on Computing, 34(4):993-1024, 2005. A preliminary version appeared in PODC 2003.
83. G. Malewicz, A. Russell, and A.A. Shvartsman. Distributed cooperation during the absence of communication. In Proceedings of the 14th International Symposium on Distributed Computing (DISC 2000), pages 119-133, 2000.
84. G. Malewicz, A. Russell, and A.A. Shvartsman. Local scheduling for distributed cooperation. In Proceedings of the IEEE International Symposium on Network Computing and Applications (NCA 2001), 2001.
85. G. Malewicz, A. Russell, and A.A. Shvartsman. Optimal scheduling for disconnected cooperation. In Proceedings of the 8th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2001), pages 259-274, 2001.
86. G. Malewicz, A. Russell, and A.A. Shvartsman. Distributed scheduling for disconnected cooperation. Distributed Computing, 18(6):409-420, 2006.
87. C. Martel, A. Park, and R. Subramonian. Work-optimal asynchronous algorithms for shared memory parallel computers. SIAM Journal on Computing, 21(6):1070-1099, 1992.
88. C. Martel and R. Subramonian. On the complexity of certified Write-All algorithms. Journal of Algorithms, 16(3):361-387, 1994.
89. C. Martel, R. Subramonian, and A. Park. Asynchronous PRAMs are (almost) as good as synchronous PRAMs. In Proceedings of the 31st IEEE Symposium on Foundations of Computer Science (FOCS 1990), pages 590-599, 1990.
90. S. Mishra, L.L. Peterson, and R.D. Schlichting. Consul: A communication substrate for fault-tolerant distributed programs. Distributed Systems Engineering Journal, 1(2):87-103, 1993.
91. S. Molnar, J. Eyles, and J. Poulton. PixelFlow: High-speed rendering using image composition. Computer Graphics, 26(2):231-240, 1992.
92. L.E. Moser, Y. Amir, P.M. Melliar-Smith, and D.A. Agarwal. Extended virtual synchrony. In Proceedings of the 14th IEEE International Conference on Distributed Computing Systems (ICDCS 1994), pages 56-65, 1994.
93. L.E. Moser, P.M. Melliar-Smith, D.A. Agarawal, R.K. Budhia, and C.A. Lingley-Papadopolous. Totem: A fault-tolerant multicast group communication system. Communications of the ACM, 39(4):54-63, 1996.
94. P.M. Musial. Computational requirements of the beam-space post-doppler space time adaptive processing algorithm. Master's thesis, University of Connecticut, 2001.
95. C.H. Papadimitriou and M. Yannakakis. On the value of information in distributed decision-making. In Proceedings of the 10th ACM Symposium on Principles of Distributed Computing (PODC 1991), pages 61-64, 1991.
96. A. Pelc. Fault-tolerant broadcasting and gossiping in communication networks. Networks, 28(3):143-156, 1996.
97. D. Powell, editor. Special Issue on Group Communication Services, volume 39(4) of Communications of the ACM. ACM Press, 1996.
98. A. Ricciardi, A. Schiper, and K. Birman. Understanding partitions and the "no partition" assumption. In Proceedings of the 4th Workshop on Future Trends of Distributed Computing Systems, pages 354-360, 1993.
99. A. Russell and A.A. Shvartsman. Distributed computation meets design theory: Local scheduling for disconnected cooperation. Bulletin of the European Association for Theoretical Computer Science, 77:120-131, 2002.
100. M. Saks, N. Shavit, and H.Woll. Optimal time randomized consensus - making resilient algorithms fast in practice. In Proceedings of the 2nd ACM-SIAM Symposium on Discrete Algorithms (SODA 1991), pages 351-362, 1991.
101. R. Samanta, J. Zheng, T. Funkhouser, K. Li, and J.P. Singh. Load balancing for multi-projector rendering systems. In SIGGRAPH/Eurographics Workshop on Graphics Hardware, pages 107-116, 1999.
102. R.D. Schlichting and F.B. Schneider. Fail-stop processors: An approach to designing fault-tolerant computing systems. ACM Transactions on Computing Systems, 1(3):222-238, 1983.
103. N. Shavit. Concurrent Time Stamping. PhD thesis, The Hebrew University of Jerusalem, Israel, 1989.
104. A.A. Shvartsman. Achieving optimal CRCW PRAM fault-tolerance. Information Processing Letters, 39(2):59-66, 1991.
105. D. Sleator and R. Tarjan. Amortized efficiency of list update and paging rules. Communications of the ACM, 28(2):202-208, 1985.
106. D.R. Stinson. Cryptography: Theory and practice. CRC PRess, 1995.
107. M. Tambe, J. Adibi, Y. Alonaizon, A. Erdem, G.A. Kaminka, S. Marsella, and I. Muslea. Building agent teams using an explicit teamwork model and learning. Artificial Intelligence, 110(2):215-239, 1999.
108. R. van Renesse, K.P. Birman, and S. Maffeis. Horus: A flexible group communication system. Communications of the ACM, 39(4):76-83, 1996.
109. S.G. Ziavras and P. Meer. Adaptive multiresolution structures for image processing on parallel computers. Journal of Parallel and Distributed Computing, 23(3):475-483, 1994.