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 lower by 5% to 54% while achieving comparable quality in terms of cut.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Apr 17, 2003
Accession Number
ADA439577

Entities

People

  • George Karypis
  • Navaratnasothie Selvakkumaran

Organizations

  • University of Minnesota

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Computer Science
  • Computers
  • Engineering
  • High Performance Computing
  • Information Operations
  • Minnesota
  • Universities

Fields of Study

  • Computer science

Readers

  • Operations Research
  • Parallel and Distributed Computing.