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

Navaratnasothie Selvakkumaran; George Karypis

doi:10.1109/iccad.2003.159757

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

Navaratnasothie Selvakkumaran, George Karypis

Computer Science and Engineering

Research output: Contribution to journal › Conference article › peer-review

42 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 language	English (US)
Pages (from-to)	726-733
Number of pages	8
Journal	IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers
DOIs	https://doi.org/10.1109/iccad.2003.159757
State	Published - 2003
Event	IEEE/ACM International Conference on Computer Aided Design ICCAD 2003: IEEE/ACM Digest of Technical Papers - San Jose, CA, United States Duration: Nov 9 2003 → Nov 13 2003

Keywords

Congestion
Maximum Subdomain Degree
Partitioning
Placement

Publisher link

10.1109/iccad.2003.159757

Find It

Find It at U of M Libraries

Cite this

@article{a2031bae5e784bd489c21d76be37a74d,

title = "Multi-Objective Hypergraph Partitioning Algorithms for Cut and Maximum Subdomain Degree Minimization",

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.",

keywords = "Congestion, Maximum Subdomain Degree, Partitioning, Placement",

author = "Navaratnasothie Selvakkumaran and George Karypis",

year = "2003",

doi = "10.1109/iccad.2003.159757",

language = "English (US)",

pages = "726--733",

journal = "IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers",

issn = "1092-3152",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

note = "IEEE/ACM International Conference on Computer Aided Design ICCAD 2003: IEEE/ACM Digest of Technical Papers ; Conference date: 09-11-2003 Through 13-11-2003",

}

TY - JOUR

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

AU - Selvakkumaran, Navaratnasothie

AU - Karypis, George

PY - 2003

Y1 - 2003

N2 - 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.

AB - 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.

KW - Congestion

KW - Maximum Subdomain Degree

KW - Partitioning

KW - Placement

UR - http://www.scopus.com/inward/record.url?scp=0348040102&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0348040102&partnerID=8YFLogxK

U2 - 10.1109/iccad.2003.159757

DO - 10.1109/iccad.2003.159757

M3 - Conference article

AN - SCOPUS:0348040102

SN - 1092-3152

SP - 726

EP - 733

JO - IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers

JF - IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers

T2 - IEEE/ACM International Conference on Computer Aided Design ICCAD 2003: IEEE/ACM Digest of Technical Papers

Y2 - 9 November 2003 through 13 November 2003

ER -

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

Abstract

Keywords

Publisher link

Find It

Other files and links

Fingerprint

Cite this