DocumentCode
2736079
Title
A clustering based linear ordering algorithm for K-way spectral partitioning
Author
Lin, Shiuann-Shiuh ; Chen, Wen-Hsin ; Lin, Wen-Wei ; Hwang, Ting
Author_Institution
Dept. of Comput. Sci., Nat. Tsing Hua Univ., Hsinchu, Taiwan
fYear
1999
fDate
18-21 Jan 1999
Firstpage
77
Abstract
The spectral method can lead to a high quality of multi-way partition due to its ability to capture global netlist information. For spectral partition, n netlist modules are mapped to n points in d-dimensional space, and then a linear ordering of these n modules is constructed to be used as a basis for partitioning. In this paper, we propose two clustering based linear ordering algorithms taking into consideration the objective function presented
Keywords
C language; graph theory; logic CAD; logic partitioning; K-way spectral partitioning; clustering based linear ordering algorithm; d-dimensional space; global netlist information; netlist modules; objective function; spectral method; Circuits; Clustering algorithms; Computer science; Cost function; Ear; Eigenvalues and eigenfunctions; Laplace equations; Mathematics; Partitioning algorithms; Symmetric matrices;
fLanguage
English
Publisher
ieee
Conference_Titel
Design Automation Conference, 1999. Proceedings of the ASP-DAC '99. Asia and South Pacific
Conference_Location
Wanchai
Print_ISBN
0-7803-5012-X
Type
conf
DOI
10.1109/ASPDAC.1999.759714
Filename
759714
Link To Document