Congestion and performance driven full-chip scalable routing framework

Timing is one of the emerging issues in deep sub-micrometer technology which has great influence on the circuit performance. This paper presents a novel full-chip scalable routing framework, which considers the routing congestion and the circuit performance simultaneously. The framework features the fast pattern and framed shortest path global router and a maze-based congestion-driven detailed router. We also introduce a criticality-driven least flexibility prior net ordering technique which assigns timing-critical nets higher priority for performance concern. Then nets are routed one by one according to their priorities and the routing resource is updated immediately after each routing, which results in very accurate resource estimation. We have tested our routing framework on a set of commonly used benchmark circuits and compared the results with a previous multilevel routing framework. The experimental results are very promising

[1]  Thomas Lengauer,et al.  The efficient solution of integer programs for hierarchical global routing , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[2]  Jason Cong,et al.  Multilevel approach to full-chip gridless routing , 2001, IEEE/ACM International Conference on Computer Aided Design. ICCAD 2001. IEEE/ACM Digest of Technical Papers (Cat. No.01CH37281).

[3]  D. T. Lee,et al.  A Fast Crosstalk- and Performance-Driven Multilevel Routing System , 2003, ICCAD 2003.

[4]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[5]  C. Y. Lee An Algorithm for Path Connections and Its Applications , 1961, IRE Trans. Electron. Comput..

[6]  Michael Burstein,et al.  Hierarchical channel router , 1984 .

[7]  Majid Sarrafzadeh,et al.  Predictable routing , 2000, IEEE/ACM International Conference on Computer Aided Design. ICCAD - 2000. IEEE/ACM Digest of Technical Papers (Cat. No.00CH37140).

[8]  Yu-Chin Hsu,et al.  Hybrid routing , 1990, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[9]  Jiri Soukup,et al.  Fast Maze Router , 1978, 15th Design Automation Conference.

[10]  Yao-Wen Chang,et al.  Multilevel routing with antenna avoidance , 2004, ISPD '04.

[11]  Yao-Wen Chang,et al.  A novel framework for multilevel routing considering routability and performance , 2002, IEEE/ACM International Conference on Computer Aided Design, 2002. ICCAD 2002..

[12]  Ravi Nair,et al.  A Simple Yet Effective Technique for Global Wiring , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[13]  Carl Ebeling,et al.  PathFinder: A Negotiation-Based Performance-Driven Router for FPGAs , 1995, Third International ACM Symposium on Field-Programmable Gate Arrays.

[14]  Christoph Albrecht,et al.  Provably good global routing by a new approximation algorithm for multicommodity flow , 2000, ISPD '00.

[15]  Jason Cong,et al.  An enhanced multilevel routing system , 2002, IEEE/ACM International Conference on Computer Aided Design, 2002. ICCAD 2002..

[16]  Dave Hightower A solution to line-routing problems on the continuous plane , 1969, DAC '69.

[17]  U. Lauther,et al.  A new global router based on a flow model and linear assignment , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.