Output details

Parallel multilevel algorithms for hypergraph partitioning

<12>This paper presents parallel algorithms for a challenging combinatorial problem, namely large-scale hypergraph partitioning. The latter provides a flexible and powerful alternative to graph partitioning and has application to numerous scientific problems such as circuit layout, data placement for efficient parallel computation and distributed database design. The algorithms have been implemented in the open-source Parkway hypergraph partitioning tool (see http://www.doc.ic.ac.uk/~at701/parkway/). Parkway has been downloaded +/- 250 times a year and remains one of only two parallel hypergraph partitioners available - the other is Zoltan developed at Sandia National Labs by a team of 17 international researchers (see http://www.cs.sandia.gov/Zoltan/).