A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2009; you can also visit the original URL.
The file type is application/pdf
.
Parkway 2.0: A Parallel Multilevel Hypergraph Partitioning Tool
[chapter]
2004
Lecture Notes in Computer Science
We recently proposed a coarse-grained parallel multilevel algorithm for the k-way hypergraph partitioning problem. This paper presents a formal analysis of the algorithm's scalability in terms of its isoefficiency function, describes its implementation in the Parkway 2.0 tool and provides a run-time and partition quality comparison with stateof-the-art serial hypergraph partitioners. The isoefficiency function (and thus scalability behaviour) of our algorithm is shown to be of a similar order
doi:10.1007/978-3-540-30182-0_79
fatcat:sm4m2ntrb5ej7gj2ceruuzkz4e