Minimizing communication cost in fine-grain partitioning of sparse matrices

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2869, Issue , 2003, Pages 926-933

  Uçar, Bora ^a   Aykanat, Cevdet ^a  

^a BILKENT UNIVERSITY   (Turkey)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

COMMUNICATION COST; COMPUTATIONAL LOADS; FINE GRAINS; HYPERGRAPH; PARALLEL PROCESSING; PC CLUSTERS; SECOND PHASE; SPARSE MATRICES;

ARTIFICIAL INTELLIGENCE;

EID: 0142183956     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39737-3_115     Document Type: Article

References (17)

1. Charles J. Alpert, Andrew E. Caldwell, Andrew B. Kahng, and Igor L. Markov. Hypergraph partitioning with fixed vertices. IEEE Transactions on Computer-Aided Design, 19(2):267-272, 2000.
2. Greg Burns, Raja Daoud, and James Vaigl. LAM: an open cluster environment for MPI. In John W. Ross, editor, Proceedings of Supercomputing Symposium '94, pages 379-386. University of Toronto, 1994.
3. Ü. V. Çatalyürek. Hypergraph Models for Sparse Matrix Partitioning and Reordering. PhD thesis, Bilkent Univ., Computer Eng. and Information Sci., Nov 1999.
4. Ü. V. Çatalyürek and C. Aykanat. Hypergraph-partitioning based decomposition for parallel sparse-matrix vector multiplication. IEEE Transactions on Parallel and Distributed Systems, 10(7):673-693, 1999.
5. Ü. V. Çatalyürek and C. Aykanat. PaToH: A multilevel hypergraph partitioning tool, ver. 3.0. Tech. Rep. BU-CE-9915, Computer Eng. Dept., Bilkent Univ., 1999.
6. Ü. V. Çatalyürek and Cevdet Aykanat. A fine-grain hypergraph model for 2d decomposition of sparse matrices. In Proceedings of International Parallel and Distributed Processing Symposium (IPDPS), 8th International Workshop on Solving Irregularly structured Problems in Parallel (Irregular 2001), April 2001.
7. Ü. V. Çatalyürek and Cevdet Aykanat. A hypergraph-partitioning approach for coarse-grain decomposition. In Proceedings of Scientific Computing 2001 (SC2001), pages 10-16, Denver, Colorado, November 2001.
8. J. J. Dongarra and T. H. Dunigan. Message-passing performance of various computers. Concurrency - Practice and Experience, 9(10):915-926, 1997.
9. B. Hendrickson. Graph partitioning and parallel solvers: has the emperor no clothes? Lecture Notes in Computer Science, 1457:218-225, 1998.
10. B. Hendrickson and T. G. Kolda. Graph partitioning models for parallel computing. Parallel Computing, 26:1519-1534, 2000.
11. B. Hendrickson and T. G. Kolda. Partitioning rectangular and structurally unsymmetric sparse matrices for parallel processing. SIAM Journal on Scientific Computing, 21(6):2048-2072, 2000.
12. B. Hendrickson, R. Leland, and S. Plimpton. An efficient parallel algorithm for matrix-vector multiplication. Int. J. High Speed Comput., 7(1):73-88, 1995.
13. G. Karypis and V. Kumar. Multilevel algorithms for multi-constraint hypergraph partitioning. Tech. Rep. 99-034, University of Minnesota, Dept. Computer Science/Army HPC Research Center, Minneapolis, MN 55455, November 1998.
14. T. Lengauer. Combinatorial Algorithms for Integrated Circuit Layout. Wiley-Teubner, Chichester, U.K., 1990.
15. J. G. Lewis, D. G. Payne, and R. A. van de Geijn. Matrix-vector multiplication and conjugate gradient algorithms on distributed memory computers. In Proceedings of the Scalable High Performance Computing Conference, 1994.
16. A. T. Ogielski and W. Aiello. Sparse matrix computations on parallel processor arrays. SIAM Journal on Numerical Analysis, 1993.
17. Bora Uçar and Cevdet Aykanat. Encapsulating multiple communication-cost metrics in partitioning sparse rectangular matrices for parallel matrix-vector multiplies. Siam J. Sci. Comput., Submitted to, 2002.