Rao, Nagendra PS and Jayathirtha, CS and Prasad, Raghavendra CS (1998) New Net Models for Spectral Netlist Partitioning. In: 1998 Eleventh International Conference on VLSI Design, 4-7 January, Chennai,India, 406 -411.
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.
|Item Type:||Conference Paper|
|Additional Information:||Copyright 1990 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.|
|Department/Centre:||Division of Electrical Sciences > Electrical Engineering|
|Date Deposited:||10 Apr 2006|
|Last Modified:||19 Sep 2010 04:25|
Actions (login required)