Multi-Objective Hypergraph Partitioning Algorithms for Cut and Maximum Subdomain Degree Minimization

Navaratnasothie Selvakkumaran, George Karypis

Research output: Contribution to journalConference articlepeer-review

34 Scopus citations

Abstract

In this paper we present a family of multi-objective hypergraph partitioning algorithms based on the multilevel paradigm, which are capable of producing solutions in which both the cut and the maximum subdomain degree are simultaneously minimized. This type of partitionings are critical for existing and emerging applications in VLSI CAD as they allow to both minimize and evenly distribute the interconnects across the physical devices. Our experimental evaluation on the ISPD98 benchmark show that our algorithms produce solutions that when compared against those produced by hMETIS have a maximum subdomain degree that is reduced by up to 35% while achieving comparable quality in terms of cut.

Original languageEnglish (US)
Pages (from-to)726-733
Number of pages8
JournalIEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers
DOIs
StatePublished - 2003
EventIEEE/ACM International Conference on Computer Aided Design ICCAD 2003: IEEE/ACM Digest of Technical Papers - San Jose, CA, United States
Duration: Nov 9 2003Nov 13 2003

Keywords

  • Congestion
  • Maximum Subdomain Degree
  • Partitioning
  • Placement

Fingerprint Dive into the research topics of 'Multi-Objective Hypergraph Partitioning Algorithms for Cut and Maximum Subdomain Degree Minimization'. Together they form a unique fingerprint.

Cite this