Cataloged from PDF version of article.Hypergraph partitioning is a process that is being used to find solutions for
optimization problems in various areas, including parallel volume rendering, parallel
information retrieval and VLSI circuit design. While the current partitioning
methods are adequate for hypergraphs up to certain size, these methods start to
fail once the problem size exceeds this threshold.
In this thesis we introduce ParPaToH, a parallel p-way hypergraph partitioning
tool that makes use of a 2-D decomposition to reduce the communication
overhead and implements a parallel-computing friendly version of the accepted
multi-level partitioning paradigm to generate its partitioning. We present new
concepts in hypergraph partitioning that lead to a coarse-grain parallel solution.
Finally, we discuss the implementation of the tool in detail and present experimental
results to demonstrate its effectiveness.Karaca, EvrenM.S
