Thumbnail
Access Restriction
Subscribed

Author Zhuoyuan Li ♦ Weimin Wu ♦ Xianlong Hong
Sponsorship IEEE Circuits & Syst. Soc. ♦ ACM SIGDA ♦ IEICE (Inst. Electon., Inf. & Commun. Eng.) ♦ IPSJ (Inf. Process. Soc. Japan)
Source IEEE Xplore Digital Library
Content type Text
Publisher Institute of Electrical and Electronics Engineers, Inc. (IEEE)
File Format PDF
Copyright Year ©2003
Language English
Subject Domain (in DDC) Technology ♦ Engineering & allied operations
Subject Keyword Routing ♦ Integer linear programming ♦ Wire ♦ Partitioning algorithms ♦ Cost function ♦ Very large scale integration
Abstract Congestion minimization is the least understood in placement objectives, however, it models routability most accurately. In this paper, a new incremental placement algorithm ,C-ECOP, for standard cell layout, is presented to reduce routing congestion. Congestion estimation is based on a new routing model and a more accurate cost function. An integer linear programming (ILP) problem is formulated to determine cell flow direction and avoid conflicts between adjacent congestion areas. Experimental results show that the algorithm can considerably reduce routing congestion and preserve the performance of the initial placement with high speed.
Description Author affiliation: Dept. of Comput. Sci. & Technol., Tsinghua Univ., Beijing, China (Zhuoyuan Li; Weimin Wu; Xianlong Hong)
ISBN 0780376595
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research ♦ Reading
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2003-01-24
Publisher Place Japan
Rights Holder Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Size (in Bytes) 485.53 kB
Page Count 6
Starting Page 723
Ending Page 728


Source: IEEE Xplore Digital Library