CAJ | 학술논문

提出了一种降低走线拥挤的标准单元增量式布局算法C-ECOP.首先通过一种新型的布线模型来估计芯片上的走线情况,然后构造一个整数线性规划问题来解决可能出现的相邻拥挤区域冲突问题.实验结果表明该算法能够有效地降低走线拥挤,保证初始布局的质量,并且具有很高的效率.
제출료일충강저주선옹제적표준단원증량식포국산법C-ECOP.수선통과일충신형적포선모형래고계심편상적주선정황,연후구조일개정수선성규화문제래해결가능출현적상린옹제구역충돌문제.실험결과표명해산법능구유효지강저주선옹제,보증초시포국적질량,병차구유흔고적효솔.
A new incremental placement algorithm C-ECOP for standard cell layout is presented to reduce routing congestion.It first estimates the routing congestion through a new routing model.Then,it formulates an integer linear programming (ILP) problem to determine cell flow direction and to avoid the conflictions 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.