Improving load balance with flexibly assignable tasks

IEEE Transactions on Parallel and Distributed Systems

Volumn 16, Issue 10, 2005, Pages 956-965

  Pinar, Ali ^a   Hendrickson, Bruce ^b  

^a LAWRENCE BERKELEY NATIONAL LABORATORY   (United States)

^b SANDIA NATIONAL LABORATORIES   (United States)

Author keywords

Constrained least squares; Flexibly assignable tasks; Load balancing; Maximum flow; Parallel computing

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; COMPUTER SIMULATION; DATA STRUCTURES; OPTIMIZATION; THEOREM PROVING;

CONSTRAINED LEAST SQUARES; FLEXIBLY ASSIGNABLE TASKS; LOAD BALANCING; MAXIMUM FLOW;

PARALLEL PROCESSING SYSTEMS;

EID: 27444432341     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPDS.2005.123     Document Type: Article

References (17)

1. L. Kalé, M. Bhandarkar, and R. Brunner, "Load Balancing in Parallel Molecular Dynamics," Proc. Fifth Int'l Symp. Solving Irregularly Structured Problems in Parallel, 1998.
2. S. Plimpton, "Fast Parallel Algorithms for Short-Range Molecular Dynamics," J. Computational Physics, vol. 117, pp. 1-19, 1995.
3. A. Pinar and B. Hendrickson, "Partitioning for Complex Objectives," Proc. Int'l Parallel and Distributed Processing Symp., 2001.
4. B. Smith, P. Bjørstad, and W. Gropp, Domain Decomposition: Parallel Multilevel Methods for Elliptic Partial Differential Equations. Cambridge Univ. Press, 1996.
5. G. Cybenko, "Dynamic Load Balancing for Distributed Memory Multiprocessors," J. Parallel Distributed Computing, vol. 7, pp. 279-301, 1989.
6. B. Hendrickson and T. Kolda, "Graph Partitioning Models for Parallel Computing," Parallel Computing, vol. 26, pp. 1519-1534, 2000.
7. R.L. Carino and I. Banicescu, "Load Balancing Parallel Loops on Message-Passing Systems," Proc. 14th IASTED Int'l Conf. Parallel and Distributed Computing and Systems, pp. 362-367, 2002.
8. T.H. Cormen, C.E. Leiserson, and R.L. Rivest, Introduction to Algorithms. Cambridge, Mass.: MIT Press and McGraw-Hill, 1990.
9. R.E. Tarjan, Data Structures and Network Algorithms. SIAM, 1983.
10. A.V. Goldberg and S. Rao, "Beyond the Flow Decomposition Barrier," J. ACM, vol. 45, pp. 783-797, 1998.
11. V. Ramachandran, "The Complexity of Minimum Cut and Maximum Flow Problems m an Acyclic Network," Networks, vol. 17, pp. 387-392, 1987.
12. R. Diekmann, A. Frommer, and B. Monien, "Efficient Schemes for Nearest Neighbor Load Balancing," Parallel Computing, pp. 789-812, 1999.
13. R. Elsässer, B. Monien, and R. Preis, "Diffusive Load Balancing Schemes on Heterogeneous Networks," Proc. 12th ACM Symp. Parallel Algorithms Architecture (SPAA), pp. 30-38, 2000.
14. Å. Björck, Numerical Methods for Least Squares Problems. SIAM, 1996.
15. C. Cryer, "The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation," SIAM J. Control and Optimization, vol. 9, pp. 385-392, 1971.
16. A. Dax, "Bounded Least Squares Problem," ACM Trans. Math. Software, 1991.
17. L. Silbert, D. Ertas, G. Grest, T. Halsey, D. Levine, and S.J. Plimpton, "Granular Flow Down an Inclined Plane: Bagnold Scaling and Rheology," Physica Rev. E, vol. 64, p. 51302, 2001.