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

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. Categories and Subject Descriptors B.7.2 [Integrated Circuits]: Design Aids General Terms Algorithms, Experimentation Keywords Partitioning, Maximum Subdomain Degree, Placement, Congestion  This work was supported in part by NSF CCR-9972519, EIA9986042, ACI-9982274, ACI-0133464, and ACI-0312828; th...

• Type: Conference
• Year: 2003
• Where: ICCAD
• Authors: Navaratnasothie Selvakkumaran, George Karypis
• Keywords: Digital Technology Center, Hardware, Hypergraph Partitioning Algorithms, ICCAD 2003, Maximum Subdomain Degree