Abstract

Recently, a number of researchers have investigated a class of graph partitioning algorithms that reduce the size of the graph by collapsing vertices and edges, partition the smaller graph, and then uncoarsen it to construct a partition for the original graph [Bui and Jones, Proc. of the 6th SIAM Conference on Parallel Processing for Scientific Computing, 1993, 445--452; Hendrickson and Leland, A Multilevel Algorithm for Partitioning Graphs, Tech. report SAND 93-1301, Sandia National Laboratories, Albuquerque, NM, 1993]. From the early work it was clear that multilevel techniques held great promise; however, it was not knownif they can be made to consistently produce high quality partitions for graphs arising in a wide range of application domains. We investigate the effectiveness of many different choices for all three phases: coarsening, partition of the coarsest graph, and refinement. In particular, we present a new coarsening heuristic (called heavy-edge heuristic) for which the size of the partition of the coarse graph is within a small factor of the size of the final partition obtained after multilevel refinement. We also present a much faster variation of the Kernighan--Lin (KL) algorithm for refining during uncoarsening. We test our scheme on a large number of graphs arising in various domains including finite element methods, linear programming, VLSI, and transportation. Our experiments show that our scheme produces partitions that are consistently better than those produced by spectral partitioning schemes in substantially smaller time. Also, when our scheme is used to compute fill-reducing orderings for sparse matrices, it produces orderings that have substantially smaller fill than the widely used multiple minimum degree algorithm.

MSC codes

  1. 68B10
  2. 05C85

Keywords

  1. graph partitioning
  2. parallel computations
  3. fill-reducing orderings
  4. finite element computations

Get full access to this article

View all available purchase options and get full access to this article.

References

1.
S. T. Barnard and H. Simon, A parallel implementation of multilevel recursive spectral bisection for application to adaptive unstructured meshes, in Proc. 7th SIAM Conf. Parallel Processing for Scientific Computing, 1995, pp. 627–632.
2.
S. T. Barnard and H. D. Simon, A fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems, in Proc. 6th SIAM Conf. Parallel Processing for Scientific Computing, 1993, pp. 711–718.
3.
Earl Barnes, An algorithm for partitioning the nodes of a graph, SIAM J. Algebraic Discrete Methods, 3 (1982), 541–550
4.
T. Bui and C. Jones, A heuristic for reducing fill in sparse matrix factorization, in Proc. of the 6th SIAM Conf. Parallel Processing for Scientific Computing, 1993, pp. 445–452.
5.
T. Bui, S. Chaudhuri, F. Leighton, M. Sipser, Graph bisection algorithms with good average case behavior, Combinatorica, 7 (1987), 171–191
6.
T. F. Chan, J. R. Gilbert, and S.‐H. Teng, Geometric Spectral Partitioning, Xerox PARC Tech. Report., 1994.
Available at ftp://parcftp.xerox.com/pub/gilbert/index.html.
7.
C.‐K. Cheng and Y.‐C. A. Wei, An improved two‐way partitioning algorithm with stable performance, IEEE Trans. Comput. Aided Design, 10 (1991), pp. 1502–1511.
8.
P. Diniz, S. Plimpton, B. Hendrickson, and R. Leland, Parallel algorithms for dynamically partitioning unstructured grids, in Proc. 7th SIAM Conf. Parallel Processing for Scientific Computing, 1995, pp. 615–620.
9.
C. M. Fiduccia and R. M. Mattheyses, A linear time heuristic for improving network partitions, in Proc. 19th IEEE Design Automation Conference, 1982, pp. 175–181.
10.
J. Garbers, H. J. Promel, and A. Steger, Finding clusters in VLSI circuits, in Proc. of IEEE International Conference on Computer Aided Design, 1990, pp. 520–523.
11.
A. George, Nested dissection of a regular finite‐element mesh, SIAM J. Numer. Anal., 10 (1973), pp. 345–363.
12.
Alan George, Joseph Liu, Computer solution of large sparse positive definite systems, Prentice‐Hall Inc., 1981xii+324, Prentice‐Hall Series in Computational Mathematics
13.
Alan George, Joseph Liu, The evolution of the minimum degree ordering algorithm, SIAM Rev., 31 (1989), 1–19
14.
M. Ghose and E. Rothberg, A Parallel Implementation of the Multiple Minimum Degree Ordering Heuristic, Tech. rep., Old Dominion University, Norfolk, VA, 1994.
15.
John Gilbert, Gary Miller, Shang‐Hua Teng, Geometric mesh partitioning: implementation and experiments, SIAM J. Sci. Comput., 19 (1998), 2091–2110
16.
John Gilbert, Earl Zmijewski, A parallel graph partitioning algorithm for a message‐passing multiprocessor, Internat. J. Parallel Programming, 16 (1987), 427–449
17.
T. Goehring and Y. Saad, Heuristic Algorithms for Automatic Graph Partitioning, Tech. rep., Department of Computer Science, University of Minnesota, Minneapolis, 1994.
18.
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.
Available on WWW at URL http://www.cs.umn.edu/∼karypis.
19.
L. Hagen and A. Kahng, Fast spectral methods for ratio cut partitioning and clustering, in Proc. IEEE International Conference on Computer Aided Design, 1991, pp. 10–13.
20.
L. Hagen and A. Kahng, A new approach to effective circuit clustering, in Proc. IEEE International Conference on Computer Aided Design, 1992, pp. 422–427.
21.
S. Hammond, Mapping Unstructured Grid Problems to Massively Parallel Computers, Ph.D. thesis, Rensselaer Polytechnic Institute, Troy, NY, 1992.
22.
, Parallel algorithms for matrix computations, Society for Industrial and Applied Mathematics (SIAM), 1990x+197
23.
Michael Heath, Padma Raghavan, A Cartesian parallel nested dissection algorithm, SIAM J. Matrix Anal. Appl., 16 (1995), 235–253
24.
Bruce Hendrickson, Robert Leland, An improved spectral graph partitioning algorithm for mapping parallel computations, SIAM J. Sci. Comput., 16 (1995), 452–469
25.
B. Hendrickson and R. Leland, The Chaco User’s Guide, Version 1.0, Tech. rep. SAND93‐2339, Sandia National Laboratories, Albuquerque, NM, 1993.
26.
B. Hendrickson and R. Leland, A Multilevel Algorithm for Partitioning Graphs, Tech. report SAND93‐1301, Sandia National Laboratories, Albuquerque, NM, 1993.
27.
G. Karypis, A. Gupta, and V. Kumar, A parallel formulation of interior point algorithms, in Supercomputing 94, 1994;
also available online from http://www.cs.umn.edu/∼karypis.
28.
G. Karypis and V. Kumar, Analysis of Multilevel Graph Partitioning, Tech. rep. TR 95‐037, Department of Computer Science, University of Minnesota, 1995;
also available online from http://www.cs.umn.edu/∼karypis; a short version appears in Supercomputing 95.
29.
G. Karypis and V. Kumar, Multilevel graph partition and sparse matrix ordering, in Intl. Conf. on Parallel Processing, 1995;
also available online from http:// www.cs.umn.edu/∼karypis.
30.
G. Karypis and V. Kumar, A parallel algorithm for multilevel graph partitioning and sparse matrix ordering, J. Parallel and Distributed Computing, 48 (1998), pp. 71–95;
also available online from http://www.cs.umn.edu/∼karypis; a short version appears in Intl. Parallel Processing Symposium 1996.
31.
B. W. Kernighan and S. Lin, An efficient heuristic procedure for partitioning graphs, Bell Sys. Tech. J., 49 (1970), pp. 291–307.
32.
V. Kumar, A. Grama, A. Gupta, and G. Karypis, Introduction to Parallel Computing: Design and Analysis of Algorithms, Benjamin/Cummings Publishing Company, Redwood City, CA, 1994.
33.
T. Leighton and S. Rao, An approximate max‐flow min‐cut theorem for uniform multicommodity flow problems with applications to approximation algorithms, in 29th Annual Symposium on Foundations of Computer Science, 1988, pp. 422–431.
34.
Richard Lipton, Robert Tarjan, A separator theorem for planar graphs, SIAM J. Appl. Math., 36 (1979), 177–189
35.
Joseph Liu, Modification of the minimum‐degree algorithm by multiple elimination, ACM Trans. Math. Software, 11 (1985), 141–153
36.
Gary Miller, Shang‐Hua Teng, William Thurston, Stephen Vavasis, Automatic mesh partitioning, IMA Vol. Math. Appl., Vol. 56, Springer, New York, 1993, 57–84
37.
Gary Miller, Shang‐Hua Teng, Stephen Vavasis, A unified geometric approach to graph separators, IEEE Comput. Soc. Press, Los Alamitos, CA, 1991, 538–547
38.
B. Nour‐Omid, A. Raefsky, and G. Lyzenga, Solving finite element equations on concurrent computers, in Amer. Soc. Mech. Engrg., A. K. Noor, ed., 1986, pp. 291–307.
39.
P. Ciarlet, Jr., F. Lamour, On the validity of a front‐oriented approach to partitioning large sparse graphs with a connectivity constraint, Numer. Algorithms, 12 (1996), 193–214
40.
C. C. Paige and M. A. Saunders, Solution to sparse indefinite systems of linear equations, SIAM J. Numer. Anal., 12 (1974), pp. 617–629.
41.
C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization, Prentice–Hall, Englewood Cliffs, NJ, 1982.
42.
B. N. Parlett, The Symmetric Eigenvalue Problem, Prentice–Hall, Englewood Cliffs, NJ, 1980.
43.
R. Ponnusamy, N. Mansour, A. Choudhary, and G. C. Fox, Graph contraction and physical optimization methods: A quality‐cost tradeoff for mapping data on parallel computers, in International Conference of Supercomputing, ACM, New York, 1993.
44.
Alex Pothen, Chin‐Ju Fan, Computing the block triangular form of a sparse matrix, ACM Trans. Math. Software, 16 (1990), 303–324
45.
Alex Pothen, Horst Simon, Kang‐Pu Liou, Partitioning sparse matrices with eigenvectors of graphs, SIAM J. Matrix Anal. Appl., 11 (1990), 430–452, Sparse matrices (Gleneden Beach, OR, 1989)
46.
A. Pothen, H. D. Simon, and L. Wang, Spectral Nested Dissection, Tech. rep. 92‐01, Computer Science Department, Pennsylvania State University, University Park, PA, 1992.
47.
A. Pothen, H. D. Simon, L. Wang, and S. T. Bernard, Towards a fast implementation of spectral nested dissection, in Supercomputing ’92 Proceedings, IEEE Computer Society Press, Washington, DC, 1992, pp. 42–51.
48.
P. Raghavan, Line and Plane Separators, Tech. rep. UIUCDCS‐R‐93‐1794, Department of Computer Science, University of Illinois, Urbana, IL 61801, February 1993.

Information & Authors

Information

Published In

cover image SIAM Journal on Scientific Computing
SIAM Journal on Scientific Computing
Pages: 359 - 392
ISSN (online): 1095-7197

History

Published online: 25 July 2006

MSC codes

  1. 68B10
  2. 05C85

Keywords

  1. graph partitioning
  2. parallel computations
  3. fill-reducing orderings
  4. finite element computations

Authors

Affiliations

Metrics & Citations

Metrics

Citations

If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.

Cited By