Dynamic load balancing with group communication

Theoretical Computer Science

Volumn 369, Issue 1-3, 2006, Pages 348-360

  Dolev, Shlomi ^a   Segala, Roberto ^b   Shvartsman, Alexander ^c,d  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b UNIVERSITY OF VERONA   (Italy)

^c University of Connecticut   (United States)

^d MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Dynamic networks; Group communications; Load balancing; Scheduling

Indexed keywords

ALGORITHMS; COMPUTER SCIENCE; DYNAMIC LOADS; PROGRAM PROCESSORS; REDUNDANCY; SCHEDULING;

DYNAMIC NETWORKS; GROUP COMMUNICATION SERVICE (GCS); GROUP COMMUNICATIONS; LOAD BALANCING; TASK EXECUTION REDUNDANCY;

TELECOMMUNICATION SYSTEMS;

EID: 33751018568     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2006.09.020     Document Type: Article

References (33)

1. Babaoglu O., Davoli R., and Montresor A. Group membership and view synchrony in partitionable asynchronous distributed systems: specification. Operating Systems Rev. 31 2 (1997) 11-22
2. O. Babaoglu, R. Davoli, A. Montresor, R. Segala, System support for partition-aware network applications, in: Proc. 18th Internat. Conf. on Distributed Computing Systems, May 1998.
3. Birman K.P., and van Renesse R. Reliable distributed computing with the isis toolkit (1994), IEEE Computer Society Press, Los Alamitos, CA
4. K.P. Birman, A review of experiences with reliable multicast, Software-Practice and Experience, Vol. 29(9), Wiley, New York, 1999, pp. 741-774.
5. Chlebus B.S., De Prisco R., and Shvartsman A.A. Performing tasks on synchronous restartable message-passing processors. Distributed Comput. 14 (2001) 49-64
6. Comm. ACM, Special Issue on Group Communication Services, 39(4) 1996.
7. R. De Prisco, A. Fekete, N. Lynch, A. Shvartsman, A dynamic view-oriented group communication service, in: Proc. ACM Symp. on Principles of Distributed Computing, 1998.
8. 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 Computing, 1994, pp. 161-172.
9. Dolev D., and Malki D. The transis approach to high availability cluster communications. Comm. ACM 39 4 (1996) 64-70
10. C. Dwork, J. Halpern, O. Waarts, Performing work efficiently in the presence of faults, SIAM J. Computing, 27 (5) (1998) 1457-1491; Preliminary version appeared as accomplishing work in the presence of failures, in: Proc. 11th ACM Symp. on Principles of Distributed Computing, 1992, pp. 91-102.
11. P. Ezhilchelvan, R. Macedo, S. Shrivastava, Newtop: a fault-tolerant group communication protocol, in: Proc. IEEE Internat. Conf. on Distributed Computing Systems, 1995, pp. 296-306.
12. A. Fekete, R. Khazan, N. Lynch, Group communication as a base for a load-balancing, replicated data service, in: Proc. 12th Internat. Symp. on Distributed Computing, 1998.
13. Fekete A., Lynch N., and Shvartsman A. Specifying and using a partitionable group communication service. ACM Trans. Comput. Systems 19 2 (2001) 171-216
14. Z. Galil, A. Mayer, M. Yung, Resolving message complexity of Byzantine agreement and beyond, in: Proc. 36th IEEE Symp. on Foundations of Computer Science, 1995, pp. 724-733.
15. Ch. Georgiou, Cooperative distributed computing in the presence of quantified adversity, Ph.D. Thesis, University of Connecticut, 2003.
16. Ch. Georgiou, A. Russell, A.A. Shvartsman, The complexity of synchronous iterative do-all with crashes, in: Proc. 15th Internat. Symp. on Distributed Computing (DISC'01), 2001, Springer, Lecture Notes on Computer Science, Vol. 2180, pp. 151-165.
17. Georgiou Ch., and Shvartsman A.A. Cooperative computing with fragmentable and mergeable groups. J. Discrete Algorithms 1 2 (2003) 211-235
18. Georgiou Ch., Russell A., and Shvartsman A. Work-competitive scheduling for cooperative computing with dynamic groups. SIAM J. Comput. (SICOMP) 34 4 (2005) 848-862
19. M. Hayden, The ensemble system, Doctoral Dissertation, Computer Science, Cornell University, 1998.
20. Kanellakis P., and Shvartsman A. Fault-Tolerant Parallel Computation (1997), Kluwer Academic Publishers, Dordrecht, MA
21. E.Y. Lotem, I. Keidar, D. Dolev, Dynamic voting for consistent primary components, in: Proc. 16th Ann. ACM Symp. on Principles of Distributed Computing, 1997, 63-71.
22. Lynch N.A., and Tuttle M.R. An introduction to input/output automata. CWI Quarterly 2 3 (1989) 219-246
23. G. Malewicz, Distributed scheduling for disconnected cooperation, Ph.D. Thesis, University of Connecticut, 2003.
24. G. Malewicz, A. Russell, A. Shvartsman, Distributed cooperation during the absence of communication, in: Proc. 14th Internat. Symp. on Distributed Computing (DISC'00), 2000, pp. 119-133.
25. G. Malewicz, A. Russell, A. Shvartsman, Optimal scheduling for disconnected cooperation, in: Proc. Eighth Internat. Colloq. Structure of Information and Communication Complexity (SIROCCO'01), pp. 259-274, June 2001. Also brief announcement, in: Proc. 19th ACM Symp. on Principles of Distributed Computing (PODC'01), 2001.
26. G. Malewicz, A.C. Russell, A.A. Shvartsman, Local scheduling for distributed cooperation, in: Proc. IEEE Internat. Symp. on Network Computing and Applications, NCA'2001, 2001, pp. 244-255.
27. Moser L.E., Melliar-Smith P.M., Agarawal D.A., Budhia R.K., and Lingley-Papadopolous C.A. Totem: a fault-tolerant multicast group communication system. Comm. ACM 39 4 (1996) 54-63
28. A. Russell, A. Shvartsman, Distributed computation meets design theory: local scheduling for disconnected cooperation, Current Trends in Theoretical Computer Science: The Challenge of the New Century, Vol. 1: Algorithms and Complexity, World Scientific, Singapore, 2004, pp. 315-336.
29. van Renesse R., Birman K.P., and Maffeis S. Horus: a flexible group communication system. Comm. ACM 39 4 (1996) 76-83
30. M. Saks, N. Shavit, H. Woll, Optimal time randomized consensus-making resilient algorithms fast in practice, in: Proc. Second ACM-SIAM Symp. on Discrete Algorithms, 1991, pp. 351-362.
31. D. Sleator, R. Tarjan, Amortized efficiency of list update and paging rules, CACM 28, 1985, pp. 202-208.
32. N. Shavit, Concurrent time-stamping, Ph.D. Thesis, School of Mathematics and Computer Science, Hebrew University, Jerusalem, 1990.
33. J. Sussman, K. Marzullo, The Bancomat problem: an example of resource allocation in a partitionable asynchronous system, in: Proc. 12th Internat. Symp. on Distributed Computing, 1998.