Tight analyses of two local load balancing algorithms

SIAM Journal on Computing

Volumn 29, Issue 1, 1999, Pages 29-64

  Ghosh, Bhaskar ^a   Leighton, F T ^b   Maggs, Bruce M ^c   Muthukrishnan, S ^d   Plaxton, C Greg ^e,f   Rajaraman, R ^e,f   Richa, AndréA W ^c   Tarjan, Robert E ^g   Zuckerman, David ^e,f  

^a Informix Software   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c Carnegie Mellon University   (United States)

^d LUCENT TECHNOLOGIES   (United States)

^e University of Texas ^*  (United States)

^f NORTHEASTERN UNIVERSITY   (United States)

^g Princeton University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; DISTRIBUTED COMPUTER SYSTEMS; GRAPH THEORY; RESPONSE TIME (COMPUTER SYSTEMS);

DISTRIBUTED NETWORK ALGORITHMS; LOCAL LOAD BALANCING ALGORITHMS;

ALGORITHMS;

EID: 0342733647     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539795292208     Document Type: Article

References (40)

1. Y. AFEK, E. GAFNI, AND A. ROSEN, The slide mechanism with applications in dynamic networks, in Proceedings of the 11th ACM Symposium on Principles of Distributed Computing, 1992, pp. 35-46.
2. W. AIELLO, B. AWERBUCH, B. MAGGS, AND S. RAO, Approximate load balancing on dynamic and asynchronous networks, in Proceedings of the 25th Annual ACM Symposium on the Theory of Computing, 1993, pp. 632-641.
3. M. AJTAI, J. KOMLÓS, AND E. SZEMERÉDI, Sorting in c log n parallel steps, Combinatorica, 3 (1983), pp. 1-19.
4. J. ASPNES, M. HERLIHY, AND N. SHAVIT, Counting networks and multiprocessor co-ordination, in Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991, pp. 348-358.
5. B. AWERBUCH AND T. LEIGHTON, A simple local-control approximation algorithm for multi-commodity flow, in Proceedings of the 34th IEEE Annual Symposium on Foundations of Computer Science, 1993. pp. 459-468.
6. B. AWERBUCH AND T. LEIGHTON, Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks, in Proceedings of the 26th Annual ACM Symposium on the Theory of Computing, 1994, pp. 487-496.
7. B. AWERBUCH, Y. MANSOUR, AND N. SHAVIT, End-to-end communication with polynomial overhead, in Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science, 1989, pp. 358-363.
8. D. P. BERTSEKAS AND J. N. TSITSIKLIS, Parallel and Distributed Computation: Numerical Methods, Prentice-Hall, Englewood Cliffs. NJ, 1989.
9. A. BRODER, A. M. FRIEZE, E. SHAMIR, AND E. UPFAL, Near-perfect token distribution, in Proceedings of the 19th International Colloquium on Automata. Languages and Programming, 1992, pp. 308-317.
10. H. CHERNOFF, A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations, Ann. Math. Stat., 23 (1952), pp. 493-507.
11. Y. C. CHOW AND W. KOHLER, Models for dynamic load balancing in a heterogeneous multiple processor system, IEEE Trans. Comput., C-28 (1980), pp. 57-68.
12. G. CYBENKO, Dynamic load balancing for distributed memory multiprocessors, J. Parallel Distrib. Comput., 7 (1989), pp. 279-301.
13. D. EAGER, E. LAZOWSKA, AND J. ZAHORJAN, Adaptive load sharing in homogeneous distributed systems, IEEE Trans. Software Engrg., SE-12 (1986), pp. 662-675.
14. B. GHOSH AND S. MUTHUKRISHNAN, Dynamic load balancing on parallel and distributed networks by random matchings, in Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures, 1994, pp. 226-235.
15. B. GHOSH, S. MUTHUKRISHNAN, AND M. H. SCHULTZ, First and second order diffusive methods for rapid, coarse, distributed load balancing, in Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures, 1996, pp. 72-81.
16. B. GOLDBERG AND P. HUDAK, Implementing functional programs on a hypercube multiprocessor, in Proceedings of the 4th Conference on Hypercubes, Concurrent Computers and Applications, vol. 1, 1989, pp. 489-503.
17. A. HEIRICH AND S. TAYLOR, A Parabolic Theory of Load Balance, Research Report Caltech-CS-TR-93-25, Caltech Scalable Concurrent Computation Lab, Pasadena, CA, 1993.
18. K. T. HERLEY, A note on the token distribution problem, Inform. Process. Lett., 28 (1991), pp. 329-334.
19. S. H. HOSSEINI, B. LITOW, M. MALKAWI, J. MCPHERSON, AND K. VAIRAVAN, Analysis of a graph coloring based distributed load balancing algorithm, J. Parallel Distrib. Comput., 10 (1990), pp. 160-166.
20. J. JÁJÁ AND K. W. RYU, Load balancing and routing on the hypercube and related networks, J. Parallel Distrib. Comput., 14 (1992), pp. 431-435.
21. M. R. JERRUM AND A. SINCLAIR, Conductance and the rapid mixing property for Markov chains: The approximation of the permanent resolved, in Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988, pp. 235-244.
22. R. KARP AND Y. ZHANG, A randomized parallel branch-and-bound procedure, J. ACM, 40 (1993), pp. 765-789.
23. M. KLUGERMAN AND C. G. PLAXTON, Small depth counting networks, in Proceedings of the 24th Annual ACM Symposium on the Theory of Computing, 1992, pp. 417-428.
24. T. LEIGHTON, C. E. LEISERSON, AND D. KRAVETS, Theory of Parallel and VLSI Computation, Research Seminar Series Report MIT/LCS/RSS 8, MIT Laboratory for Computer Science, MIT, Cambridge, MA, 1990.
25. F. C. H. LIN AND R. M. KELLER, The gradient model load balancing method, IEEE Trans. Software Engrg., SE-13 (1987), pp. 32-38.
26. R. LÜLING AND B. MONIEN, Load balancing for distributed branch and bound algorithms, in Proceedings of the 6th International Parallel Processing Symposium, 1992, pp. 543-549.
27. R. LÜLING AND B. MONIEN, A dynamic distributed load balancing algorithm with provable good performance, in Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, 1993, pp. 164-172.
28. R. LÜLING, B. MONIEN, AND F. RAMME, Load balancing in large networks: A comparative study, in Proceedings of the 3rd IEEE Symposium on Parallel and Distributed Processing, IEEE Press, Piscataway, NJ, 1991, pp. 686-689.
29. F. MEYER AUF DER HEIDE, B. OESTERDIEKHOFF, AND R. WANKA, Strongly adaptive token distribution, in Proceedings of the 20th International Colloquium on Automata, Languages and Programming, 1993, pp. 398-409.
30. M. MIHAIL, Conductance and convergence of Markov chains - a combinatorial treatment of expanders, in Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science, 1989, pp. 526-531.
31. L. M. NI, C. XU, AND T. B. GENDREAU, Distributed drafting algorithm for load balancing, IEEE Trans. Software Engrg., SE-11 (1985), pp. 1153-1161.
32. D. PELEG AND E. UPFAL, The generalized packet routing problem, Theoret. Comput. Sci., 53 (1987), pp. 281-293.
33. D. PELEG AND E. UPFAL, The token distribution problem, SIAM J. Comput., 18 (1989), pp. 229-243.
34. C. G. PLAXTON, Load balancing, selection and sorting on the hypercube, in Proceedings of the 1989 ACM Symposium on Parallel Algorithms and Architectures, 1989, pp. 64-73.
35. J. STANKOVIC, Simulations of three adaptive, decentralized controlled, job scheduling algorithms, Computer Networks, 8 (1984), pp. 199-217.
36. R. SUBRAMANIAN AND I. D. SCHERSON, An analysis of diffusive load balancing, in Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures, 1994, pp. 220-225.
37. A. N. TANTAWI AND D. TOWSLEY, Optimal static load balancing in distributed computer systems, J. ACM, 32 (1985), pp. 445-465.
38. E. UPFAL, An O (log N) deterministic packet routing scheme, in Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989, pp. 241-250.
39. R. D. WILLIAMS, Performance of dynamic load balancing algorithms for unstructured mesh calculations, Concurrency: Practice and Experience, 3 (1991), pp. 457-481.
40. C. Z. XU AND F. C. M. LAU, Iterative dynamic load balancing in multicomputers, J. Oper. Res. Soc., 45 (1994), pp. 786-796.