By Topic

New net models for spectral netlist partitioning

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
P. S. N. Rao ; Dept. of Electr. Eng., Indian Inst. of Sci., Bangalore, India ; C. S. Jayathirtha ; C. S. Raghavendraprasad

Spectral approaches for partitioning netlists that use the eigenvectors of a matrix derived from a weighted graph model of the netlist (hypergraph) have been attracting considerable attention. There are several known ways in which a weighted graph could be derived from the netlist. However, the effectiveness of these alternate net models for netlist partitioning has remained unexplored. In this paper we first evaluate the relative performance of these approaches and establish that the quality of the partition is sensitive to the choice of the model. We also propose and investigate a number of new approaches for deriving a weighted graph model for a netlist. We show through test results on benchmark partitioning problems that one of the new models proposed here, performs consistently better than all the other models

Published in:

VLSI Design, 1998. Proceedings., 1998 Eleventh International Conference on

Date of Conference:

4-7 Jan 1998