- Free Articles
-
Time in Philosophical Logic
Encyclopedia of Database Systems
-
Indoor Localization
Encyclopedia of GIS
-
Suffix Tree Construction in Hierarchical Memory
Encyclopedia of Algorithms
-
Probabilistic Data Forwarding in Wireless Sensor Networks
Encyclopedia of Algorithms
-
Renaming
Encyclopedia of Algorithms
- More Free Articles
This is the free portion of the full article.
The full article
is available to licensed users only.
How do I get access?
PaToH (Partitioning Tool for Hypergraphs)
Synonyms
Definition
PaToH is a sequential, multilevel, hypergraph partitioning tool that can be used to solve various combinatorial scientific computing problems that could be modeled as hypergraph partitioning problem, including sparse matrix partitioning, ordering, and load balancing for parallel processing.
Discussion
Introduction
Hypergraph partitioning has been an important problem widely encountered in VLSI layout design [22]. Recent works since the late 1990s have introduced new application areas, including one-dimensional and two-dimensional partitioning of sparse matrices for parallel sparse-matrix vector multiplication [6-8, 12], sparse matrix reordering [6, 11], permuting sparse rectangular matrices into singly bordered block-diagonal form for parallel solution of LP problems [3], and static and dynamic load balancing for parallel processing [5]. PaToH [9] has been developed to provide