Timing-driven floor-planning algorithm for building block layout

Tianming Kong; Xianlong Hong

doi:10.1117/12.235562

22 March 1996 Timing-driven floor-planning algorithm for building block layout

Tianming Kong, Xianlong Hong

Proceedings Volume 2644, Fourth International Conference on Computer-Aided Design and Computer Graphics; (1996) https://doi.org/10.1117/12.235562
Event: Fourth International Conference on Computer-Aided Design and Computer Graphics, 1995, Wuhan, China

Abstract

In this paper, we propose a timing-driven floorplanning algorithm for general building block layout. Our basic idea is based on floorplan enumeration and Zero-Slack algorithm. In our system, floorplanning is performed hierarchically followed by an incremental global routing. Whenever a node in cluster tree is floorplanned, all possible floorplan patterns are enumerated and then the floorplan pattern with best timing behavior and area, shape matches is chosen as solution. Due to our work's background, without the cost of limited floorplan patterns in BEAR, we are awarded by good performance and routability. The complexity analysis is presented also.

Citation Download Citation

Tianming Kong and Xianlong Hong "Timing-driven floor-planning algorithm for building block layout", Proc. SPIE 2644, Fourth International Conference on Computer-Aided Design and Computer Graphics, (22 March 1996); https://doi.org/10.1117/12.235562

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