Multilevel algorithms for partitioning power-law graphs
Authors:
- 1 January 2006
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15302075,p. 10 pp.
Abstract
Graph partitioning is an enabling technology for parallel processing as it allows for the effective decomposition of unstructured computations whose data dependencies correspond to a large sparse and irregular graph. Even though the problem of computing high-quality partitionings of graphs arising in scientific computations is to a large extent well-understood, this is far from being true for emerging HPC applications whose underlying computation involves graphs whose degree distribution follows a power-law curve. This paper presents new multilevel graph partitioning algorithms that are specifically designed for partitioning such graphs. It presents new clustering-based coarsening schemes that identify and collapse together groups of vertices that are highly connected. An experimental evaluation of these schemes on 10 different graphs show that the proposed algorithms consistently and significantly outperform existing state-of-the-art approaches.Keywords
This publication has 10 references indexed in Scilit:
- An evaluation of bipartitioning techniques2002
- GRAPH PARTITIONING FOR DYNAMIC, ADAPTIVE AND MULTI-PHASE SCIENTIFIC SIMULATIONS2002
- Authoritative sources in a hyperlinked environmentJournal of the ACM, 1999
- Hypergraph-partitioning-based decomposition for parallel sparse-matrix vector multiplicationIEEE Transactions on Parallel and Distributed Systems, 1999
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular GraphsSIAM Journal on Scientific Computing, 1998
- Multilevelk-way Partitioning Scheme for Irregular GraphsJournal of Parallel and Distributed Computing, 1998
- Using domain decomposition to find graph bisectorsBIT Numerical Mathematics, 1997
- A parallel bottom-up clustering algorithm with applications to circuit partitioning in VLSI design1993
- Network structure and minimum degreeSocial Networks, 1983
- An Efficient Heuristic Procedure for Partitioning GraphsBell System Technical Journal, 1970