Multilevelk-way Partitioning Scheme for Irregular Graphs

Journal of Parallel and Distributed Computing

Volumn 48, Issue 1, 1998, Pages 96-129

  Karypis, George ^a   Kumar, Vipin ^a  

^a Unviersity of Minnesota ^*  (United States)

Author keywords

Graph partitioning; multilevel partitioning methods; Kernighan Lin heuristic; spectral partitioning methods; parallel sparse matrix algorithms.

Indexed keywords

EID: 0002806618     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1006/jpdc.1997.1404     Document Type: Article

References (27)

1. Barnard S. T., Simon H. D. A fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems. Proceedings of the Sixth SIAM Conference on Parallel Processing for Scientific Computing. 1993;. p. 711-718.
2. Bui T., Jones C. A heuristic for reducing fill in sparse matrix factorization. 6th SIAM Conf. Parallel Processing for Scientific Computing. 1993;. p. 445-452.
3. Cheng C.-K., Wei Y.-C. A. An improved two-way partitioning algorithm with stable performance. IEEE Trans. Computer Aided Design. 10:Dec. 1991;1502-1511.
4. Fiduccia C. M., Mattheyses R. M. A linear time heuristic for improving network partitions. Proc. 19th IEEE Design Automation Conference. 1982;. p. 175-181.
5. Garbers J., Promel H. J., Steger A. Finding clusters in VLSI circuits. Proceedings of IEEE International Conference on Computer Aided Design. 1990;. p. 520-523.
6. Gilbert J. R., Zmijewski E. A parallel graph partitioning algorithm for a message-passing multiprocessor. Int. J. Parallel Program. 16:1987;498-513.
7. Hagen L., Kahng A. Fast spectral methods for ratio cut partitioning and clustering. Proceedings of IEEE International Conference on Computer Aided Design. 1991;. p. 10-13.
8. Hagen L., Kahng A. A new approach to effective circuit clustering. Proceedings of IEEE International Conference on Computer Aided Design. 1992;. p. 422-427.
9. Heath M. T., Raghavan P. A Cartesian parallel nested dissection algorithm. SIAM J. Matrix Anal. Appl. 16:1995;235-253.
10. Hendrickson B., Leland R. An Improved Pectral Graph Partitioning Algorithm for Mapping Parallel Computations. Technical Report. 1992.
11. Hendrickson B., Leland R. The Chaco User's Guide. Technical Report. 1993.
12. Hendrickson B., Leland R. A Multilevel Algorithm for Partitioning Graphs. Technical Report. 1993.
13. Karypis G., Kumar V. Analysis of Multilevel Graph Partitioning. Technical Report. 1995.
14. Karypis G., Kumar V. Metis: Unstructured Graph Partitioning and Sparse Matrix Ordering System. Technical Report. 1995.
15. Karypis G., Kumar V. Parallel Multilevelk. Technical Report. 1996.
16. G. Karypis, V. Kumar, A fast and highly quality multilevel scheme for partitioning irregular graphs, SIAM J. Sci. Comput. http://www.cs.umn.edu/~karypis.
17. Kernighan B. W., Lin S. An efficient heuristic procedure for partitioning graphs. Bell System Tech. J. 1970.
18. Miller G. L., Teng S.-H., Thurston W., Vavasis S. A. Automatic mesh partitioning. Sparse Matrix Computations: Graph Theory Issues and Algorithms. An IMA Workshop Volume. 1993;Springer-Verlag, New York.
19. Miller G. L., Teng S.-H., Vavasis S. A. A unified geometric approach to graph separators. Proceedings of 31st Annual Symposium on Foundations of Computer Science. 1991;. p. 538-547.
20. Nour-Omid B., Raefsky A., Lyzenga G. Solving finite element equations on concurrent computers. Noor A. K. American Society of Mechanical Engineering. 1986;291-307.
21. Ponnusamy R., Mansour N., Choudhary A., Fox G. C. Graph contraction and physical optimization methods: A quality-cost tradeoff for mapping data on parallel computers. International Conference of Supercomputing. 1993.
22. Pothen A., Simon H. D., Wang L., Bernard S. T. Towards a fast implementation of spectral nested dissection. Supercomputing '92 Proceedings. 1992;. p. 42-51.
23. Pothen A., Simon H. D., Liou K.-P. Partitioning sparse matrices with eigenvectors of graphs. SIAM J. Matrix Anal. Appl. 11:1990;430-452.
24. Raghavan P. Line and Plane Separators. Technical Report. Feb. 1993.
25. Schloegel K., Karypis G., Kumar V. Multilevel diffusion algorithms for repartitioning of adaptive meshes. J. Parallel Distrib. Comput. 47:1997.
26. Schloegel K., Karypis G., Kumar V. Repartitioning of adaptive meshes: Experiments with multilevel diffusion. Proceedings of the Third International Euro-Par Conference. Aug. 1997;. p. 945-949.
27. Simon H. D., Teng S.-H. How Good is Recursive Bisection? Technical Report. 1993.