Title :
Random walks for circuit clustering
Author :
Cong, Jason ; Hagen, Lars ; Kahng, Andrew
Author_Institution :
Dept. of Comput. Sci., California Univ., Los Angeles, CA, USA
Abstract :
The authors introduce a fast, parallelizable approach to circuit clustering based on analysis of random walks in the netlist. The method yields good clustering solutions for classes of `difficult´ inputs in the literature as well as for industry benchmark circuits. The authors characterize their results using a new clustering metric which facilitates comparison with future work. Extensions to a number of other CAD applications are proposed
Keywords :
application specific integrated circuits; circuit layout CAD; random functions; ASIC; circuit clustering; circuit partitioning; clustering metric; clustering solutions; industry benchmark circuits; netlist; netlist hypergraph; random walks analysis; Circuits; Simulated annealing; Stochastic processes;
Conference_Titel :
ASIC Conference and Exhibit, 1991. Proceedings., Fourth Annual IEEE International
Conference_Location :
Rochester, NY
Print_ISBN :
0-7803-0101-3
DOI :
10.1109/ASIC.1991.242897
