
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Ali Pinar, Bruce Hendrickson, "Improving Load Balance with Flexibly Assignable Tasks," IEEE Transactions on Parallel and Distributed Systems, vol. 16, no. 10, pp. 956965, October, 2005.  
BibTex  x  
@article{ 10.1109/TPDS.2005.123, author = {Ali Pinar and Bruce Hendrickson}, title = {Improving Load Balance with Flexibly Assignable Tasks}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {16}, number = {10}, issn = {10459219}, year = {2005}, pages = {956965}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2005.123}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  Improving Load Balance with Flexibly Assignable Tasks IS  10 SN  10459219 SP956 EP965 EPD  956965 A1  Ali Pinar, A1  Bruce Hendrickson, PY  2005 KW  Parallel computing KW  load balancing KW  flexibly assignable tasks KW  maximum flow KW  constrained least squares. VL  16 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Abstract—In many applications of parallel computing, distribution of the data unambiguously implies distribution of work among processors. But, there are exceptions where some tasks can be assigned to one of several processors without altering the total volume of communication. In this paper, we study the problem of exploiting this flexibility in assignment of tasks to improve load balance. We first model the problem in terms of network flow and use combinatorial techniques for its solution. Our parametric search algorithms use maximum flow algorithms for probing on a candidate optimal solution value. We describe two algorithms to solve the assignment problem with
[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 ShortRange Molecular Dynamics,” J. Computational Physics, vol. 117, pp. 119, 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. 279301, 1989.
[6] B. Hendrickson and T. Kolda, “Graph Partitioning Models for Parallel Computing,” Parallel Computing, vol. 26, pp. 15191534, 2000.
[7] R.L. Carino and I. Banicescu, “Load Balancing Parallel Loops on MessagePassing Systems,” Proc. 14th IASTED Int'l Conf. Parallel and Distributed Computing and Systems, pp. 362367, 2002.
[8] T.H. Cormen, C.E. Leiserson, and R.L. Rivest, Introduction to Algorithms. Cambridge, Mass.: MIT Press and McGrawHill, 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. 783797, 1998.
[11] V. Ramachandran, “The Complexity of Minimum Cut and Maximum Flow Problems in an Acyclic Network,” Networks, vol. 17, pp. 387392, 1987.
[12] R. Diekmann, A. Frommer, and B. Monien, “Efficient Schemes for Nearest Neighbor Load Balancing,” Parallel Computing, pp. 789812, 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. 3038, 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. 385392, 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.