Multiobjective hypergraph-partitioning algorithms for cut and maximum subdomain-degree minimization

Authors:
N. Selvakkumaran;G. Karypis
Affiliations:
Dept. of Comput. Sci. & Eng., Univ. of Minnesota, Minneapolis, MN, USA;-
Venue:
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Year:
2006

Citing 0
Cited 15

Similarity-aware query allocation in sensor networks with multiple base stations

DMSN '07 Proceedings of the 4th workshop on Data management for sensor networks: in conjunction with 33rd International Conference on Very Large Data Bases
Rent's rule and parallel programs: characterizing network traffic behavior

Proceedings of the 2008 international workshop on System level interconnect prediction
Guiding global placement with wire density

Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design
Heuristic search and information visualization methods for school redistricting

IAAI'06 Proceedings of the 18th conference on Innovative applications of artificial intelligence - Volume 2
Distributed evolutionary multi-objective mesh-partitioning algorithm for parallel finite element computations

Computers and Structures
A parallel preconditioning strategy for efficient transistor-level circuit simulation

Proceedings of the 2009 International Conference on Computer-Aided Design
An effective multi-level algorithm based on ant colony optimization for bisecting graph

PAKDD'07 Proceedings of the 11th Pacific-Asia conference on Advances in knowledge discovery and data mining
An effective multi-level algorithm based on simulated annealing for bisecting graph

EMMCVPR'07 Proceedings of the 6th international conference on Energy minimization methods in computer vision and pattern recognition
A software-supported methodology for exploring interconnection architectures targeting 3-D FPGAs

Proceedings of the Conference on Design, Automation and Test in Europe
An effective multi-level algorithm for bisecting graph

ADMA'06 Proceedings of the Second international conference on Advanced Data Mining and Applications
A novel framework for exploring 3-D FPGAs with heterogeneous interconnect fabric

ACM Transactions on Reconfigurable Technology and Systems (TRETS)
Tripartite community structure in social bookmarking data

The New Review of Hypermedia and Multimedia - Special issue on Social Linking and Hypermedia
An effective refinement algorithm based on swarm intelligence for graph bipartitioning

ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
Is split manufacturing secure?

Proceedings of the Conference on Design, Automation and Test in Europe
Artificial bee colony for the standard cell placement problem

International Journal of Metaheuristics

Quantified Score

Hi-index	0.03

Visualization

Abstract

In this paper, we present a family of multiobjective 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 very large scale integration (VLSI) computer-aided design (CAD) as they allow to both minimize and evenly distribute the interconnects across the physical devices. Our experimental evaluation on the International Symposium on Physical Design (ISPD98) benchmark show that our algorithms produce solutions, which when compared against those produced by hMETIS have a maximum subdomain degree that is reduced by up to 36% while achieving comparable quality in terms of cut.