Locality-preserving dynamic load balancing for data-parallel applications on distributed-memory multiprocessors

Journal of Information Science and Engineering

Volumn 18, Issue 6, 2002, Pages 1037-1048

  Liu, Pangfeng ^a   Wu, Jan Jan ^a   Yang, Chih Hsuae ^a  

^a INSTITUTE OF INFORMATION SCIENCE   (Taiwan)

Author keywords

Data locality; Data parallel computation; Load balancing; MPI; Work stealing

Indexed keywords

COMPUTATIONAL METHODS; DATA HANDLING; PARALLEL ALGORITHMS; PARALLEL PROCESSING SYSTEMS; REQUIREMENTS ENGINEERING; SCHEDULING; TIME SHARING SYSTEMS;

DATA LOCALITY; DATA PARALLEL COMPUTATION; DISTRIBUTED MEMORY MULTIPROCESSORS; DYNAMIC LOAD BALANCING; DYNAMIC SCHEDULING; STATIC SCHEDULING;

DATA REDUCTION;

EID: 0036852982     PISSN: 10162364     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (15)

1. D. C. Rudolph and C. D. Polychronopoulos, "An efficient message-passing scheduler based on guided self-scheduling," ACM International Conference on Supercomputing, 1989, pp. 50-61.
2. J. Liu, V. A. Saletore, and T. G. Lewis, "Scheduling parallel loops with variable length iteration execution times on parallel computers," in Proceedings of 5th IASTED-ISMM International Conference on Parallel and Distributed Computing and Systems, 1992, pp. 83-89.
3. V. A. Saletore, J. Liu, and B. Y. Lam, "Scheduling non-uniform parallel loops on distributed memory machines," IEEE International Conference on System Sciences, 1993, pp. 516-525.
4. J. Liu and V. A. Saletore, "Self-scheduling on distributed-memory machines," IEEE Supercomputing Conference, 1993, pp. 814-823.
5. O. Plata and F. Rivera, "Combining static and dynamic scheduling on distributed-memory multiprocessors," in the 1994 ACM International Conference on Supercomputing, 1995, pp. 186-195.
6. M. Hamdi and C.-K. Lee, "Dynamic load balancing of data parallel applications on a distributed network," ACM International Conference on Supercomputing, 1995, pp. 170-179.
7. T. Y. Lee, C. S. Raghavendra, and H. Sivaraman, "A practical scheduling scheme for non-uniform parallel loops on distributed-memory parallel computers," in Proceedings of Hawaii International Conference on System Sciences-29, 1996, pp. 243-250.
8. D. K. Lowenthal and G. R. Andrews, "Adaptive data placement for distributed-memory machines," Internationl Parallel Processing Symposium (IPPS96), 1996, pp. 349-353.
9. S. Orlando and R. Perego, "A support for non-uniform parallel loops and its application to a Flame simulation code," Irregular '97, 1997, pp. 186-197.
10. D. M. Nicol and P. F. Reynolds, "Optimal dynamic remapping of data parallel computations," IEEE Transactions on Computers, Vol. 39, 1990, pp. 206-219.
11. A. N. Choudhary, B. Narahari, and R. Krishnamurti, "An efficient heuristic scheme for dynamic remapping of parallel computations," Parallel Computing, Vol. 19, 1993, pp. 621-632.
12. N. Nedeljkovic and M. J. Quinn, "Data-parallel programming on a network of heterogeneous workstations," International Symposium in High Performance Distributed Computing, 1992, pp. 28-36.
13. F. Feschet, S. Miguet, and L. Perroton, "Parlist: A parallel data structure for dynamic load balancing," Journal of Parallel and Distributed Computing, Vol. 51, 1998, pp. 114-135.
14. R. Blumofe and C. Leiserson, "Scheduling multithreaded computations by work stealing," in Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994, pp. 356-368.
15. Supercomputing Technologies Group, MIT Laboratory for Computer Science, Cilk 5.2 Reference Manual, 1998.