MR: a new framework for multilevel full-chip routing

In this paper, we propose a novel framework for multilevel full-chip routing considering both routability and performance called MR. The two-stage multilevel framework consists of coarsening, followed by uncoarsening. Unlike the previous multilevel routing, MR integrates global routing, detailed routing, and resource estimation, together at each level of the framework, leading to more accurate routing resource estimation during coarsening and thus facilitating the solution refinement during uncoarsening. Further, the exact routing information obtained at each level makes MR more flexible in dealing with various routing objectives (such as crosstalk, power, etc.). Experimental results show that MR obtains significantly better routing solutions than previous works. For example, for a set of 11 commonly used benchmark circuits, MR achieves 100% routing completion for all circuits, while the previous multilevel routing, the three-level routing, and the hierarchical routing can complete routing for only 2, 0, 2 circuits, respectively. In particular, the number of routing layers used by MR is even smaller. We also have performed experiments on timing-driven routing. The results are also very promising.

[1]  Yao-Wen Chang,et al.  Multilevel floorplanning/placement for large-scale modules using B*-trees , 2003, DAC '03.

[2]  Jason Cong,et al.  DUNE: a multi-layer gridless routing system with wire planning , 2000, ISPD '00.

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

[4]  Shuji Tsukiyama,et al.  A Hybrid Hierarchical Global Router for Multi-Layer VLSI's , 1995 .

[5]  Dongsheng Wang,et al.  A new timing-driven multilayer MCM/IC routing algorithm , 1997, Proceedings 1997 IEEE Multi-Chip Module Conference.

[6]  Joseph R. Shinnerl,et al.  Multilevel optimization for large-scale circuit placement , 2000, IEEE/ACM International Conference on Computer Aided Design. ICCAD - 2000. IEEE/ACM Digest of Technical Papers (Cat. No.00CH37140).

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

[8]  D. Hightower,et al.  A solution to line routing problems on the continuous plane , 1988 .

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

[10]  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).

[11]  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.

[12]  Christoph Albrecht,et al.  Global routing by new approximation algorithms for multicommodityflow , 2001, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[13]  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).

[14]  Yao-Wen Chang,et al.  Timing-driven routing for symmetrical array-based FPGAs , 2000, TODE.

[15]  Jason Cong,et al.  Performance driven global routing for standard cell design , 1997, ISPD '97.

[16]  Shin'ichi Wakabayashi,et al.  Timing-driven hierarchical global routing with wire-sizing and buffer-insertion for VLSI with multi-routing-layer , 2000, ASP-DAC '00.

[17]  Jason Cong,et al.  Performance driven multi-level and multiway partitioning with retiming , 2000, Proceedings 37th Design Automation Conference.

[18]  Andrew B. Kahng,et al.  Multilevel circuit partitioning , 1998, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[19]  Jason Cong,et al.  Provably good performance-driven global routing , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[20]  Chung-Kuan Cheng,et al.  New performance driven routing techniques with explicit area/delay tradeoff and simultaneous wire sizing , 1996, DAC '96.

[21]  Shashi Shekhar,et al.  Multilevel hypergraph partitioning: applications in VLSI domain , 1999, IEEE Trans. Very Large Scale Integr. Syst..

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

[23]  Shashi Shekhar,et al.  Multilevel hypergraph partitioning: application in VLSI domain , 1997, DAC.

[24]  Yao-Wen Chang,et al.  A novel framework for multilevel routing considering routability and performance , 2002, ICCAD 2002.