Skip to Main content Skip to Navigation
Journal articles

Multi-level direct K-way hypergraph partitioning with multiple constraints and fixed vertices

Abstract : K-way hypergraph partitioning has an ever-growing use in parallelization of scientific computing applications. We claim that hypergraph partitioning with multiple constraints and fixed vertices should be implemented using direct K-way refinement , instead of the widely adopted recursive bisection paradigm. Our arguments are based on the fact that recursive-bisection-based partitioning algorithms perform considerably worse when used in the multiple constraint and fixed vertex formulations. We discuss possible reasons for this performance degradation. We describe a careful implementation of a multi-level direct K-way hypergraph partitioning algorithm, which performs better than a well-known recursive-bisection-based partitioning algorithm in hypergraph partitioning with multiple constraints and fixed vertices. We also experimentally show that the proposed algorithm is effective in standard hypergraph partitioning.
Complete list of metadata

Cited literature [54 references]  Display  Hide  Download

https://hal.inria.fr/hal-00803479
Contributor : Equipe Roma <>
Submitted on : Thursday, December 19, 2019 - 5:28:51 PM
Last modification on : Thursday, August 20, 2020 - 4:40:07 PM
Long-term archiving on: : Friday, March 20, 2020 - 9:18:19 PM

File

YJPDC2489.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00803479, version 1

Collections

Citation

Cevdet Aykanat, Berkant B. Cambazoglu, Bora Uçar. Multi-level direct K-way hypergraph partitioning with multiple constraints and fixed vertices. Journal of Parallel and Distributed Computing, Elsevier, 2008, 68, pp.609--625. ⟨hal-00803479⟩

Share

Metrics

Record views

109

Files downloads

258