loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
19th International Conference on VLSI Design held jointly with 5th International Conference on Embedded Systems Design (VLSID'06)
Dynamic Tree Reconstruction with Application to Timing-Constrained Congestion-Driven Global Routing
Hyderabad, India
January 03-January 07
ISBN: 0-7695-2502-4
Jin-Tai Yan, Chung Hua University
Chia-Fang Lee, Chung Hua University
Yen-Hsiang Chen, Chung Hua University
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_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_DTR algorithm can obtain a better timing-constrained congestion-driven global routing result than the HBA+TRR[8] and TCGR[9] algorithm for the tested benchmark circuits.
Citation:
Jin-Tai Yan, Chia-Fang Lee, Yen-Hsiang Chen, "Dynamic Tree Reconstruction with Application to Timing-Constrained Congestion-Driven Global Routing," vlsid, pp.147-152, 19th International Conference on VLSI Design held jointly with 5th International Conference on Embedded Systems Design (VLSID'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.