Affiliation:
1. Department of Computer Science and Engineering, Army HPC Research Center, University of Minnesota, Minneapolis 55455, MN, USA
Abstract
In this paper, we present a new multilevel k-way hypergraph partitioning algorithm that
substantially outperforms the existing state-of-the-art K-PM/LR algorithm for multi-way
partitioning, both for optimizing local as well as global objectives. Experiments on
the ISPD98 benchmark suite show that the partitionings produced by our scheme are on
the average 15% to 23% better than those produced by the K-PM/LR algorithm, both
in terms of the hyperedge cut as well as the (K – 1) metric. Furthermore, our algorithm
is significantly faster, requiring 4 to 5 times less time than that required by K-PM/LR.
Subject
Electrical and Electronic Engineering,Computer Graphics and Computer-Aided Design,Hardware and Architecture
Cited by
106 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献