Article thumbnail
Location of Repository

Multi.objective hypergraph partitioning algorithms for cut and maximum subdomain degree minimization

By Navaratnasothie Selvakkumaran and George Karypis

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

Topics: Categories and Subject Descriptors B.7.2 [Integrated Circuits, Design Aids General Terms Algorithms, Experimentation Keywords Partitioning, Maximum Subdomain Degree, Placement, Congestion
Publisher: IEEE Computer Society
Year: 2003
OAI identifier: oai:CiteSeerX.psu:10.1.1.322.3177
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://glaros.dtc.umn.edu/gkho... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.