Dynamic tree reconstruction with application to timing-constrained congestion-driven global routing

In this paper, based on timing-constrained Steiner-point location flexibility in any Y-type wire, a dynamic SA-based timing-constrained flexibility-driven SRT (DSTF/spl I.bar/SRT) approach with the congestion weighs is firstly proposed to obtain a better timing-constrained flexibility-driven SRT by reassigning the feasible locations of the Steiner points in a SRT. Furthermore, the concept of dynamic tree reconstruction is applied to timing-constrained congestion-driven global routing. The experimental results show that our proposed TCGR/spl I.bar/DTR algorithm can obtain a better timing-constrained congestion-driven global routing result than the HBA+TRR [Hu, 2000] and TCGR [Yan, 2004] algorithm for the tested benchmark circuits.