Fast optimal load balancing algorithms for 1D partitioning

Journal of Parallel and Distributed Computing

Volumn 64, Issue 8, 2004, Pages 974-996

  Pinar, Ali ^a   Aykanat, Cevdet ^b  

^a LAWRENCE BERKELEY NATIONAL LABORATORY   (United States)

^b BILKENT UNIVERSITY   (Turkey)

Author keywords

Chains on chains partitioning; Dynamic programming; Image space parallel volume rendering; Iterative refinement; One dimensional partitioning; Optimal load balancing; Parallel sparse matrix vector multiplication; Parametric search

Indexed keywords

ALGORITHMS; DYNAMIC PROGRAMMING; GRAPH THEORY; HEURISTIC METHODS; MATRIX ALGEBRA; VECTORS;

ONE-DIMENSIONAL PARTITIONING; OPTIMAL LOAD BALANCING; PARALLEL SPARSE MATRIX VECTOR MULTIPLICATION;

PARALLEL PROCESSING SYSTEMS;

EID: 10844240770     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jpdc.2004.05.003     Document Type: Article

References (35)

1. S. Anily, A. Federgruen, Structured partitioning problems, Oper. Res. 13 (1991) 130-149.
2. C. Aykanat, F. Ozguner, Large grain parallel conjugate gradient algorithms on a hypercube multiprocessor in: Proceedings of the 1987 International Conference on Parallel Processing, Penn State University, University Park, PA, 1987, pp. 641-645.
3. C. Aykanat, F. Ozguner, F. Ercal, P. Sadayappan, Iterative algorithms for solution of large sparse systems of linear equations on hypercubes, IEEE Trans. Comput. 37 (12) (1988) 1554-1567.
4. S.H. Bokhari, Partitioning problems in parallel, pipelined, and distributed computing, IEEE Trans. Comput. 37 (1) (1988) 48-57.
5. U.V. Çatalyurek, C. Aykanat, Hypergraph-partitioning-based decomposition for parallel sparse-matrix vector multiplication, IEEE Trans. Parallel Distributed Systems 10 (7) (1999) 673-693.
6. H. Choi, B. Narahari, Algorithms for mapping and partitioning chain structured parallel computations, in: Proceedings of the 1991 International Conference on Parallel Processing, Austin, TX, 1991 pp. I-625-I-628.
7. G.N. Frederickson, Optimal algorithms for partitioning trees and locating p-centers in trees, Technical Report CSD-TR-1029, Purdue University (1990).
8. G.N. Frederickson, Optimal algorithms for partitioning trees in: Proceedings of the Second ACM-SIAM Symposium Discrete Algorithms, Orlando, FL, 1991.
9. M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman, San Fransisco, CA, 1979.
10. M.R. Garey, D.S. Johnson, L. Stockmeyer, Some simplified np-complete graph problems, Theoret. Comput. Sci. 1 (1976) 237-267.
11. D.M. Gay, Electronic mail distribution of linear programming test problems, Mathematical Programming Society COAL Newsletter.
12. Y. Han, B. Narahari, H.-A. Choi, Mapping a chain task to chained processors, Inform. Process. Lett. 44 (1992) 141-148.
13. P. Hansen, K.W. Lih, Improved algorithms for partitioning problems in parallel, pipelined and distributed computing, IEEE Trans. Comput. 41 (6) (1992) 769-771.
14. B. Hendrickson, T. Kolda, Rectangular and structurally non-symmetric sparse matrices for parallel processing, SIAM J. Sci. Comput. 21 (6) (2000) 2048-2072.
15. M.A. Iqbal, Efficient algorithms for partitioning problems, in: Proceedings of the 1990 International Conference on Parallel Processing, Urbana, Champaign, IL, 1990, pp. III-123-127.
16. M.A. Iqbal, Approximate algorithms for partitioning and assignment problems, Int. J. Parallel Programming 20 (5) (1991) 341-361.
17. M.A. Iqbal, S.H. Bokhari, Efficient algorithms for a class of partitioning problems, IEEE Trans. Parallel Distributed Systems 6 (2) (1995) 170-175.
18. M.A. Iqbal, J.H. Saltz, S.H. Bokhari, A comparative analysis of static and dynamic load balancing strategies in: Proceedings of the 1986 International Conference on Parallel Processing, Penn State Univ University Park, PA, 1986, pp. 1040-1047.
19. V. Kumar, A. Grama, A. Gupta, G. Karypis, Introduction to Parallel Computing, Benjamin, Cummings, Redwood City, CA, 1994.
20. H. Kutluca, T.M. Kurç, C. Aykanat, Image-space decomposition algorithms for sort-first parallel volume rendering of unstructured grids, J. Supercomput. 15 (1) (2000) 51-93.
21. T. Lengauer, Combinatorial Algorithms for Integrated Circuit Layout, Wiley, Chichester, UK, 1990.
22. Linear programming problems, Technical Report, IOWA Optimization Center, ftp://col.biz.uiowa.edu:pub/testprob/lp/gondzio.
23. F. Manne, T. Sørevik, Optimal partitioning of sequences, J. Algorithms 19 (1995) 235-249.
24. S. Miguet, J.M. Pierson, Heuristics for 1d rectilinear partitioning as a low cost and high quality answer to dynamic load balancing, Lecture Notes in Computer Science, Vol. 1225, Springer, Berlin, 1997, pp. 550-564.
25. S. Molnar, M. Cox, D. Ellsworth, H. Fuchs, A sorting classification of parallel rendering, IEEE Comput. Grap. Appl. 14 (4) (1994) 23-32.
26. C. Mueller, The sort-first rendering architecture for high-performance graphics, in: Proceedings of the 1995 Symposium on Interactive 3D Graphics, Monterey, CA, 1995, pp. 75-84.
27. D.M. Nicol, Rectilinear partitioning of irregular data parallel computations, J. Parallel Distributed Computing 23 (1994) 119-134.
28. D.M. Nicol, D.R. O'Hallaron, Improved algorithms for mapping pipelined and parallel computations, Technical Report 88-2, ICASE, 1988.
29. D.M. Nicol, D.R. O'Hallaron, Improved algorithms for mapping pipelined and parallel computation, IEEE Trans. Comput. 40 (3) (1991) 295-306.
30. B. Olstad, F. Manne, Efficient partitioning of sequences, IEEE Trans. Comput. 44 (11) (1995) 1322-1326.
31. J.R. Pilkington, S.B. Baden, Dynamic partitioning of non-uniform structured workloads with spacefilling curves, IEEE Trans. Parallel Distributed Systems 7 (3) (1996) 288-299.
32. Y. Saad, Practical use of polynomial preconditionings for the conjugate gradient method, SIAM J. Sci. Statist. Comput. 6 (5) (1985) 865-881.
33. M.U. Ujaldon, E.L. Zapata, B.M. Chapman, H.P. Zima, Vienna-Fortran/hpf extensions for sparse and irregular problems and their compilation, IEEE Trans. Parallel Distributed Systems 8 (10) (1997) 1068-1083.
34. M.U. Ujaldon, E.L. Zapata, S.D. Sharma, J. Saltz, Parallelization techniques for sparse matrix applications, J. Parallel Distributed Computing 38 (1996) 256-266.
35. M.U. Ujaldon, E.L. Zapata, S.D. Sharma, J. Saltz, Experimental evaluation of efficient sparse matrix distributions, in: Proceedings of the ACM International Conference of Supercomputing Philadelphia, PA, (1996) pp. 78-86.