22 March 1996 Improved Min-cut algorithm for multiple-way VLSI network partitioning
Author Affiliations +
Proceedings Volume 2644, Fourth International Conference on Computer-Aided Design and Computer Graphics; (1996) https://doi.org/10.1117/12.235559
Event: Fourth International Conference on Computer-Aided Design and Computer Graphics, 1995, Wuhan, China
Abstract
This paper presents an improved algorithm with a new cost function for multiple way network partitioning. The new cost function based on the net cut model proposed incorporate a penalty function to take account of the potential effects of cell's move. Experiments show that not only the result of the new cost function outperforms that of F-M's algorithm, but also the erratic defect of F-M's algorithm has been partially alleviated. This new algorithm is flexible enough to be applicable to different objective functions. The time complexity of the new algorithm is O(bN), where b is the number of blocks and N the number of nets.
© (1996) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Xiangdong Tan, Xiangdong Tan, Jiarong Tong, Jiarong Tong, Pushan Tang, Pushan Tang, } "Improved Min-cut algorithm for multiple-way VLSI network partitioning", Proc. SPIE 2644, Fourth International Conference on Computer-Aided Design and Computer Graphics, (22 March 1996); doi: 10.1117/12.235559; https://doi.org/10.1117/12.235559
PROCEEDINGS
6 PAGES


SHARE
Back to Top