Skip to main content
SpringerLink
Log in
Book cover

Encyclopedia of Parallel Computing pp 1479–1487Cite as

PaToH (Partitioning Tool for Hypergraphs)

  • Reference work entry

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 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 fast and high-quality solutions for these...

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   1,600.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD   1,799.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Bibliography

  1. Alpert CJ, Kahng AB (1995) Recent directions in netlist partitioning: a survey. VLSI J 19(1–2):1–81

    MATH  Google Scholar 

  2. Aykanat C, Cambazoglu BB, Uçar B (May 2008) Multi-level direct k-way hypergraphy partitioning with multiple constraints and fixed vertices. J Parallel Distrib Comput 68(5):609–625

    Google Scholar 

  3. Aykanat C, Pinar A, Çatalyürek UV (2004) Permuting sparse rectangular matrices into block-diagonal form. SIAM J Sci Comput 26(6):1860–1879

    Google Scholar 

  4. Bui TN, Jones C (1993) A heuristic for reducing fill-in sparse matrix factorization. In: Proceedings of the 6th SIAM conference on parallel processing for scientific computing, Norfolk, Virginia, pp 445–452

    Google Scholar 

  5. Catalyurek U, Boman E, Devine K, Bozdag D, Heaphy R, Riesen L (Aug 2009) A repartitioning hypergraphy model for dynamic load balancing. J Parallel Distrib Comput 69(8):711–724

    Google Scholar 

  6. Ç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/tech-reports/1999/ABSTRACTS.1999.html.

  7. Çatalyürek UV, Aykanat C (Dec 1995) A hypergraph model for mapping repeated sparse matrixvector product computations onto multicomputers. In: Proceedings of international conference on high performance computing

    Google Scholar 

  8. Çatalyürek UV, Aykanat C (1999) Hypergraph-partitioning based decomposition for parallel sparse-matrix vector multiplication. IEEE Trans Parallel Distrib Syst 10(7):673–693

    Google Scholar 

  9. Ç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)

  10. Çatalyürek UV, Aykanat C (2001) Ahypergraph-partitioning approach for coarse-grain decomposition. In: ACM/EEE SC2001, Denver, CO, November 2001

    Google Scholar 

  11. Çatalyürek UV, Aykanat C, Kayaaslan E (2009) Hypergraph partitioning-based_ll-reducing ordering. Technical Report OSUBMI-TR-2009-n02 and BU-CE-0904, The Ohio State University, Department of Biomedical Informatics and Bilkent University, Computer Engineering Department, 2009. submitted for publication

    Google Scholar 

  12. Çatalyürek UV, Aykanat C, Ucar B (2010) Ontwo-dimensional sparse matrix partitioning: models, methods, and a recipe. SIAM J Sci Comput 32(2):656–683

    MATH  MathSciNet  Google Scholar 

  13. Cheng C-K, Wei Y-C (1991) An improved two-way partitioning algorithm with stable performance. IEEE Trans Comput Aided Des 10(12):1502–1511

    Google Scholar 

  14. Dasdan A, Aykanat C (February 1997) Two novel multiway circuit partitioning algorithms using relaxed locking. IEEE Trans Comput Aided Des 16(2):169–178

    Google Scholar 

  15. Fiduccia CM, Mattheyses RM (1982) A linear-time heuristic for improving network partitions. In: Proceedings of the 19th ACM/IEEE design automation conference, pp 175–181

    Google Scholar 

  16. Hendrickson B, Leland R (1993) A multilevel algorithm for partitioning graphs. Technical reports, Sandia National Laboratories

    Google Scholar 

  17. Hoffmann A (1994) Dynamic locking heuristic – a new graph partitioning algorithm. In: Proceedings of IEEE international symposium on circuits and systems, pp 173–176

    Google Scholar 

  18. Karypis G, Kumar V (1998) A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J Sci Comput 20(1):359–392

    MathSciNet  Google Scholar 

  19. Karypis G, Kumar V (1998) Multilevel algorithms for multi-constraint graph partitioning. Technical Report98-019, University of Minnesota, Department of Computer Science/Army HPC Research Center, Minneapolis, MN 55455, May 1998

    Google Scholar 

  20. Kernighan BW, Lin S (Feb 1970) An efficient heuristic procedure for partitioning graphs. Bell SystTech J 49(2):291–307

    MATH  Google Scholar 

  21. Krishnamurthy B (May 1984) An improved min-cut algorithm for partitioning VLSI networks. IEEE Trans Comput 33(5):438–446

    MATH  MathSciNet  Google Scholar 

  22. Lengauer T (1990) Combinatorial algorithms for integrated circuitlayout. Willey–Teubner, Chichester, UK

    Google Scholar 

  23. Sanchis LA (Jan 1989) Multiple-way network partitioning. IEEE Trans Comput 38(1):62–81

    MATH  Google Scholar 

  24. Schloegel K, Karypis G, Kumar V (2000) Parallel multilevel algorithms for multi-constraint graph partitioning. In: Euro-Par, pp 296–310

    Google Scholar 

  25. Schweikert DG, Kernighan BW (1972) A proper model for the partitioning of electrical circuits. In: Proceedings of the 9th ACM/IEEE design automation conference, pp 57–62

    Google Scholar 

  26. Uçar B, Çatalyürek ÜV, Aykanat C (2010) A matrix partitioning interface to PaToH in MATLAB. Parallel Comput 36(5–6):254–272

    MATH  Google Scholar 

  27. Wei Y-C, Cheng C-K (July 1991) Ratio cut partitioning for hierarchical designs. IEEE Trans Comput Aided Des 10(7):91–921

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Biomedical Informatics, The Ohio State University, 3190 Graves Hall, 333 W. 10th Ave., 43210, Columbus, OH, USA

    Ümit Çatalyürek Ph.D.

  2. Computer Engineering Department, Bilkent University, Ankara, Turkey

    Cevdet Aykanat Ph.D.

Authors
  1. Ümit Çatalyürek Ph.D.
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Cevdet Aykanat Ph.D.
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Illinois at Urbana-Champaign, Urbana, IL, USA

    David Padua

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer Science+Business Media, LLC

About this entry

Cite this entry

Çatalyürek, Ü., Aykanat, C. (2011). PaToH (Partitioning Tool for Hypergraphs). In: Padua, D. (eds) Encyclopedia of Parallel Computing. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-09766-4_93

Download citation

Publish with us

Policies and ethics

Search

Navigation