A Coarse-Grain Parallel Formulation of Multilevel k-way Graph Partitioning Algorithm

In this paper we present a parallel formulation of a multilevel k-way graph partitioning algorithm, that is particularly suited for message-passing libraries that have high latency. The multilevel k-way partitioning algorithm reduces the size of the graph by successively collapsing vertices and edges (coarsening phase), finds a k-way partitioning of the smaller graph, and then it constructs a k-way partitioning for the original graph by projecting and refining the partition to successively finer graphs (uncoarsening phase). Our algorithm is able to achieve a high degree of concurrency, while maintaining the high quality partitions produced by the serial algorithm.

[1]  Hans Jürgen Prömel,et al.  Finding clusters in VLSI circuits , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[2]  Vipin Kumar,et al.  A Parallel Algorithm for Multilevel Graph Partitioning and Sparse Matrix Ordering , 1998, J. Parallel Distributed Comput..

[3]  Padma Raghavan,et al.  Parallel Ordering Using Edge Contraction , 1997, Parallel Comput..

[4]  Michael Luby,et al.  A simple parallel algorithm for the maximal independent set problem , 1985, STOC '85.

[5]  PothenAlex,et al.  Partitioning sparse matrices with eigenvectors of graphs , 1990 .

[6]  Vipin Kumar,et al.  Analysis of Multilevel Graph Partitioning , 1995, Proceedings of the IEEE/ACM SC95 Conference.

[7]  Steven J. Plimpton,et al.  Parallel Algorithms for Dynamically Partitioning Unstructured Grids , 1995, PPSC.

[8]  Gary L. Miller,et al.  Automatic Mesh Partitioning , 1992 .

[9]  Bruce Hendrickson,et al.  A Multi-Level Algorithm For Partitioning Graphs , 1995, Proceedings of the IEEE/ACM SC95 Conference.

[10]  Curt Jones,et al.  A Heuristic for Reducing Fill-In in Sparse Matrix Factorization , 1993, PPSC.

[11]  Thomas J. R. Hughes,et al.  Mesh Decomposition and Communication Procedures for Finite Element Applications on the Connection Machine CM-5 System , 1994, HPCN.

[12]  George Karypis,et al.  Introduction to Parallel Computing , 1994 .

[13]  Chung-Kuan Cheng,et al.  An improved two-way partitioning algorithm with stable performance [VLSI] , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[14]  B. Nour-Omid,et al.  Solving finite element equations on concurrent computers , 1987 .

[15]  Alex Pothen,et al.  PARTITIONING SPARSE MATRICES WITH EIGENVECTORS OF GRAPHS* , 1990 .

[16]  Andrew B. Kahng,et al.  A new approach to effective circuit clustering , 1992, ICCAD.

[17]  Andrew B. Kahng,et al.  Fast spectral methods for ratio cut partitioning and clustering , 1991, 1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers.

[18]  Horst D. Simon,et al.  Fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems , 1994, Concurr. Pract. Exp..

[19]  Thomas J. R. Hughes,et al.  An efficient communications strategy for finite element methods on the Connection Machine CM-5 system , 1994 .

[20]  Vipin Kumar,et al.  Parallel Multilevel k-way Partitioning Scheme for Irregular Graphs , 1996, Proceedings of the 1996 ACM/IEEE Conference on Supercomputing.

[21]  Alok N. Choudhary,et al.  Graph Contraction for Mapping Data on Parallel Computers: A Quality-Cost Tradeoff , 1994, Sci. Program..

[22]  S.T. Barnard,et al.  PMRSB: Parallel Multilevel Recursive Spectral Bisection , 1995, Proceedings of the IEEE/ACM SC95 Conference.

[23]  Vipin Kumar,et al.  A Scalable Parallel Algorithm for Sparse Matrix Factorization , 1994 .

[24]  Michael T. Heath,et al.  A Cartesian Parallel Nested Dissection Algorithm , 1992, SIAM J. Matrix Anal. Appl..

[25]  P. Raghavan.  Line and plane separators , 1993 .

[26]  Vipin Kumar,et al.  A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs , 1998, SIAM J. Sci. Comput..

[27]  John R. Gilbert,et al.  A parallel graph partitioning algorithm for a message-passing multiprocessor , 1987, International journal of parallel programming.

[28]  Gary L. Miller,et al.  A unified geometric approach to graph separators , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[29]  S.,et al.  An Efficient Heuristic Procedure for Partitioning Graphs , 2022 .

[30]  Horst D. Simon,et al.  A Parallel Implementation of Multilevel Recursive Spectral Bisection for Application to Adaptive Unstructured Meshes. Chapter 1 , 1994 .

[31]  Vipin Kumar,et al.  Highly Scalable Parallel Algorithms for Sparse Matrix Factorization , 1997, IEEE Trans. Parallel Distributed Syst..

[32]  E. Rothberg,et al.  Performance of panel and block approaches to sparse Cholesky factorization on the iPSC/860 and Paragon multicomputers , 1994, Proceedings of IEEE Scalable High Performance Computing Conference.

[33]  George Karypis,et al.  Multilevel k-way Partitioning Scheme for Irregular Graphs , 1998, J. Parallel Distributed Comput..