ON two-dimensional sparse matrix partitioning: Models, methods, and a recipe

SIAM Journal on Scientific Computing

Volumn 32, Issue 2, 2010, Pages 656-683

  Catalyürek, Umit V ^a   Aykanat, Cevdet ^b   Ucar, Abora ^c  

^a OHIO STATE UNIVERSITY   (United States)

^b BILKENT UNIVERSITY   (Turkey)

^c UNIVERSITÉ DE LYON   (France)

Author keywords

Combinatorial scientific computing; Hypergraph partitioning; Parallel matrix vector multiplication; Sparse matrix partitioning; Two dimensional partitioning

Indexed keywords

GRAPH THEORY;

COMBINATORIAL SCIENTIFIC COMPUTING; HYPERGRAPH PARTITIONING; MATRIX PARTITIONING; MATRIX VECTOR MULTIPLICATION; PARALLEL MATRIX-VECTOR MULTIPLICATION; PARTITIONING METHODS; SPARSE MATRICES; SPARSE MATRIX PARTITIONING; TWO-DIMENSIONAL; TWO-DIMENSIONAL PARTITIONING;

MATRIX ALGEBRA;

EID: 77950793269     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/080737770     Document Type: Article

References (51)

1. C. AYKANAT, B. B. CAMBAZOGLU, AND B. UÇAR, Multi-level direct k-way hypergraph partitioning with multiple constraints and fixed vertices, J. Parallel Distrib. Comput., 68 (2008), pp. 609-625. (Pubitemid 351458634)
2. M. D. BEYNON, T. KURC, U. CATALYUREK, C. CHANG, A. SUSSMAN, AND J. SALTZ, Distributed processing of very large datasets with DataCutter, Parallel Comput., 27 (2001), pp. 1457- 1478. (Pubitemid 32723674)
3. R. H. BISSELING AND W. MEESEN, Communication balancing in parallel sparse matrix-vector multiplication, Electron. Trans. Numer. Anal., 21 (2005), pp. 47 - 65. (Pubitemid 43152783)
4. T. BULTAN AND C. AYKANAT, A new mapping heuristic based on mean field annealing,J. Parallel Distrib. Comput., 16 (1992), pp. 292-305.
5. W. CAMP, S. J. PLIMPTON, B. HENDRICKSON, AND R. W. LELAND, Massively parallel methods for engineering and science problems, Commun. ACM, 37 (1994), pp. 31-41.
6. U. V. CATALYUREK, E. G. BOMAN, K. D. DEVINE, D. BOZDAG, R. HEAPHY, AND L. A. FISK, Hypergraph-based dynamic load balancing for adaptive scientific computations, in Proceedings of the 21st International Parallel and Distributed Processing Symposium (IPDPS), 2007, IEEE. (Pubitemid 47428385)
7. U. V. CATALYUREK, Hypergraph Models for Sparse Matrix Partitioning and Reordering,Ph.D. thesis, Bilkent University, Computer Engineering and Information Science, Ankara, Turkey, 1999,http://www.cs.bilkent.edu.tr/tech- reports/1999/ABSTRACTS.1999.html.
8. U. V. CATALYUREK AND C. AYKANAT, Decomposing irregularly sparse matrices for parallel matrix-vector multiplications, in Proceedings of the 3rd International Symposium on Solving Irregularly Structured Problems in Parallel, Irregular'96, Lecture Notes in Comput. Sci. 1117, Springer-Verlag, New York, 1996, pp. 75-86. (Pubitemid 126107937)
9. U. V. CATALYUREK AND C. AYKANAT, Hypergraph-partitioning based decomposition for parallel sparse-matrix vector multiplication, IEEE Trans. Parallel Distrib. Syst., 10 (1999), pp. 673-693. (Pubitemid 30500688)
10. U. V. CATALYUREK AND C. AYKANAT, PaToH: A Multilevel Hypergraph Partitioning Tool, Version 3.0, Bilkent University, Department of Computer Engineering, Ankara, Turkey, 1999. PaToH is available at http://bmi.osu.edu/ ~umit/software.htm.
11. U. V. CATALYUREK 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, 2001.
12. U. V. ÇATALYÜREK AND C. AYKANAT, A hypergraph-partitioning approach for coarse-grain decomposition, in ACM/IEEE SC2001, Denver, CO, 2001.
13. C. CHANG, T. KURC, A. SUSSMAN, U. V. ÇATALYÜREK, AND J. SALTZ, A hypergraph-based workload partitioning strategy for parallel data aggregation, in Proceedings of the Eleventh SIAM Conference on Parallel Processing for Scientific Computing, SIAM, 2001.
14. T. H. CORMEN, C. E. LEISERSON, AND R. L. RIVEST, Introduction to Algorithms, MIT Press, McGraw-Hill, New York, 1990.
15. T. DAVIS, The University of Florida Sparse Matrix Collection, Technical report REP-2007-298, CISE Department, University of Florida, Gainesville, FL, 2007.
16. J. DEAN AND S. GHEMAWAT, Mapreduce: Simplified data processing on large clusters, Commun. ACM, 51 (2008), pp. 107-113.
17. E. D. DOLAN AND J. J. MORE, Benchmarking optimization software with performance profiles,Math. Program., 91 (2002), pp. 201-213.
18. R. FERREIRA, T. KURC, M. BEYNON, C. CHANG, A. SUSSMAN, AND J. SALTZ, Object-relational queries into multi-dimensional databases with the active data repository, Parallel Process. Lett., 9 (1999), pp. 173-195. (Pubitemid 30511227)
19. B. HENDRICKSON, Graph Partitioning and Parallel Solvers: Has the Emperor No Clothes?, Lecture Notes in Comput. Sci. 1457, Springer-Verlag, New York, 1998, pp. 218-225. (Pubitemid 128115488)
20. B. HENDRICKSON AND T. G. KOLDA, Graph partitioning models for parallel computing, Parallel Comput., 26 (2000), pp. 1519-1534.
21. 21] B. HENDRICKSON AND T. G. KOLDA, Partitioning rectangular and structurally unsymmetric sparse matrices for parallel processing, SIAM J. Sci. Comput., 21 (2000), pp. 2048-2072. (Pubitemid 32076056)
22. B. HENDRICKSON, R. LELAND, AND S. PLIMPTON, An efficient parallel algorithm for matrix- vector multiplication, Internat. J. High Speed Comput., 7 (1995), pp. 73-88.
23. B. HENDRICKSON, R. LELAND, AND R. VAN DRIESSCHE, Skewed graph partitioning, in Proceedings of the Eighth SIAM Conference on Parallel Processing for Scientific Computation, 1997.
24. M. JACUNSKI, P. SADAYAPPAN, AND D. K. PANDA, All-to-all broadcast on switch-based clusters of workstations, in Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing, IPPS'99/SPDP'99, Washington, DC, 1999, IEEE Computer Society, pp. 325-329.
25. M. KADDOURA, C. W. OU, AND S. RANKA, Partitioning unstructured computational graphs for nonuniform and adaptive environments, IEEE Parallel Distrib. Technol., 3 (1995), pp. 63-69.
26. G. KARYPIS AND V. KUMAR, A fast and high quality multilevel scheme for partitioning irregular graphs, SIAM J. Sci. Comput., 20 (1998), pp. 359-392. (Pubitemid 128689516)
27. G. KARYPIS AND V. KUMAR, Multilevel Algorithms for Multi-constraint Graph Partitioning, Technical report 98-019, University of Minnesota, Department of Computer Science/Army HPC Research Center, Minneapolis, MN, 1998.
28. G. KARYPIS, V. KUMAR, R. AGGARWAL, AND S. SHEKHAR, hMeTiS: A Hypergraph Partitioning Package Version 1.5.3, University ofMinnesota, Department ofComp. Sci. and Eng., Army HPC Research Center, Minneapolis, 1998.
29. S. KRISHNAMOORTHY, U. CATALYUREK, J. NIEPLOCHA, A. ROUNTEV, AND P. SADAYAPPAN, Hy- pergraph partitioning for automatic memory hierarchy management, in SC'06: Proceedings of the 2006 ACM/IEEE Conference on Supercomputing, 206, Tampa, FL, 98 (in cdrom).
30. V. KUMAR, A. GRAMA, A. GUPTA, AND G. KARYPIS, Introduction to Parallel Computing: Design and Analysis of Algorithms, Benjamin/Cummings, Redwood City, CA, 1994.
31. H. KUTLUCA, T. M. KURC, AND C. AYKANAT, Image-space decomposition algorithms for sort- first parallel volume rendering of unstructured grids, J. Supercomputing, 15 (2001), pp. 51-93. (Pubitemid 30542298)
32. V. LAKAMSANI, L. N. BHUYAN, AND D. S. LINTHICUM, Mapping molecular dynamics computations on to hypercubes, Parallel Comput., 21 (1995), pp. 993-1013
33. T. LENGAUER, Combinatorial Algorithms for Integrated Circuit Layout, Willey-Teubner, Chichester, U.K., 1990.
34. 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, IEEE, Knoxville, TN, pp. 542-550.
35. J. G. LEWIS AND R. A. VAN DE GEIJN, Distributed memory matrix-vector multiplication and conjugate gradient algorithms, in Proceedings of Supercomputing'93, Portland, OR, 1993, pp. 484-492.
36. F. MANNE AND T. S0REVIK, Partitioning an array onto a mesh of processors, in PARA '96: Proceedings of the Third International Workshop on Applied Parallel Computing, Industrial Computation and Optimization, London, UK, 1996, also in Applied Parallel Computing Industrial Computation and Optimization, Lecture Notes in Comput. Sci, 1184, Springer-Verlag, New York, 1996, pp. 467-477. (Pubitemid 127013643)
37. O. C. MARTIN AND S. W. OTTO, Partitioning of unstructured meshes for load balancing, Concurrency: Practice and Experience, 7 (1995), pp. 303-314.
38. D. M. NICOL, Rectilinear partitioning of irregular data parallel computations, J. Parallel Distrib. Comput., 23 (1994), pp. 119-134.
39. A. T. OGIELSKI AND W. AlELLO, Sparse matrix computations on parallel processor arrays, SIAM J. Sci. Comput., 14 (1993), pp. 519-530.
40. A. PlNAR AND C. AYKANAT, Fast optimal load balancing algorithms for 1D partitioning,J. Parallel Distrib. Comput., 64 (2004), pp. 974-996. (Pubitemid 40000768)
41. L. F. ROMERO AND E. L. ZAPATA, Data distributions for sparse matrix vector multiplication,Parallel Comput., 21 (1995), pp. 583-605.
42. J. H. SALTZ, S. G. PETITION, H. BERRYMAN, AND A. RlFKIN, Performance effects of irregular communication patterns on massively parallel multiprocessors, J. Parallel Distrib. Comput., 13 (1991), pp. 202-212. (Pubitemid 21710567)
43. K. SCHLOEGEL, G. KARYPIS, AND V. KUMAR, A New Algorithm for Multi-objective Graph Partitioning, Technical report 99-003, University of Minnesota, Department of Computer Science/Army HPC Research Center, Minneapolis, MN, 1999.
44. K. SCHLOEGEL, G. KARYPIS, AND V. KUMAR, Parallel multilevel algorithms for multi-constraint graph partitioning, in Proceedings of the Euro-Par 2000 Parallel Processing, Munich, Germany, Lecture Notes in Comput. Sci. 1900, Springer-Verlag, New York, 2000, pp. 296-300.
45. B. UÇAR, Heuristics for a matrix symmetrization problem, in PPAM 2007, Lecture Notes in Comput. Sci. 4967, Springer-Verlag, New York, 2008, pp. 717-727.
46. B. UÇAR AND C. AYKANAT, Minimizing communication cost in fine-grain partitioning of sparse matrices, in ISCIS 2003, Lecture Notes in Comput. Sci. 2869, Springer-Verlag, New York, 2003, pp. 926-933. (Pubitemid 37331739)
47. B. UÇAR AND C. AYKANAT, A Library for Parallel Sparse Matrix-vector Multiplies, Technical report BU-CE-0506, Department of Computer Engineering, Bilkent University, Ankara, Turkey, 2005.
48. B. UÇAR AND C. AYKANAT, Partitioning sparse matrices for parallel preconditioned iterative methods, SIAM J. Sci. Comput., 29 (2007), pp. 1683-1709
49. B. UÇAR AND C. AYKANAT, Revisiting hypergraph models for sparse matrix partitioning,SIAM Rev., 49 (2007), pp. 595-603. (Pubitemid 350263544)
50. B. UÇAR, U. V. CATALYUREK, AND C. AYKANAT, A matrix partitioning interface to PaToH in MATLAB, Parallel Comput., to appear
51. 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. (Pubitemid 40535972)