ParPaToH: Bir 2-boyutlu paralel hiperçizge bölümleme aracı

Hypergraph partitioning is a process that is being used to find solutions foroptimization problems in various areas, including parallel volume rendering, par-allel information retrieval and VLSI circuit design. While the current partitioningmethods are adequate for hypergraphs up to certain size, these methods start tofail once the problem size exceeds this threshold.In this thesis we introduce ParPaToH, a parallel p-way hypergraph partition-ing tool that makes use of a 2-D decomposition to reduce the communicationoverhead and implements a parallel-computing friendly version of the acceptedmulti-level partitioning paradigm to generate its partitioning. We present newconcepts in hypergraph partitioning that lead to a coarse-grain parallel solution.Finally, we discuss the implementation of the tool in detail and present experi-mental results to demonstrate its effectiveness.Keywords: Multilevel hypergraph partitioning, parallel computing.iii