Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Computer and Information Sciences

ISCIS 2004: Computer and Information Sciences - ISCIS 2004 pp 789–800Cite as

Parkway 2.0: A Parallel Multilevel Hypergraph Partitioning Tool

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3280))

Abstract

We recently proposed a coarse-grained parallel multilevel algorithm for the k-way hypergraph partitioning problem. This paper presents a formal analysis of the algorithm’s scalability in terms of its isoefficiency function, describes its implementation in the Parkway 2.0 tool and provides a run-time and partition quality comparison with state-of-the-art serial hypergraph partitioners. The isoefficiency function (and thus scalability behaviour) of our algorithm is shown to be of a similar order as that for Kumar and Karypis’ parallel multilevel graph partitioning algorithm. This good theoretical scalability is backed up by empirical results on hypergraphs taken from the VLSI and performance modelling application domains. Further, partition quality in terms of the k-1 metric is shown to be competitive with the best serial hypergraph partitioners and degrades only minimally as more processors are used.

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   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alpert, C.J.: The ISPD 1998 Circuit Benchmark Suite. In: Proc. International Symposium of Physical Design, pp. 80–85 (1998)

    Google Scholar 

  2. Alpert, C.J., Huang, J.H., Kahng, A.B.: Recent Directions in Netlist Partitioning. Integration, the VLSI Journal 19(1-2), 1–81 (1995)

    Article  MATH  Google Scholar 

  3. Caldwell, A.E., Kahng, A.B., Markov, I.L.: Improved Algorithms for Hypergraph Bipartitioning. In: Proc. 2000 ACM/IEEE Conference on Asia South Pacific Design Automation, pp. 661–666 (2000)

    Google Scholar 

  4. Catalyurek, U.V., Aykanat, C.: Hypergraph-Partitioning-Based Decomposition for Parallel Sparse-Matrix Vector Multiplication. IEEE Transactions on Parallel and Distributed Systems 10(7), 673–693 (1999)

    Article  Google Scholar 

  5. Catalyurek. U.V., Aykanat. C.: PaToH: Partitioning Tool for Hypergraphs, Version 3.0 (2001)

    Google Scholar 

  6. Dutt, S., Deng, W.: A Probability-based Approach to VLSI Circuit Partitioning. In: Proc. 33rd Annual Design Automation Conference, pp. 100–105 (1996)

    Google Scholar 

  7. Dutt, S., Deng, W.: VLSI Circuit Partitioning by Cluster-Removal Using Iterative Improvement Techniques. In: Proc. 1996 IEEE/ACM International Conference on Computer-Aided Design, pp. 194–200 (1996)

    Google Scholar 

  8. Dutt, S., Theny, H.: Partitioning Around Roadblocks: Tackling Constraints with Intermediate Relaxations. In: Proc. 1997 IEEE/ACM International Conference on Computer-Aided Design, pp. 350–355 (1997)

    Google Scholar 

  9. Fiduccia, C.M., Mattheyses, R.M.: A Linear Time Heuristic For Improving Network Partitions. In: Proc. 19th IEEE Design Automation Conference, pp. 175–181 (1982)

    Google Scholar 

  10. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Co., New York (1979)

    MATH  Google Scholar 

  11. Grama, A., Gupta, A., Karypis, G., Kumar, V.: Introduction to Parallel Computing, 2nd edn. Addison-Wesley, Reading (2003)

    Google Scholar 

  12. Karypis, G.: Multilevel Hypergraph Partitioning. Technical Report, 02-25, University of Minnesota (2002)

    Google Scholar 

  13. Karypis, G., Kumar, V.: hMeTiS: A Hypergraph Partitioning Package, Version 1.5.3. University of Minnesota (1998)

    Google Scholar 

  14. Karypis, G., Kumar, V.: Multilevel k-way Hypergraph Partitioning. Technical Report, 98-036, University of Minnesota (1998)

    Google Scholar 

  15. Karypis, G., Kumar, V.: A Parallel Algorithm for Multilevel Graph Partitioning and Sparse Matrix Ordering. Journal of Parallel and Distributed Computing 48, 71–95 (1998)

    Article  Google Scholar 

  16. Karypis, G., Schloegel, K., Kumar, V.: ParMeTiS: Parallel Graph Partitioning and Sparse Matrix Ordering Library, Version 3.0. University of Minnesota (2002)

    Google Scholar 

  17. Knottenbelt, W.J.: Parallel Performance Analysis of Large Markov Models. PhD. Thesis, Imperial College, London, United Kingdom (2000)

    Google Scholar 

  18. Krishnamurthy, B.: An Improved min-cut Algorithm for Partitioning VLSI Networks. IEEE Transactions on Computers 33(C), 438–446 (1984)

    Article  MATH  Google Scholar 

  19. Snir, M., Otto, S., Huss-Lederman, S., Walker, D., Dongarra, J.: MPI – The Complete Reference, 2nd edn. MIT Press, Cambridge (1998)

    Google Scholar 

  20. Trifunovic, A., Knottenbelt, W.J.: A Parallel Algorithm for Multilevel k-way Hypergraph Partitioning. In: Proc. 3rd International Symposium on Parallel and Distributed Computing, University College Cork, Ireland (2004)

    Google Scholar 

  21. Trifunovic, A., Knottenbelt, W.J.: Towards a Parallel Disk-Based Algorithm for Multilevel k-way Hypergraph Partitioning. In: Proc. 5th Workshop on Parallel and Distributed Scientific and Engineering Computing, Santa Fe, NM, USA (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computing, Imperial College London, South Kensington Campus, London, SW7 2AZ, UK

    Aleksandar Trifunovic & William J. Knottenbelt

Authors
  1. Aleksandar Trifunovic
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. William J. Knottenbelt
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Engineering, Bilkent University, TR-06800, Bilkent, Ankara, Turkey

    Cevdet Aykanat

  2. No Affiliation,  

    Tuǧrul Dayar

  3. Department of Computer Engineering, Bilkent University, 06800, Bilkent, Ankara, Turkey

    İbrahim Körpeoğlu

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Trifunovic, A., Knottenbelt, W.J. (2004). Parkway 2.0: A Parallel Multilevel Hypergraph Partitioning Tool. In: Aykanat, C., Dayar, T., Körpeoğlu, İ. (eds) Computer and Information Sciences - ISCIS 2004. ISCIS 2004. Lecture Notes in Computer Science, vol 3280. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30182-0_79

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30182-0_79

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23526-2

  • Online ISBN: 978-3-540-30182-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation