22 March 1996 Timing-driven floor-planning algorithm for building block layout
Author Affiliations +
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.
© (1996) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Tianming Kong, 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); doi: 10.1117/12.235562; https://doi.org/10.1117/12.235562
PROCEEDINGS
6 PAGES


SHARE
RELATED CONTENT


Back to Top