Parallel multilevel algorithms for hypergraph partitioning

Journal of Parallel and Distributed Computing

Volumn 68, Issue 5, 2008, Pages 563-581

  Trifunović, Aleksandar ^a   Knottenbelt, William J ^a  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

Data partitioning; Load balancing; Parallel graph partitioning; Parallel hypergraph partitioning; Parallel sparse matrix vector multiplication; Sparse matrix decomposition; VLSI circuit design

Indexed keywords

ALGORITHMS; ASYMPTOTIC ANALYSIS; GRAPH THEORY; PROBLEM SOLVING; SCALABILITY;

HYPERGRAPH PARTITIONING; PARALLEL COARSENING;

PARALLEL PROCESSING SYSTEMS;

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

References (51)

1. Alpert C.J. The ISPD98 circuit benchmark suite. Proceedings of the International Symposium of Physical Design (April 1998) 80-85
2. Alpert C.J., Huang J.-H., and Kahng A.B. Multilevel circuit partitioning. IEEE Trans. Comput-Aided Design Integrated Circuits 17 8 (1998) 655-666
3. Alpert C.J., and Kahng A.B. Recent directions in netlist partitioning. Integration VLSI J. 19 1-2 (1995) 1-81
4. Aykanat C., Pinar A., and Catalyurek U.V. Permuting sparse rectangular matrices into block-diagonal form. SIAM J. Sci. Comput. 25 6 (2004) 1860-1879
5. Barnard S.T., and Simon H.D. A fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems. Concurrency Practice Experience 6 2 (April 1994) 101-117
6. Berge C. Hypergraphs (1986), North-Holland, Amsterdam
7. Bollobás B. Combinatorics (1986), Cambridge University Press, Cambridge
8. Bradley J.T., Dingle N.J., Knottenbelt W.J., and Wilson H.J. Hypergraph based parallel computation of passage time densities in large semi Markov models. Proceedings of the 4th International Conference on the Numerical Solution of Markov chains (NSMC'03), Urbana-Champaign IL. USA (September 2003) 99-120
9. Brglez F. A D&T Special Report on ACM/SIGDA Design Automation Benchmarks: Catalyst or Anathema. IEEE Design Test 10 3 (1993) 87-91
10. Bui T.N., and Jones C. Finding good approximate vertex and edge partitions is NP-Hard. Inform. Process. Lett. 42 3 (1992) 153-159
11. Caldwell A.E., Kahng A.B., and Markov I.L. Improved algorithms for hypergraph bipartitioning. Proceedings of the 2000 ACM/IEEE Conference on Asia South Pacific Design Automation (January 2000) 661-666
12. Catalyurek U.V., and Aykanat C. Decomposing irregularly sparse matrices for parallel matrix-vector multiplication. Lecture Notes in Computer Science vol. 1117 (1996), Springer, Berlin 75-86
13. Catalyurek U.V., and Aykanat C. Hypergraph-partitioning-based decomposition for parallel sparse-matrix vector multiplication. IEEE Trans. Parallel Distributed Systems 10 7 (1999) 673-693
14. Catalyurek U.V., and Aykanat C. A fine-grain hypergraph model for 2D decomposition. Proceedings of the 15th IEEE International Parallel and Distributed Processing Symposium. San Francisco, CA (2001)
15. Catalyurek U.V., and Aykanat C. A hypergraph-partitioning approach for coarse-grain decomposition. Proceedings of the ACM/IEEE Supercomputing. Denver (2001)
16. U.V. Catalyurek, C. Aykanat, PaToH: Partitioning Tool for Hypergraphs, Version 3.0, 2001.
17. Cong J., and Lim S.K. Multiway partitioning with pairwise movement. Proceedings of the ACM/IEEE International Conference on Computer-Aided Design. San Jose, CA (November 1998) 512-516
18. T. Davis, University of Florida Sparse Matrix Collection, March 2005 〈http://www.cise.ufl.edu/research/sparse/matrices〉.
19. Devine K.D., Boman E., Heaphy R., Bisseling R., and Catalyurek U.V. Parallel hypergraph partitioning for scientific computing. Proceedings of the 20th IEEE International Parallel and Distributed Processing Symposium (2006)
20. Devine K.D., Boman E.G., Heaphy R.T., Hendrickson B.A., Teresco J.D., Faik J., Flaherty J.E., and Gervasio L.G. New challenges in dynamic load balancing. Appl. Numer. Math. 52 2-3 (2005) 133-152
21. Dingle N.J., Knottenbelt W.J., and Harrison P.G. Uniformization and hypergraph partitioning for the distributed computation of response time densities in very large Markov models. J. Parallel Distributed Comput. 64 8 (2004) 908-920
22. I.S. Duff, R.G. Grimes, J.G. Lewis, The Rutherford-Boeing sparse matrix collection, Technical Report TR/PA/97/36, CERFACS, Toulouse, France, 1997.
23. Dutt S., and Deng W. A probability-based approach to VLSI circuit partitioning. Proceedings of the 33rd Annual Design Automation Conference (June 1996) 100-105
24. Dutt S., and Deng W. VLSI circuit partitioning by cluster-removal using iterative improvement techniques. Proceedings of the 1996 IEEE/ACM International Conference on Computer-Aided Design (November 1996) 194-200
25. Dutt S., and Theny H. Partitioning around roadblocks. tackling constraints with intermediate relaxations. Proceedings of the 1997 IEEE/ACM International Conference on Computer-Aided Design (November 1997) 350-355
26. Feldmann P., Melville R., and Long D. Efficient frequency domain analysis of large nonlinear analog circuits. Proceedings of the IEEE Custom Integrated Circuits Conference. Santa Clara, CA (1996)
27. Fiduccia C.M., and Mattheyses R.M. A linear time heuristic for improving network partitions. Proceedings of the 19th IEEE Design Automation Conference (1982) 175-181
28. Garey M.R., and Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), W.H. Freeman and Co., New York
29. D. Gleich, L. Zhukov, P. Berkhin, Fast parallel PageRank: a linear system approach, Technical Report YRL-2004-038, Institute for Computation and Mathematical Engineering, Stanford University, 2004.
30. Grama A., Gupta A., Karypis G., and Kumar V. Introduction to Parallel Computing. second ed. (2003), Addison-Wesley, Reading, MA
31. Hendrickson B.A. Graph partitioning and parallel solvers: has the emperor no clothes. Proceedings of the Irregular'98, Lecture Notes in Computer Science vol. 1457 (1998), Springer, Berlin 218-225
32. Hendrickson B.A., and Kolda T.G. Graph partitioning models for parallel computing. Parallel Comput. 26 (2000) 1519-1534
33. Hendrickson B.A., and Leland R. A multilevel algorithm for partitioning graphs. Proceedings of the ACM/IEEE Conference on Supercomputing (1995)
34. Van Heukelum A., Barkema G.T., and Bisseling R.H. DNA electrophoresis studied with the cage model. J. Comput. Phys. 180 1 (2002) 313-326
35. G. Karypis, Multilevel hypergraph partitioning, Technical Report #02-25, University of Minnesota, 2002.
36. Karypis G., Aggarwal R., Kumar V., and Shekhar S. Multilevel hypergraph partitioning: applications in VLSI domain. IEEE Trans. VLSI Systems 7 1 (1999) 69-79
37. G. Karypis, V. Kumar, hMeTiS: a hypergraph partitioning package, Version 1.5.3, University of Minnesota, 1998.
38. G. Karypis, V. Kumar, Multilevel k-way hypergraph partitioning, Technical Report #98-036, University of Minnesota, 1998.
39. Karypis G., and Kumar V. A parallel algorithm for multilevel graph partitioning and sparse matrix ordering. J. Parallel Distributed Comput. 48 (1998) 71-95
40. Karypis G., and Kumar V. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput. 20 1 (1999) 359-392
41. G. Karypis, K. Schloegel, V. Kumar, ParMeTiS: parallel graph partitioning and sparse matrix ordering library, Version 3.0, University of Minnesota, 2002.
42. Kernighan B.W., and Lin S. An efficient heuristic procedure for partitioning graphs. Bell System Technical J. 49 (1970) 291-307
43. W.J. Knottenbelt, Parallel performance analysis of large Markov models, Ph.D Thesis, Imperial College, London, UK, 2000.
44. Krishnamurthy B. An improved min-cut algorithm for partitioning VLSI networks. IEEE Trans. Comput. 33 C (1984) 438-446
45. Sanchis L.A. Multiple-way network partitioning with different cost functions. IEEE Trans. Comput. 42 22 (1993) 1500-1504
46. Schweikert D.G., and Kernighan B.W. A proper model for the partitioning of electrical circuits. Proceedings of the ACM/IEEE Design Automation Conference (1972) 57-62
47. Snir M., Otto S., Huss-Lederman S., Walker D., and Dongarra J. MPI-The Complete Reference. second ed. (1998), MIT Press, Cambridge, MA
48. Trifunovic A., and Knottenbelt W. Parkway2.0: a parallel multilevel hypergraph partitioning tool. Proceedings of the 19th International Symposium on Computer and Information Sciences, Lecture Notes in Computer Science vol. 3280 (2004), Springer, Berlin 789-800
49. Trifunovic A., and Knottenbelt W.J. A parallel algorithm for multilevel k-way hypergraph partitioning. Proceedings of the 3rd International Symposium on Parallel and Distributed Computing. University College Cork, Ireland (July 2004) 114-121
50. Ucar B., and Aykanat C. Encapsulating multiple communication-cost metrics in partitioning sparse rectangular matrices for parallel matrix-vector multiples. SIAM J Sci Comput 25 6 (2004) 1837-1859
51. Vastenhouw B., and Bisseling R.H. A two-dimensional data distribution method for parallel sparse matrix-vector multiplication. SIAM Rev. 47 1 (2005) 67-95