Cooperative computing with fragmentable and mergeable groups

Journal of Discrete Algorithms

Volumn 1, Issue 2, 2003, Pages 211-235

  Georgiou, Chryssis ^a   Shvartsman, Alex A ^a,b  

^a UNIVERSITY OF CONNECTICUT   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Communication; Complexity; Distributed algorithms; Group communication; Work

Indexed keywords

COMPLEX NETWORKS; COMPUTATIONAL COMPLEXITY; COOPERATIVE COMMUNICATION; EFFICIENCY; EVOLUTIONARY ALGORITHMS; FAULT TOLERANCE; MERGERS AND ACQUISITIONS; NETWORK TOPOLOGY;

CHANGE-OVER TIME; COMMUNICATION SERVICE; COMPLEXITY; COOPERATIVE COMPUTING; DYNAMIC CHANGES; GROUP COMMUNICATIONS; MESSAGE-PASSING; NETWORK TOPOLOGY; UNDERLYING NETWORKS; WORK;

MESSAGE PASSING;

EID: 13844264707     PISSN: 15708667     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1570-8667(03)00026-1     Document Type: Article

References (27)

1. O. Babaoglu, R. Davoli, L. Giachini, M. Baker, Relacs: a communication infrastructure for constructing reliable applications in large-scale distributed systems, in: Proc. of Hawaii International Conference on Computer and System Science, Vol. 2, 1995, pp. 612-621.
2. K.P. Birman, R. van Renesse, Reliable Distributed Computing with the Isis Toolkit, IEEE Computer Society Press, Los Alamitos, CA, 1994.
3. B. Chlebus, R. De Prisco, A. Shvartsman, Performing tasks on restartable message-passing processors, Distrib. Comput. 14 (2001) 49-64.
4. G.V. Chockler, I. Keidar, R. Vitenberg, Group communication specifications: a comprehensive study, ACM Comput. Surveys 33 (2001) 1-43.
5. Comm. ACM (Special Issue on Group Communication Services) 39 (1996).
6. R. De Prisco, A. Fekete, N. Lynch, A. Shvartsman, A dynamic view-oriented group communication service, in: Proc. of 17th ACM Symp. on Principles of Distributed Computing, 1998, pp. 227-236.
7. R. De Prisco, A. Mayer, M. Yung, Time-optimal message-efficient work performance in the presence of faults, in: Proc. 13th ACM Symp. on Principles of Distributed Comp., 1994, pp. 161-172.
8. D. Dolev, D. Malki, The transis approach to high availability cluster communications, Comm. ACM 39 (1996) 64-70.
9. S. Dolev, R. Segala, A. Shvartsman, Dynamic load balancing with group communication, in: Proc. of the 6th International Colloquium on Structural Information and Communication Complexity, 1999, pp. 111-125.
10. C. Dwork, J. Halpern, O. Waarts, Performing work efficiently in the presence of faults, SIAM J. Comput. 27 (1998) 1457-1491.
11. P. Ezhilchelvan, R. Macedo, S. Shrivastava, Newtop: A fault-tolerant group communication protocol, in: Proc. of IEEE Internat. Conference on Distributed Computing Systems, 1995, pp. 296-306.
12. A. Fekete, N. Lynch, A. Shvartsman, Specifying and using a group communication service, ACM Trans. Comput. Syst. 19 (2001) 171-216.
13. Z. Galil, A. Mayer, M. Yung, Resolving message complexity of Byzantine agreement and beyond, in: Proc. 36th IEEE Symposium on Foundations of Computer Science, 1995, pp. 724-733.
14. C. Georgiou, A. Shvartsman, Cooperative computing with fragmentable and Mergeable groups, in: Proc. of 7th International Colloquium on Structural Information and Communication Complexity, 2000, pp. 141-156.
15. M. Hayden, The Ensemble System, Ph.D. Thesis, TR98-1662, Cornell University, 1998.
16. P. Kanellakis, A. Shvartsman, Fault-Tolerant Parallel Computation, Kluwer Academic, Dordrecht, 1997.
17. R. Khazan, A. Fekete, N. Lynch, Multicast group communication as a base for a load-balancing replicated data service, in: Proc. of the 12th International Symposium on Distributed Computing, in: Lecture Notes in Comput. Sci., Vol. 1499, Springer, Andros, 1998, pp. 258-272.
18. E.Y. Lotem, I. Keidar, D. Dolev, Dynamic voting for consistent primary components, in: Proc. of the 16th Annual ACM Symp. on Principles of Distributed Computing, 1997, pp. 63-71.
19. N.A. Lynch, Distributed Algorithms, Morgan Kaufmann, San Mateo, CA, 1996.
20. N.A. Lynch, M.R. Tuttle, An introduction to input/output automata, CWI Quarterly 2 (1989) 219-246.
21. G. Malewicz, A. Russell, A.A. Shvartsman, Distributed cooperation during the absence of communication, in: Proc. 14th International Symposium on Distributed Computing, in: Lecture Notes in Comput. Sci., Vol. 1914, Springer, Berlin, 2000, pp. 119-133,
22. Preliminary version: Brief announcement, 19th ACM Symposium on Principles of Distributed Computing, 2000.
23. L.E. Moser, P.M. Melliar-Smith, D.A. Agarawal, R.K. Budhia, C.A. Lingley-Papadopolous, Totem: a faulttolerant multicast group communication system, Comm. ACM 39 (1996) 54-63.
24. S. Mishra, L.L. Peterson, R.D. Schlichting, Consul: a communication substrate for fault-tolerant distributed programs, Distrib. Syst. Engrg. 1 (1993) 87-103.
25. R. van Renesse, K.P. Birman, S. Maffeis, Horus: a flexible group communication system, Comm. ACM 39 (1996) 76-83.
26. M. Saks, N. Shavit, H. Woll, Optimal time randomized consensus - making resilient algorithms fast in practice, in: Proc. of the 2nd ACM-SIAM Symp. on Discrete Algorithms, 1991, pp. 351-362.
27. J. Sussman, K. Marzullo, The bancomat problem: an example of resource allocation in a partitionable asynchronous system, in: Proc. of 12th International Symposium on Distributed Computing, in: Lecture Notes in Comput Sci., Vol. 1499, Springer, Andros, 1998, pp. 363-377.