Dynamic load balancing by random matchings

Journal of Computer and System Sciences

Volumn 53, Issue 3, 1996, Pages 357-370

  Ghosh, Bhaskar ^a,c   Muthukrishnan, S ^b  

^a Yale University   (United States)

^b RUTGERS UNIVERSITY   (United States)

^c ONR

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER NETWORKS; COMPUTER SYSTEM RECOVERY; GRAPH THEORY; PARALLEL ALGORITHMS; PROGRAM PROCESSORS; RESOURCE ALLOCATION; STORAGE ALLOCATION (COMPUTER); TELECOMMUNICATION LINKS; TIME SHARING SYSTEMS;

DYNAMIC LOAD BALANCING; RANDOM MATCHINGS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0030381932     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1996.0075     Document Type: Article

References (40)

1. W. Aiello, B. Awerbuch, B. Maggs, and S. Rao, Approximate load balancing on dynamic and asynchronous networks, in "Proc. of 25th ACM Symposium on Theory of Computing, May 1993," pp. 632-641.
2. N. Alon, Eigenvalues and expanders, Combinatorica 6 (1986), 83-96.
3. Y. Aumann and M. Ben-Or, Computing with faulty arrays, in "Proc. of 24th ACM Symposium on Theory of Computing, May, 1992," pp. 162-169.
4. J. Aspnes, M. Herlihy, and N. Shavit, Counting networks and multiprocessor coordination, in "Proc. of 23rd ACM Symposium on Theory of Computing, May 1991," pp. 348-358.
5. N. Alon and J. Spencer, "The Probabilistic Method," Wiley, New York, 1994.
6. B. Bollobas, "Random Graphs," Academic Press, New York, 1987.
7. M. J. Berger and S. H. Bokhari, A partitioning strategy for nonuniform problems on multiprocessors, IEEE Trans. Computers 36, No. 5 (1987), 570-580.
8. J. E. Boillat, Load balancing and Poisson equation in a graph, Concurrency: Practice and Experience 2, No. 4 (1990), 289-313.
9. G. Cybenko, Dynamic load balancing for distributed memory multiprocessors, J. Parallel Distributed Computing 2, No. 7 (1989), 279-301.
10. D. Eager, E. Lazowska, and J. Zahorjan, Adaptive load sharing in homogeneous distributed systems, IEEE Trans. Software Eng. SE-12, No. 5 (1966), 662-675.
11. R. Feldmann, "Game Tree Search on Massively Parallel Systems," Ph.D. thesis, Dept. of Mathematics and Computer Science, University of Paderborn, August 1993.
12. B. Ghosh, T. Leighton, B. Maggs, S. Muthukrishnan, G. Plaxton, R. Rajaraman, A. Richa, R. Tarjan, and D. Zuckerman, Tight analysis of two local load balancing algorithms, in "Proc. of 27th ACM Symposium on Theory of Computing, May 1995," pp. 548-558.
13. B. Ghosh, S. Muthukrishnan, and M. Schultz, On first and second order methods for load balancing, manuscript, 1995.
14. B. Goldberg and P. Hudak, Implementing functional programs on a hypercube multiprocessor, in "Proc. of the 4th Conference on Hypercubes, Concurrent Computers and Applications, 1989," Vol. 1, pp. 489-503.
15. J. Hong, M. Chen, and X. Tan, Dynamic cyclic load balancing on hyercubes, in "Proc of the 4 th Conference on Hypercubes, Concurrent Computers and Applications, 1989," Vol. 1, pp. 595-598.
16. M. Herlihy, B. Lim, and N. Shavit, Low contention load balancing on large-scale multiprocessors, in "Proc. of 4th ACM Symposium on Parallel Algorithms and Architectures, 1992," pp. 219-227.
17. A. Heirich and S. Taylor, "A Parabolic Theory of Load Balance," Res. Rep. Caltech-CS-TR-93-25, Caltech Scalable Concurrent Computation Lab, March 1993.
18. A. Israeli and A. Itai, A fast and simple randomized parallel algorithm for maximal matching, Inform. Process. Lett. 22 (1986), 77-80.
19. A. Israeli and Y. Shiloach, An improved parallel algorithm for maximal matching, Inform. Process. Lett. 22 (1986), 57-60.
20. V. Kumar and V. Rao, Load balancing on the hypercube architecture, in "Proc. of the 4th Conference on Hypercubes, Concurrent Computers and Applications, 1989," Vol. 1, pp. 603-608.
21. M. Luby, A simple parallel algorithm for the maximal independent set problem, SIAM J. on Computing 4 (1986), 1036-1053.
22. F. C. H. Lin and R. M. Keller, The gradient model load balancing method, IEEE Trans. Software Engg. 13, No. 1 (1987), 32-38.
23. R. Lueling and B. Monien, A dynamic distributed load balancing algorithm with provable good performance, in "Proc. of 5th ACM Symposium on Parallel Algorithms and Architectures, 164-172," 1993.
24. R. Lueling, B. Monien, and F. Ramme, Load balancing in large networks: A comparative study, in "Proc., IEEE Symposium on Parallel and Distributed Computing, Dallas, 1991."
25. B. Mohar and S. Poljak, "Eigenvalues in Combinatorial Optimization," Res. Rep. 92752, IMA, Minneapolis, 1992.
26. L. M. Li, C. W. Xu, and T. B. Gendreau, Drafting algorithm - A dynamic process migration protocol for distributed systems, in "Proc., International Conference on Distributed Computing Systems, 1985," pp. 539-546.
27. C. Ozturan, H. deCougny, M Shephard, and J. Flaherty, Parallel adaptive mesh refinement and redistribution on distributed memory computers, Tech. Rep. Rensselaer Polytechnic Inst., Troy, NY, 1993.
28. P. Pierce and G. Regnier, The paragon implementation of the NX message passing interface, in "Proc. of Scalable High Performance Computing Conference, Knoxville, TN, April 1994," pp. 184-190.
29. C. G. Plaxton, Load balancing, selection and sorting on the hypercube, in "Proc. of 1 st ACM Symp. on Parallel Algorithms and Architectures, 1989," pp. 64-73.
30. D. Peleg and E. Upfal, The token distribution problem, SIAM J. Comput. 18 (1989), 229-243.
31. M. O. Rabin, Efficient dispersal of information for security, load balancing and fault tolerance, J. ACM 36, No. 3 (1989), 335-348.
32. A. Ranade, Optimal speedup for backtrack search on a butterfly network, in "Proc. 3rd ACM Symp. on Parallel Algorithms and Architectures, 1991," pp. 40-49.
33. E. Rothberg, Sparse Cholesky factorization on the iPSC/860 and paragon multiprocessors, in "Proc. of Scalable High Performance Computing Conference, Knoxville, TN, April 1994," pp. 324-333.
34. R. Seidel, Backwards analysis of randomized geometric algorithms, in "New Trends in Discrete and Computational Geometry," Algorithms and Combinatorics, Vol. 10, pp. 37-68, 1993.
35. J. Stankovic, Simulations of three adaptive, decentralized controlled, job scheduling algorithms, Comput. Networks 8 (1984), 199-217.
36. C. Stunkel, D. Shea, D. Grice, P. Hochschild, and M. Tsao, The SP - 1 high performance switch, in "Proc of Scalable High Performance Computing Conference, Knoxville, TN, April 1994," pp. 150-157.
37. "IBM AIX System - Parallel Environment, Operation and Use," Version 2.0, June 1994.
38. C. Walshaw and M. Berzins, "Dynamic Load Balancing for PDE Solvers on Adaptive Unstructured Meshes," Tech. Rep. TR 92.32, Univ. of Leeds, School of Computer Studies, 1992.
39. C. Walshaw, M. Cross, and M. Everett, A Parallelisable Algorithm for Optimising Unstructured Mesh Partitions, Tech. Rep. 95/IM/03, University of Greenwich, 1995.
40. R. D. Williams, Performance of dynamic load balancing algorithms for unstructured mesh calculations, Concurrency : Practice and Experience 3, No. 5 (1991), 457-481.