Parallel multilevel k-way partitioning scheme for irregular graphs

SIAM Review

Volumn 41, Issue 2, 1999, Pages 278-300

  Karypis, George ^a   Kumar, Vipin ^a  

^a University of Minnesota ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; FINITE ELEMENT METHOD; GRAPH THEORY; HEURISTIC METHODS; PARALLEL PROCESSING SYSTEMS; PROGRAM PROCESSORS;

KERNIGHAN-LIN HEURISTIC; PARALLEL GRAPH PARTITIONING; PARALLEL MULTILEVEL PARTITIONING; PARALLEL SPARSE MATRIX ALGORITHMS; SPECTRAL PARTITIONING METHODS;

PARALLEL ALGORITHMS;

EID: 0032650115     PISSN: 00361445     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0036144598334138     Document Type: Article

References (32)

1. S. T. BARNARD, PMRSB: Parallel multilevel recursive spectral bisection, in Supercomputing 1995, ACM and IEEE Computer Society, San Diego, CA, 1995.
2. S. T. BARNARD AND H. SIMON, A parallel implementation of multilevel recursive spectral bisection for application to adaptive unstructured meshes, in Proc. Seventh SIAM Conf. on Parallel Processing for Scientific Computing, SIAM, Philadelphia, 1995, pp. 627-632.
3. S. T. BARNARD AND H. D. SIMON, A fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems, in Proc. Sixth SIAM Conf. on Parallel Processing for Scientific Computing, SIAM, Philadelphia, 1993, pp. 711-718.
4. T. N. BUI AND C. JONES, A heuristic for reducing fill-in in sparse matrix factorization, in Proc. Sixth SIAM Conf. on Parallel Processing for Scientific Computing, SIAM, Philadelphia, 1993, pp. 445-452.
5. J. CONG AND M. L. SMITH, A parallel bottom-up clustering algorithm with applications to circuit partitioning in VLSI design, in Proc. ACM/IEEE Design Automation Conference, Dallas, TX, 1993, pp. 755-760.
6. K. D. DEVINE AND J. E. FLAHERTY, Dynamic load balancing for parallel finite element methods with adaptive h- and p-refinement, in Proc. Seventh SIAM Conf. on Parallel Processing for Scientific Computing, SIAM, Philadelphia, 1995, pp. 593-598.
7. P. DINIZ, S. PLIMPTON, B. HENDRICKSON, AND R. LELAND, Parallel algorithms for dynamically partitioning unstructured grids, in Proc. Seventh SIAM Conf. on Parallel Processing for Scientific Computing, SIAM, Philadelphia, 1995, pp. 615-620.
8. A. GEORGE, Nested dissection of a regular finite element mesh, SIAM J. Numer. Anal., 10 (1973), pp. 345-363.
9. J. R. GILBERT AND E. ZMIJEWSKI, A parallel graph partitioning algorithm for a message-passing multiprocessor, Internat. J. Parallel Programming, (1987), pp. 498-513.
10. A. GUPTA, G. KARYPIS, AND V. KUMAR, Highly scalable parallel algorithms for sparse matrix factorization, IEEE Trans. Parallel and Distributed Systems, 8 (1997), pp. 502-520; also available online from http://www.cs.umn.edu/∼karypis.
11. S. HAUCK AND G. BORRIRLLO, An evaluation of bipartitioning technique, in Proc. Chapel Hill Conf. on Advanced Research in VLSI, IEEE Computer Society, San Diego, CA, 1995.
12. M. T. HEATH AND P. RAGHAVAN, A Cartesian parallel nested dissection algorithm, SIAM J. Matrix Anal. Appl., 16 (1995), pp. 235-253.
13. B. HENDRICKSON AND R. LELAND, A Multilevel Algorithm for Partitioning Graphs, Tech. Rep. SAND93-1301, Sandia National Laboratories, Albuquerque, NM, 1993.
14. Z. JOHAN, K. K. MATHUR, S. L. JOHNSSON, AND T. J. R. HUGHES, Finite Element Methods on the Connection Machine CM-5 System, Tech. Rep., Thinking Machines Corporation, Burlington, MA, 1993.
15. M. T. JONES AND P. E. PLASSMANN, A parallel graph coloring heuristic, SIAM J. Sci. Comput., 14 (1993), pp. 654-669.
16. G. KARYPIS AND V. KUMAR, Fast Sparse Cholesky Factorization on Scalable Parallel Computers, Tech. Rep., Department of Computer Science, University of Minnesota, Minneapolis, 1994; a short version appears in the Eighth Symposium on the Frontiers of Massively Parallel Computation, IEEE Computer Society, San Diego, CA, 1995. Also available online from http://www.cs.umn.edu/∼karypis.
17. G. KARYPIS AND V. KUMAR, Fast Sparse Cholesky Factorization on Scalable Parallel Computers, Tech. Rep., Department of Computer Science, University of Minnesota, Minneapolis, 1994; a short version appears in the Eighth Symposium on the Frontiers of Massively Parallel Computation, IEEE Computer Society, San Diego, CA, 1995. Also available online from http://www.cs.umn.edu/∼karypis.
18. G. KARYPIS AND V. KUMAR, METIS3.0: Unstructured Graph Partitioning and Sparse Matrix Ordering System, Tech. Rep. 97-061, Department of Computer Science, University of Minnesota, Minneapolis, 1997; also available online from http://www.cs.umn.edu/∼metis.
19. G. KARYPIS AND V. KUMAR, Multilevel k-way partitioning scheme for irregular graphs, J. Parallel Distrib. Comput., 48 (1998), pp. 96-129; also available online from http://www.cs.umn.edu/∼karypis.
20. G. KARYPIS AND V. KUMAR, A parallel algorithm for multilevel graph partitioning and sparse matrix ordering, J. Parallel Distrib. Comput., 48 (1998), pp. 71-95; also available online from http://www.cs.umn.edu/∼karypis. A short version appears in Proc. Internat. Parallel Processing Symposium, CRC Press, Boca Raton, FL, 1996.
21. G. KARYPIS AND V. KUMAR, A parallel algorithm for multilevel graph partitioning and sparse matrix ordering, J. Parallel Distrib. Comput., 48 (1998), pp. 71-95; also available online from http://www.cs.umn.edu/∼karypis. A short version appears in Proc. Internat. Parallel Processing Symposium, CRC Press, Boca Raton, FL, 1996.
22. 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; also available online from http://www.cs.umn.edu/∼karypis. A short version appears in Proc. Internat. Conf. on Parallel Processing, CRC Press, Boca Raton, FL, 1995.
23. 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; also available online from http://www.cs.umn.edu/∼karypis. A short version appears in Proc. Internat. Conf. on Parallel Processing, CRC Press, Boca Raton, FL, 1995.
24. B. W. KERNIGHAN AND S. LIN, An efficient heuristic procedure for partitioning graphs, Bell System Tech. J., 49 (1970), pp. 291-307.
25. V. KUMAR, A. GRAMA, A. GUPTA, AND G. KARYPIS, Introduction to Parallel Computing: Design and Analysis of Algorithms, Benjamin/Cummings, Redwood City, CA, 1994.
26. M. LUBY, A simple parallel algorithm for the maximal independent set problem, SIAM J. Comput., 15 (1986), pp. 1036-1053.
27. A. POTHEN, H. D. SIMON, AND K.-P. LIOU, Partitioning sparse matrices with eigenvectors of graphs, SIAM J. Matrix Anal. Appl., 11 (1990), pp. 430-452.
28. P. RAGHAVAN, Parallel Ordering Using Edge Contraction, Tech. Rep. CS-95-293, Department of Computer Science, University of Tennessee, Knoxville, 1995.
29. E. ROTHBERG, Performance of panel and block approaches to sparse Cholesky factorization on the iPSC/860 and Paragon multicomputers, in Proc. 1994 Scalable High Performance Computing Conference, IEEE Computer Society, San Diego, CA, 1994.
30. K. SCHLOEGEL, G. KARYPIS, AND V. KUMAR, Multilevel diffusion algorithms for repartitioning of adaptive meshes, J. Parallel Distrib. Comput., 47 (1997), pp. 109-124; also available online from http://www.cs.umn.edu/∼karypis.
31. R. V. SHANKAR AND S. RANKA, Random data accesses on coarse-grained parallel machine, J. Parallel Distrib. Comput., 44 (1997), pp. 24-34.
32. C. WALSHAW, M. CROSS, AND M. G. EVERETT, Dynamic load-balancing for parallel adaptive unstructured meshes, in Proc. Eighth SIAM Conference on Parallel Processing for Scientific Computing, SIAM, Philadelphia, 1997.