Improved Min-cut algorithm for multiple-way VLSI network partitioning

Xiangdong Tan; Jiarong Tong; Pushan Tang

doi:10.1117/12.235559

22 March 1996 Improved Min-cut algorithm for multiple-way VLSI network partitioning

Xiangdong Tan, Jiarong Tong, Pushan Tang

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.

Citation Download Citation

Xiangdong Tan, Jiarong Tong, and 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); https://doi.org/10.1117/12.235559

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available