KaHIP v0.53 - Karlsruhe High Quality Partitioning - User Guide

This paper severs as a user guide to the graph partitioning framework KaHIP (Karlsruhe High Quality Partitioning). We give a rough overview of the techniques used within the framework and describe the user interface as well as the file formats used. Moreover, we provide a short description of the current library functions provided within the framework. Since version 3.00 we support multilevel partitioning, memetic algorithms, distributed and shared-memory parallel algorithms, node separator and ordering algorithms, edge partitioning algorithms as well as ILP solvers.

[1]  Peter Sanders,et al.  Goal-directed shortest-path queries using precomputed cluster distances , 2010, JEAL.

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

[3]  Onkar Sahni,et al.  Controlling Unstructured Mesh Partitions for Massively Parallel Simulations , 2010, SIAM J. Sci. Comput..

[4]  Andrew V. Goldberg,et al.  Customizable Route Planning , 2011, SEA.

[5]  Dorothea Wagner,et al.  Partitioning graphs to speedup Dijkstra's algorithm , 2007, ACM J. Exp. Algorithmics.

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

[7]  Kamesh Madduri,et al.  Graph partitioning for scalable distributed graph computations , 2012, Graph Partitioning and Graph Clustering.

[8]  Peter Sanders,et al.  Distributed Time-Dependent Contraction Hierarchies , 2010, SEA.

[9]  Andrew B. Kahng,et al.  Spectral Partitioning with Multiple Eigenvectors , 1999, Discret. Appl. Math..

[10]  Frank Schulz,et al.  Using Multi-Level Graphs for Timetable Information , 2001 .

[11]  Peter Sanders,et al.  High quality graph partitioning , 2012, Graph Partitioning and Graph Clustering.

[12]  Peter Sanders,et al.  Partitioning Complex Networks via Size-Constrained Clustering , 2014, SEA.

[13]  Peter Sanders,et al.  Distributed Evolutionary Graph Partitioning , 2011, ALENEX.

[14]  Peter Sanders,et al.  Advanced Coarsening Schemes for Graph Partitioning , 2012, ACM J. Exp. Algorithmics.

[15]  Joseph R. Shinnerl,et al.  Multilevel Optimization in VLSICAD , 2003 .

[16]  Peter Sanders,et al.  Engineering a scalable high quality graph partitioner , 2009, 2010 IEEE International Symposium on Parallel & Distributed Processing (IPDPS).

[17]  C. Walshaw.  JOSTLE : parallel multilevel graph-partitioning software – an overview , 2008 .

[18]  Andrew B. Kahng,et al.  Recent directions in netlist partitioning: a survey , 1995, Integr..

[19]  Sivasankaran Rajamanickam,et al.  Scalable matrix computations on large scale-free graphs using 2D graph partitioning , 2013, 2013 SC - International Conference for High Performance Computing, Networking, Storage and Analysis (SC).

[20]  Robert van Engelen,et al.  Graph Partitioning for High Performance Scienti c Simulations , 2000 .

[21]  A. George.  Nested Dissection of a Regular Finite Element Mesh , 1973 .

[22]  Peter Sanders,et al.  Engineering Multilevel Graph Partitioning Algorithms , 2010, ESA.

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

[24]  Dennis Luxen,et al.  Candidate Sets for Alternative Routes in Road Networks , 2012, SOCS.

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

[26]  Ümit V. Çatalyürek,et al.  Decomposing Irregularly Sparse Matrices for Parallel Matrix-Vector Multiplication , 1996, IRREGULAR.

[27]  Daniel Delling,et al.  Faster Customization of Road Networks , 2013, SEA.

[28]  Chris Walshaw,et al.  Multilevel Refinement for Combinatorial Optimisation Problems , 2004, Ann. Oper. Res..

[29]  Jennifer Widom,et al.  GPS: a graph processing system , 2013, SSDBM.

[30]  Peter Sanders,et al.  Optimized Hybrid Parallel Lattice Boltzmann Fluid Flow Simulations on Complex Geometries , 2012, Euro-Par.