In this paper we present a coarse-grained parallel multilevel algorithm for the k-way hypergraph partitioning problem. The algorithm significantly improves on our previous work in terms of run time and scalability behaviour by improving processor utilisation, reducing synchronisation overhead and avoiding disk contention. The new algorithm is also generally applicable and no longer requires a particular structure of the input hypergraph to achieve a good partition quality.
We present results which show that the algorithm has good scalability properties on very large hypergraphs with Theta(10^7) vertices and consistently outperforms the approximate partitions produced by a state-of-the-art parallel graph partitioning tool in terms of partition quality, by up to 27%.
Information from pubs.doc.ic.ac.uk/tri-kno-ispdc04.