Strategies for Dynamic Load Balancing on Highly Parallel Computers

IEEE Transactions on Parallel and Distributed Systems

Volumn 4, Issue 9, 1993, Pages 979-993

  Reeves, Anthony P ^b  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b Department of Molecular Biology and Genetics   (United States)

Author keywords

Distributed control; dynamic load balancing; highly parallel systems; hypercube multicomputer; multicomputer synchronization; nonuniform problems

Indexed keywords

COMPUTER NETWORKS; DISTRIBUTED PARAMETER CONTROL SYSTEMS; MATHEMATICAL MODELS; SYNCHRONIZATION;

DIMENSION EXCHANGE METHOD; DYNAMIC LOAD BALANCING; HEIRARCHICAL BALANCING METHOD; HIGHLY PARALLEL SYSTEMS; HYPERCUBE MULTICOMPUTER; MULTICOMPUTER SYNCHRONIZATION; NONUNIFORM PROBLEMS; SENDER INITIATED DIFFUSION;

PARALLEL PROCESSING SYSTEMS;

EID: 0027663155     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.243526     Document Type: Article

References (22)

1. M. Willebeek-LeMair and A. P. Reeves, “Region growing on a hypercube multiprocessor,” in Proc. 3rd Conf. Hypercube Concurrent Comput. and Appl., 1988, pp. 1033–1042.
2. T. L. Casavant and J. G. Kuhl, “A taxonomy of scheduling in general-purpose distributed computing systems,” IEEE Trans. Software Eng., vol. 14, no. 2, pp. 141–154, Feb. 1988.
3. Y.-T. Wang and R. J. T. Morris, “Load sharing in distributed systems,” IEEE Trans. Comput., vol. C-34, pp. 204–217, Mar. 1985.
4. M. J. Berger and S. H. Bokhari, “A partitioning strategy for nonuniform problems on multiprocessors,” IEEE Trans. Comput., vol. C-36, pp. 570–580, May 1987.
5. G. C. Fox, “A review of automatic load balancing and decomposition methods for the hypercube,” California Institute of Technology, C3P-385, Nov. 1986.
6. K. Ramamritham, J. A. Stankovic, and W. Zhao, “Distributed scheduling of tasks with deadlines and resource requirements,” IEEE Trans. Comput., pp. 1110–1123, Aug. 1989.
7. K. M. Baumgartner, R. M. Kling, and B. W. Wah, “Implementation of GAMMON: An efficient load balancing strategy for a local computer system,” in Proc. 1989 Int. Conf. Parallel Processing, vol. 2, Aug. 1989, pp. 77–80.
8. F. C. H. Lin and R. M. Keller, “The gradient model load balancing method,” IEEE Tran. Software Eng., vol. 13, no. 1, pp. 32–38, Jan. 1987.
9. L. V. Kale “Comparing the performance of two dynamic load distribution methods,” in Proc. 1988 Int. Conf. Parallel Processing, Aug. 1988, pp. 8–12.
10. J. Hong, X. Tan, and M. Chen, “From local to global: An analysis of nearest neighbor balancing on hypercube,” in Proc. Third Conf Hypercube Concurrent Comput. and Appl., Jan. 1988.
11. K. G. Shin and Y.-C. Chang, “Load sharing in distributed real-time systems with state-change broadcasts,” IEEE Trans. Comput., pp. 1124–1142, Aug. 1989.
12. V. A. Saletore, “A distrubuted and adaptive dynamic load balancing scheme for parallel processing of medium-grain tasks,” in Proc. Fifth Distributed Memory Comput. Conf, Apr. 1990, pp. 995–999.
13. W. Shu and L. V. Kale, “A dynamic scheduling strategy for the Chare-kernel system,” in Proc. ACM Supercomput. Conf. 1989, pp. 389–398.
14. M. Willebeek-LeMair and A. P. Reeves, “A general dynamic load balancing model for parallel computers,” Tech. Rep. EE-CEG-89-1, Cornell School of Electrical Engineering, 1989.
15. G. Cybenko, “Dynamic load balancing for distributed memory multiprocessors,” J. Parallel and Distributed Comput., vol. 7:279-301, October, 1989.
16. D. P. Bertsekas and J. N. Tsitsiklis, Parallel and Distributed Computation: Numerical Methods. Englewood Cliffs, NJ: Prentice-Hall, 1989.
17. K. M. Dragon and J. L. Gustafson, “A low-cost hypercube load balance algorithm,” in Proc. Fourth Conf Hypercubes, Concurrent Comput. and Appl., 1989, pp. 583–590.
18. M. Hailperin, “Load balancing for massivelly-parallel soft-real-time systems,” in Proc. 2nd Symp. Frontiers of Massively Parallel Computation, 1988, pp. 159–163.
19. D. E. Eager, E. D. Lazowska, and J. Zahorjan, “A comparison of receiver-initiated and sender-initiated adaptive load sharing,” Perform. Eval., vol. 6, pp. 53–68, 1986, North-Holland.
20. R. P. Pargas and E. D. Wooster, “Branch-and-bound algorithms on a hypercube,” in Proc. Third Conf. Hypercube Concurrent Comput. and Appl., Jan. 1988.
21. V. N. Rao and V. Kumar “Parallel depth first search. Part I. Implementation,” Int. J. Parallel Programming, vol. 16, no. 6, 1987.
22. V. N. Rao and V. Kumar, “Parallel depth first search. Part II. Analysis,” Int. J. Parallel Programming, vol. 16, no. 6, 1987.