Hypergraph partitioning for multiple communication cost metrics: Model and methods

Journal of Parallel and Distributed Computing

Volumn 77, Issue , 2015, Pages 69-83

  Deveci, Mehmet ^a,c   Kaya, Kamer ^b,c   Uҫar, Bora ^d   C¸atalyürek, Ümit V ^a,c  

^a The Ohio State University   (United States)

^b SABANCI UNIVERSITY   (Turkey)

^c OHIO STATE UNIVERSITY   (United States)

^d CNRS   (France)

Author keywords

Graph; Hypergraph; Load balancing; Partitioning

Indexed keywords

GRAPH THEORY;

COMMUNICATION COST; COMMUNICATION OVERHEADS; COST METRICS; GRAPH; HYPER GRAPH; HYPERGRAPH PARTITIONING; LOAD-BALANCING; METRIC MODEL; MULTI OBJECTIVE; PARTITIONING;

COST REDUCTION;

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

References (36)

1. C.J. Alpert, and A.B. Kahng Recent directions in netlist partitioning: a survey VLSI J. 19 1-2 1995 1 81
2. C. Aykanat, B.B. Cambazoglu, and B. Uc¸ar Multi-level direct k-way hypergraph partitioning with multiple constraints and fixed vertices J. Parallel Distrib. Comput. 68 5 2008 609 625
3. S.T. Barnhard, and H.D. Simon Fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems Concurrency, Pract. Exp. 6 2 1994 67 95
4. R.H. Bisseling, Parallel Scientific Computation: A Structured Approach Using BSP and MPI, Oxford, 2004.
5. R.H. Bisseling, and B.O. Fagginger Auer Abusing a hypergraph partitioner for unweighted graph partitioning D.A. Bader, H. Meyerhenke, P. Sanders, D. Wagner, 10th DIMACS Implementation Challenge Workshop: Graph Partitioning and Graph Clustering, 2012 Published in Contemporary Mathematics vol. 588 2013 19 36
6. R.H. Bisseling, and W. Meesen Communication balancing in parallel sparse matrix-vector multiplication Electron. Trans. Numer. Anal. 21 2005 47 65
7. T.N. Bui, and C. Jones A heuristic for reducing fill-in sparse matrix factorization Proc. 6th SIAM Conf. Parallel Processing for Scientific Computing 1993 SIAM 445 452
8. Ü.V. C¸atalyürek, and C. Aykanat Hypergraph-partitioning based decomposition for parallel sparse-matrix vector multiplication IEEE Trans. Parallel Distrib. Syst. 10 7 1999 673 693
9. Ü.V. C¸atalyürek, C. Aykanat, PaToH: a multilevel hypergraph partitioning tool, Version 3.0, Bilkent University, Department of Computer Engineering, Ankara, 06533 Turkey. PaToH is available at: http://bmi.osu.edu/~umit/software.htm, 1999.
10. Ü.V. C¸atalyürek, C. Aykanat, A fine-grain hypergraph model for 2D decomposition of sparse matrices, in: Proceedings of 15th International Parallel and Distributed Processing Symposium, IPDPS, San Francisco, CA, 2001.
11. Ü.V. C¸atalyürek, C. Aykanat, A hypergraph-partitioning approach for coarse-grain decomposition, in: ACM/IEEE SC2001, Denver, CO, 2001.
12. Ü.V. C¸atalyürek, C. Aykanat, and B. Uc¸ar On two-dimensional sparse matrix partitioning: models, methods, and a recipe SIAM J. Sci. Comput. 32 2 2010 656 683
13. Ü.V. C¸atalyürek, M. Deveci, K. Kaya, and B. Uc¸ar UMPa: a multi-objective, multi-level partitioner for communication minimization D.A. Bader, H. Meyerhenke, P. Sanders, D. Wagner (Eds.), 10th DIMACS Implementation Challenge Workshop: Graph Partitioning and Graph Clustering, 2012 Published in Contemporary Mathematics vol. 588 2013 53 66
14. T. Condie, N. Conway, P. Alvaro, J.M. Hellerstein, K. Elmeleegy, and R. Sears MapReduce Online, NSDI 2010 313 328
15. J. Dean, and S. Ghemawat MapReduce: simplified data processing on large clusters Commun. ACM 51 1 2008 107 113
16. K. Devine, E. Boman, R. Heaphy, R. Bisseling, and Ü.V. C¸atalyürek Parallel hypergraph partitioning for scientific computing Proceedings of 20th International Parallel and Distributed Processing Symposium (IPDPS) 2006 IEEE
17. 10th DIMACS Implementation Challenge: Graph Partitioning and Graph Clustering, 2011. http://www.cc.gatech.edu/dimacs10/.
18. J. Ekanayake, H. Li, B. Zhang, T. Gunarathne, S.-H. Bae, J. Qiu, G. Fox, Twister: a runtime for iterative MapReduce, in: The First International Workshop on MapReduce and its Applications, MAPREDUCE'10 - HPDC2010, 2010, pp. 810-818.
19. 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 2 1999 173 195
20. C.M. Fiduccia, R.M. Mattheyses, A linear-time heuristic for improving network partitions, in: Proc. 19th Design Automation Conference, 1982, pp. 175-181.
21. G. Gallo, G. Longo, S. Pallottino, and S. Nguyen Directed hypergraphs and applications Discrete Appl. Math. 42 2-3 1993 177 201
22. B. Hendrickson, and T.G. Kolda Graph partitioning models for parallel computing Parallel Comput. 26 2000 1519 1534
23. B. Hendrickson, and R. Leland A multilevel algorithm for partitioning graphs Proc. Supercomputing 1995 ACM New York, NY, USA 28
24. B. Hendrickson, and R. Leland An improved spectral graph partitioning algorithm for mapping parallel computations SIAM J. Sci. Comput. 16 2 1995 452 469
25. B.W. Kernighan, and S. Lin An efficient heuristic procedure for partitioning graphs Bell Syst. Tech. J. 49 2 1970 291 307
26. Y.-K. Kwok, and I. Ahmad Static scheduling algorithms for allocating directed task graphs to multiprocessors ACM Comput. Surv. 31 4 1999 406 471
27. T. Lengauer Combinatorial Algorithms for Integrated Circuit Layout 1990 Wiley-Teubner Chichester, UK
28. D.M. Pelt, R.H. Bisseling, A medium-grain method for fast 2D bipartitioning of sparse matrices, in: 28th IEEE International Parallel and Distributed Processing Symposium, 2014.
29. M. Ravishankar, J. Eisenlohr, L.-N. Pouchet, J. Ramanujam, A. Rountev, P. Sadayappan, Code generation for parallel execution of a class of irregular loops on distributed memory systems, in: Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis, SC'12, 2012, pp. 72:1-72:11.
30. A. Trifunovic, and W. Knottenbelt Parkway 2.0: a parallel multilevel hypergraph partitioning tool Proc. ISCIS LNCS vol. 3280 2004 Springer Berlin, Heidelberg 789 800
31. B. Uc¸ar, and C. Aykanat Minimizing communication cost in fine-grain partitioning of sparse matrices A. Yazici, C. Şener, Computer and Information Sciences - ISCIS 2003 Lecture Notes in Computer Science vol. 2869 2003 Springer Berlin, Heidelberg 926 933
32. B. Uc¸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 1837 1859
33. B. Uc¸ar, and C. Aykanat Revisiting hypergraph models for sparse matrix partitioning SIAM Rev. 49 4 2007 595 603
34. L. Valiant A bridging model for parallel computation Commun. ACM 33 8 1990 103 111
35. B. Vastenhouw, and R.H. Bisseling A two-dimensional data distribution method for parallel sparse matrix-vector multiplication SIAM Rev. 47 1 2005 67 95
36. C. Walshaw, M.G. Everett, and M. Cross Parallel dynamic graph partitioning for adaptive unstructured meshes J. Parallel Distrib. Comput. 47 1997 102 108