An enhanced multilevel routing system

In this paper, we present several novel techniques that make the recently published multilevel routing scheme [19] more effective and complete. Our contributions include: (1) resource reservation for local nets during the coarsening process, (2) congestion-driven, graph-based Steiner tree construction during the initial routing and the refinement process and (3) multi-iteration refinement considering the congestion history. The experiments show that each of these techniques helps to improve the completion rate considerately. Compared to [19], the new routing system reduces the number of failed nets by 2× to 18×, with less than 50% increase in runtime in most cases.

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

[2]  R. Pelavin,et al.  Hierarchical channel router , 1988, 25 years of DAC.

[3]  Chak-Kuen Wong,et al.  A powerful global router: based on Steiner min-max trees , 1989, 1989 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[4]  Jason Cong,et al.  Pseudo pin assignment with crosstalk noise control , 2000, ISPD '00.

[5]  Jason Cong,et al.  An implicit connection graph maze routing algorithm for ECO routing , 1999, 1999 IEEE/ACM International Conference on Computer-Aided Design. Digest of Technical Papers (Cat. No.99CH37051).

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

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

[8]  Chung-Kuan Cheng,et al.  A global router with a theoretical bound on the optimal solution , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[9]  Kinya Tabuchi,et al.  A computer program for optimal routing of printed circuit conductors , 1968, IFIP Congress.

[10]  Jason Cong,et al.  Pseudopin assignment with crosstalk noise control , 2001, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

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

[12]  Chak-Kuen Wong,et al.  A weighted Steiner tree-based global router with simultaneous length and density minimization , 1994, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

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

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

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

[16]  Jason Cong,et al.  Performance optimization of VLSI interconnect layout , 1996, Integr..

[17]  Mary Jane Irwin,et al.  An edge-based heuristic for Steiner routing , 1994, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

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

[19]  Sheldon B. Akers,et al.  A Modification of Lee's Path Connection Algorithm , 1967, IEEE Trans. Electron. Comput..

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

[21]  Jason Cong,et al.  Performance driven multi-layer general area routing for PCB/MCM designs , 1998, Proceedings 1998 Design and Automation Conference. 35th DAC. (Cat. No.98CH36175).

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

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

[24]  Jeffrey S. Salowe,et al.  Closing the gap: near-optimal Steiner trees in polynomial time , 1994, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..