Timing-Driven Entire Spacing Global Routing
Cad La · Dianzi xuebao · 1998
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.