ABSTRACT
It is well known that congestion control becomes more and more important in modern grid-based routing process. In this paper, a timing-constrained congestion-driven global routing approach is proposed to obtain initial congestion-driven global routing result without destroying the timing constraint of any routing net, and a post-processing simulated-annealing-based rip-up-and-reroute improvement is proposed to release the congestion of the grid edges. As mentioned in experimental results, the proposed TCGR+STRR algorithm can obtain near 100% global routability in congestion control for the tested benchmark circuits.
- D. Wang and E. S. Kuh, "Performance-driven interconnect global routing," Great Lake Symp. VLSI, pp. 132--136, 1996. Google ScholarDigital Library
- J. Huang, X. L. Hong, C. K. Cheng, and E. S. Kuh, "An efficient timing-driven global routing algorithm," ACM/IEEE Design Automation Conf., pp. 596--600, 1993. Google ScholarDigital Library
- X. Hong, T. Xue, J. Huang, C. K. Cheng, and E. S. Kuh, "TIGER: An efficient timing-driven global router for gate array and standard cell layout design," IEEE Trans. Computer-Aided Design, Vol. 16, pp. 1323--1331, 1997. Google ScholarDigital Library
- J. Cong and P. H. Madden, "Performance-driven global routing for standard cell design," ACM Int. Symp. Phys. Design, pp. 73--80, 1997. Google ScholarDigital Library
- J. Cong and P. H. Madden, "Performance driven multi-layer general area routing for PCB/MCM designs," ACM/IEEE Design Automation Conference, pp. 356--361, 1998. Google ScholarDigital Library
- K. Zhu, Y. W. Chang, and D. F. Wong, "Timing-driven routing for symmetrical-array-based FPGAs," IEEE Int. Conf. Computer Design, pp. 628--633, 1998. Google ScholarDigital Library
- J. Hu and S. S. Sapatnekar, "A timing-constrained simultaneous global routing algorithm," IEEE Trans. Computer-Aided Design, Vol. 21, pp. 1025--1036, 2002. Google ScholarDigital Library
- H. Hou, J. Hu, and S. S. Sapatnekar, "Non-Hanan routing," IEEE Trans. Computer-Aided Design, Vol. 18, pp. 436--444, 1999. Google ScholarDigital Library
Recommendations
Dynamic Tree Reconstruction with Application to Timing-Constrained Congestion-Driven Global Routing
VLSID '06: Proceedings of the 19th International Conference on VLSI Design held jointly with 5th International Conference on Embedded Systems DesignIn 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-...
Congestion-Constrained Layer Assignment for Via Minimization in Global Routing
In this paper, we study the problem of layer assignment for via minimization, which arises during multilayer global routing. In addressing this problem, we take the total overflow and the maximum overflow as the congestion constraints from a given one-...
A Timing Driven Congestion Aware Global Router
EAIT '11: Proceedings of the 2011 Second International Conference on Emerging Applications of Information TechnologyThe multi-net Global Routing Problem (GRP) is a problem of routing a set of nets subject to resources and delay constraints. Many modern routers use FLUTE (Fast Lookup Table Based Rectilinear Steiner Minimal Tree Algorithm for VLSI Design) as the basic ...
Comments