PaToH (Partitioning Tool for Hypergraphs)
 Ümit Çatalyürek Ph.D.,
 Cevdet Aykanat Ph.D.
 … show all 2 hide
Synonyms
Partitioning tool for hypergraphs (PaToH)
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 onedimensional and twodimensional partitioning of sparse matrices for parallel sparsematrix vector multiplication [6–8, 12], sparse matrix reordering [6, 11], permuting sparse rectangular matrices into singly bordered blockdiagonal 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 fast and highquality so ...
 Alpert, CJ, Kahng, AB (1995) Recent directions in netlist partitioning: a survey. VLSI J 19: pp. 181
 Aykanat, C, Cambazoglu, BB, Uçar, B (2008) Multilevel direct kway hypergraphy partitioning with multiple constraints and fixed vertices. J Parallel Distrib Comput 68: pp. 609625
 Aykanat, C, Pinar, A, Çatalyürek, UV (2004) Permuting sparse rectangular matrices into blockdiagonal form. SIAM J Sci Comput 26: pp. 18601879
 Bui, TN, Jones, C (1993) A heuristic for reducing fillin sparse matrix factorization. pp. 445452
 Catalyurek, U, Boman, E, Devine, K, Bozdag, D, Heaphy, R, Riesen, L (2009) A repartitioning hypergraphy model for dynamic load balancing. J Parallel Distrib Comput 69: pp. 711724
 Çatalyürek UV (1999) Hypergraph models for sparse matrix partitioning and reordering. Ph.D.thesis, Bilkent University, Computer Engineering and Information Science, Nov 1999. http://www.cs.bilkent.edu.tr/techreports/1999/ABSTRACTS.1999.html.
 Çatalyürek, UV, Aykanat, C (1995) A hypergraph model for mapping repeated sparse matrixvector product computations onto multicomputers. Proceedings of international conference on high performance computing.
 Çatalyürek, UV, Aykanat, C (1999) Hypergraphpartitioning based decomposition for parallel sparsematrix vector multiplication. IEEE Trans Parallel Distrib Syst 10: pp. 673693
 Çatalyürek UV, Aykanat C (1999) PaToH: a multilevel hypergraph partitioning tool, version 3.0. Bilkent University, Department of Computer Engineering, Ankara, 06533 Turkey.PaToH. http://bmi.osu.edu/∼umit/software.html, 1999 (accessed on November 26, 2010)
 Çatalyürek, UV, Aykanat, C (2001) Ahypergraphpartitioning approach for coarsegrain decomposition.
 Çatalyürek UV, Aykanat C, Kayaaslan E (2009) Hypergraph partitioningbased_llreducing ordering. Technical Report OSUBMITR2009n02 and BUCE0904, The Ohio State University, Department of Biomedical Informatics and Bilkent University, Computer Engineering Department, 2009. submitted for publication
 Çatalyürek, UV, Aykanat, C, Ucar, B (2010) Ontwodimensional sparse matrix partitioning: models, methods, and a recipe. SIAM J Sci Comput 32: pp. 656683
 Cheng, CK, Wei, YC (1991) An improved twoway partitioning algorithm with stable performance. IEEE Trans Comput Aided Des 10: pp. 15021511
 Dasdan, A, Aykanat, C (1997) Two novel multiway circuit partitioning algorithms using relaxed locking. IEEE Trans Comput Aided Des 16: pp. 169178
 Fiduccia, CM, Mattheyses, RM (1982) A lineartime heuristic for improving network partitions. pp. 175181
 Hendrickson, B, Leland, R (1993) A multilevel algorithm for partitioning graphs. Technical reports, Sandia National Laboratories
 Hoffmann, A (1994) Dynamic locking heuristic – a new graph partitioning algorithm. Proceedings of IEEE international symposium on circuits and systems. pp. 173176
 Karypis, G, Kumar, V (1998) A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J Sci Comput 20: pp. 359392
 Karypis, G, Kumar, V (1998) Multilevel algorithms for multiconstraint graph partitioning. University of Minnesota, Department of Computer Science/Army HPC Research Center, Minneapolis, MN
 Kernighan, BW, Lin, S (1970) An efficient heuristic procedure for partitioning graphs. Bell SystTech J 49: pp. 291307
 Krishnamurthy, B (1984) An improved mincut algorithm for partitioning VLSI networks. IEEE Trans Comput 33: pp. 438446
 Lengauer, T (1990) Combinatorial algorithms for integrated circuitlayout. Willey–Teubner, Chichester, UK
 Sanchis, LA (1989) Multipleway network partitioning. IEEE Trans Comput 38: pp. 6281
 Schloegel, K, Karypis, G, Kumar, V (2000) Parallel multilevel algorithms for multiconstraint graph partitioning. EuroPar. pp. 296310
 Schweikert, DG, Kernighan, BW (1972) A proper model for the partitioning of electrical circuits. pp. 5762
 Uçar, B, Çatalyürek, ÜV, Aykanat, C (2010) A matrix partitioning interface to PaToH in MATLAB. Parallel Comput 36: pp. 254272
 Wei, YC, Cheng, CK (1991) Ratio cut partitioning for hierarchical designs. IEEE Trans Comput Aided Des 10: pp. 91921
 Title
 PaToH (Partitioning Tool for Hypergraphs)
 Reference Work Title
 Encyclopedia of Parallel Computing
 Pages
 pp 14791487
 Copyright
 2011
 DOI
 10.1007/9780387097664_93
 Print ISBN
 9780387097657
 Online ISBN
 9780387097664
 Publisher
 Springer US
 Copyright Holder
 Springer Science+Business Media, LLC
 Additional Links
 Topics
 Industry Sectors
 eBook Packages
 Editors

 David Padua ^{(401)}
 Editor Affiliations

 401. University of Illinois at UrbanaChampaign
 Authors

 Ümit Çatalyürek Ph.D. ^{(1)}
 Cevdet Aykanat Ph.D. ^{(2)}
 Author Affiliations

 1. Department of Biomedical Informatics, The Ohio State University, 3190 Graves Hall, 333 W. 10th Ave., 43210, Columbus, OH, USA
 2. Computer Engineering Department, Bilkent University, Ankara, Turkey
Continue reading...
To view the rest of this content please follow the download PDF link above.