Comparison of initial partitioning methods for multilevel direct k-way graph partitioning with fixed vertices

Abstract In scientific computing, load balancing is a crucial step conditioning the performance of large-scale applications. In this case, an efficient decomposition of the workload to a number of processors is highly necessary. A common approach to solve this problem is to use graph representation and perform a graph partitioning in k -parts using the multilevel framework and the recursive bisection (RB) paradigm. However, in graph instances where fixed vertices are used to model additional constraints, RB often produces partitions of poor quality.In this paper, we investigate the difficulties of RB to handle fixed vertices and we compare its results with two different alternatives. The first one, called kgggp is a direct k -way greedy graph growing partitioning that properly handles fixed vertices while the second one, introduced in kPaToH , uses RB and a post-processing technique to correct the obtained partition. Finally, experimental results on graphs that represent real-life numerical simulations show that both alternative methods provide improved partitions compared to RB.

[1]  Berkant Barla Cambazoglu,et al.  Multi-level direct K-way hypergraph partitioning with multiple constraints and fixed vertices , 2008, J. Parallel Distributed Comput..

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

[3]  Roberto Battiti,et al.  Differential greedy for the 0-1 equicut problem , 1997, Network Design: Connectivity and Facilities Location.

[4]  Courtenay T. Vaughan,et al.  Parallel Transient Dynamics Simulations: Algorithms for Contact Detection and Smoothed Particle Hydrodynamics , 1998, J. Parallel Distributed Comput..

[5]  Sivasankaran Rajamanickam,et al.  Parallel partitioning with Zoltan: Is hypergraph partitioning worth it? , 2012, Graph Partitioning and Graph Clustering.

[6]  Shang-Hua Teng,et al.  How Good is Recursive Bisection? , 1997, SIAM J. Sci. Comput..

[7]  Bruce Hendrickson,et al.  An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations , 1995, SIAM J. Sci. Comput..

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

[9]  Andrew B. Kahng,et al.  Hypergraph partitioning for VLSI CAD: methodology for heuristic development, experimentation and reporting , 1999, DAC '99.

[10]  Vipin Kumar,et al.  Multilevel Algorithms for Multi-Constraint Graph Partitioning , 1998, Proceedings of the IEEE/ACM SC98 Conference.

[11]  Aurélien Esnard,et al.  Coupling-aware graph partitioning algorithms: Preliminary study , 2014, 2014 21st International Conference on High Performance Computing (HiPC).

[12]  Karen Dragon Devine,et al.  Partitioning and Dynamic Load Balancing for the Numerical Solution of Partial Differential Equations , 2006 .

[13]  G. Karypis,et al.  Multi-Constraint Mesh Partitioning for Contact/Impact Computations , 2003, ACM/IEEE SC 2003 Conference (SC'03).

[14]  Ralf Diekmann,et al.  Shape-optimized mesh partitioning and load balancing for parallel adaptive FEM , 2000, Parallel Comput..

[15]  George Karypis,et al.  Multilevel Hypergraph Partitioning , 2003 .

[16]  David A. Bader,et al.  Benchmarking for Graph Clustering and Partitioning , 2014, Encyclopedia of Social Network Analysis and Mining.

[17]  Ümit V. Çatalyürek,et al.  A repartitioning hypergraph model for dynamic load balancing , 2009, J. Parallel Distributed Comput..

[18]  Brendan Vastenhouw,et al.  A Two-Dimensional Data Distribution Method for Parallel Sparse Matrix-Vector Multiplication , 2005, SIAM Rev..

[19]  Cevdet Aykanat,et al.  A Recursive Hypergraph Bipartitioning Framework for Reducing Bandwidth and Latency Costs Simultaneously , 2017, IEEE Transactions on Parallel and Distributed Systems.

[20]  François-Henry Rouet,et al.  On Partitioning Problems with Complex Objectives , 2011, Euro-Par Workshops.

[21]  Bruce Hendrickson,et al.  Parallel strategies for crash and impact simulations , 1998 .

[22]  Bruce Hendrickson,et al.  Enhancing data locality by using terminal propagation , 1996, Proceedings of HICSS-29: 29th Hawaii International Conference on System Sciences.

[23]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[24]  Aurélien Esnard,et al.  A k-Way Greedy Graph Partitioning with Initial Fixed Vertices for Parallel Applications , 2016, 2016 24th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP).

[25]  Peter Sanders,et al.  Think Locally, Act Globally: Highly Balanced Graph Partitioning , 2013, SEA.

[26]  Bruce Hendrickson,et al.  Skewed Graph Partitioning , 1997, PP.

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

[28]  Tamara G. Kolda,et al.  Graph partitioning models for parallel computing , 2000, Parallel Comput..

[29]  Peter G. Harrison,et al.  Uniformization and hypergraph partitioning for the distributed computation of response time densities in very large Markov models , 2004, J. Parallel Distributed Comput..

[30]  Maria Predari,et al.  Load Balancing for Parallel Coupled Simulations , 2016 .

[31]  Chris Walshaw,et al.  Multiphase mesh partitioning , 2000 .

[32]  David A. Bader.  Graph partitioning and graph clustering : 10th DIMACS Implementation Challenge Workshop, February 13-14, 2012, Georgia Institute of Technology, Atlanta, GA , 2013 .

[33]  R. M. Mattheyses,et al.  A Linear-Time Heuristic for Improving Network Partitions , 1982, 19th Design Automation Conference.

[34]  H. Kuhn.  The Hungarian method for the assignment problem , 1955 .

[35]  Patrick Ciarlet,et al.  On the validity of a front-oriented approach to partitioning large sparse graphs with a connectivity constraint , 2005, Numerical Algorithms.

[36]  Berkant Barla Cambazoglu,et al.  Adaptive decomposition and remapping algorithms for object-space-parallel direct volume rendering of unstructured grids , 2007, J. Parallel Distributed Comput..

[37]  Brian W. Kernighan,et al.  A Procedure for Placement of Standard-Cell VLSI Circuits , 1985, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.