Revisiting hypergraph models for sparse matrix partitioning

SIAM Review

Volumn 49, Issue 4, 2007, Pages 595-603

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

^a EMORY UNIVERSITY   (United States)

^b BILKENT UNIVERSITY   (Turkey)

Author keywords

Hypergraph models; Parallel computing; Sparse matrix vector multiply

Indexed keywords

COMPUTER SIMULATION; MATHEMATICAL MODELS; MATRIX ALGEBRA; VECTORS;

HYPERGRAPH MODELS; SPARSE MATRIX-VECTOR MULTIPLY;

PARALLEL PROCESSING SYSTEMS;

EID: 37249078616     PISSN: 00361445     EISSN: None     Source Type: Journal    
DOI: 10.1137/060662459     Document Type: Article

References (13)

1. C. AYKANAT, A. PINAR, AND Ü. V. ÇATALYÜREK, Permuting sparse rectangular matrices into block-diagonal form, SIAM J. Sci. Comput., 25 (2004), pp. 1860-1879.
2. R. H. BISSELING AND W. MEESEN, Communication balancing in parallel sparse matrix-vector multiplication, Electron. Trans. Numer. Anal., 21 (2005), pp. 47-65.
3. Ü. V. ÇATALYÜREK AND C. AYKANAT, Decomposing irregularly sparse matrices for parallel matrix-vector multiplications, in Proceedings of Parallel Algorithms for Irregularly Structured Problems, Santa Barbara, CA, 1996, Lecture Notes in Comput. Sci. 1117, Springer, Berlin, 1996, pp. 75-86.
4. Ü. V. ÇATALYÜREK AND C. AYKANAT, Hypergraph-partitioning-based decomposition for parallel sparse-matrix vector multiplication, IEEE Trans. Parallel Distrib. Systems, 10 (1999), pp. 673-693.
5. Ü. V. ÇATALYÜREK AND C. AYKANAT, PaToH: A Multilevel Hypergraph Partitioning Tool, Version 3.0, Tech. Rep. BU-CE-9915, Computer Engineering Department, Bilkent University, Ankara, Turkey, 1999.
6. Ü. V. ÇATALYÜREK AND C. AYKANAT, A fine-grain hypergraph model for 2D decomposition of sparse matrices, in Proceedings of the 15th International Parallel and Distributed Processing Symposium (IPDPS), San Francisco, CA, CD-ROM, IEEE, 2001.
7. B. HENDRICKSON AND T. G. KOLDA, Graph partitioning models for parallel computing, Parallel Comput., 26 (2000), pp. 1519-1534.
8. T. LENGAUER, Combinatorial Algorithms for Integrated Circuit Layout, Wiley-Teubner, Chichester, UK, 1990.
9. A. PINAR, Ü. V. ÇATALYÜREK, C. AYKANAT, AND M. PINAR, Decomposing linear programs for parallel solution, in Proceedings of the Second International Workshop on Applied Parallel Computing, PARA'95 Lyngby, Denmark, 1995, Lecture Notes in Comput. Sci. 1041, Springer, Berlin, 1996, pp. 473-482.
10. B. UÇAR AND C. AYKANAT, Minimizing communication cost in fine-grain partitioning of sparse matrices, in Proceedings of ISCIS-2003, Antalya, Turkey, 2003, Lecture Notes in Comput. Sci. 2869, Springer, Berlin, 2003, pp. 926-933.
11. B. UÇAR AND C. AYKANAT, Encapsulating multiple communication-cost metrics in partitioning sparse rectangular matrices for parallel matrix-vector multiplies, SIAM J. Sci. Comput., 25 (2004), pp. 1837-1859.
12. B. UÇAR AND C. AYKANAT, Partitioning sparse matrices for parallel preconditioned iterative methods, SIAM J. Sci. Comput., 29 (2007), pp. 1683-1709.
13. B. VASTENHOUW AND R. H. BISSELING, A two-dimensional data distribution method for parallel sparse matrix-vector multiplication, SIAM Rev., 47 (2005), pp. 67-95.