摘要
本文结出了一个新的时延驱动的整体布线算法．算法采用了整平面布线技术，从而具有快速求解的特点且无网序问题的困扰．算法优化的目标是使所有线网的最大时延之和最小，尤其是在关键路径上的线网实际电路的布线结果表明该算法可有效地改善关键路径上线网的时延．
A noval timing-driven global routing algorithm is presented in this paper. Because of using entire spacing method, it is fast and independent of the order of nets. The objecTive is minimization of to tal delay of all nets, especially in critical path. Experimental results have shown that it can efficiently improve the delays of nets in critical path.
出处
《电子学报》
EI
CAS
CSCD
北大核心
1998年第8期135-138,共4页
Acta Electronica Sinica
基金
国家自然科学基金!No.69676023
国家重点科技攻关项目!No.96-738-08-05
关键词
时延
布线
整平面方法
VLSI
Tinting delay, Routing, Entire spacing method
