Effective congestion reduction for IC package substrate routing

Off-chip substrate routing for high-density packages is challenging due to requirements such as high density, lack of vertical detour, non-Manhattan routing, and primarily planar routing. The existing substrate routing algorithms often result in a large number of unrouted nets that have to be routed manually. This article develops an effective yet efficient diffusion-driven method D-Router to reduce congestion. Starting with an initial routing, we develop an effective diffusion-based congestion reduction. We iteratively find a congested window and spread out connections to reduce congestion inside the window by a simulated diffusion process based on the duality between congestion and concentration. The window is released after the congestion is eliminated. Compared with the state-of-the-art substrate routing method that leads to 480 nets unrouted for ten industrial designs with a total of 6415 nets, the D-Router reduces the amount of unrouted nets to 104, a reduction to the 4.6 multiple. In addition, the D-Router obtains a similar reduction on unrouted nets but runs up to 94 times faster when compared with a negotiation-based substrate routing.

[1]  Rui Shi,et al.  Efficient escape routing for hexagonal array of high density I/Os , 2006, 2006 43rd ACM/IEEE Design Automation Conference.

[2]  Yao-Wen Chang,et al.  An Integer Linear Programming Based Routing Algorithm for Flip-Chip Design , 2007, 2007 44th ACM/IEEE Design Automation Conference.

[3]  J.A. Roy,et al.  High-performance routing at the nanometer scale , 2007, 2007 IEEE/ACM International Conference on Computer-Aided Design.

[4]  Wayne Wei-Ming Dai,et al.  Topological routing in SURF: generating a rubber-band sketch , 1991, 28th ACM/IEEE Design Automation Conference.

[5]  Wayne Wei-Ming Dai,et al.  Pin assignment and routing on a single-layer Pin Grid Array , 1995, ASP-DAC '95.

[6]  J. Darnauer,et al.  Interchangeable pin routing with application to package layout , 1996, ICCAD 1996.

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

[8]  Jinjun Xiong,et al.  Constraint driven I/O planning and placement for chip-package co-design , 2006, Asia and South Pacific Conference on Design Automation, 2006..

[9]  Masao Sato,et al.  Routability of a rubber-band sketch , 1991, 28th ACM/IEEE Design Automation Conference.

[10]  Kun Yuan,et al.  BoxRouter 2.0: architecture and implementation of a hybrid and robust global router , 2007, 2007 IEEE/ACM International Conference on Computer-Aided Design.

[11]  Lei He,et al.  Diffusion-driven congestion reduction for substrate topological routing , 2009, ISPD '09.

[12]  Frank Bossen,et al.  Anisotropic Mesh Generation with Particles. , 1996 .

[13]  Wayne Wei-Ming Dai,et al.  Interchangeable pin routing with application to package layout , 1996, Proceedings of International Conference on Computer Aided Design.

[14]  David Z. Pan,et al.  BoxRouter: A New Global Router Based on Box Expansion and Progressive ILP , 2006, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[15]  Y. Takeuchi,et al.  Escape routing design to reduce the number of layers in area array packaging , 2000 .

[16]  E. Winkler Escape routing from chip scale packages , 1996, Nineteenth IEEE/CPMT International Electronics Manufacturing Technology Symposium.

[17]  Martin D. F. Wong,et al.  An escape routing framework for dense boards with high-speed design constraints , 2005, ICCAD-2005. IEEE/ACM International Conference on Computer-Aided Design, 2005..

[18]  Chia-Chun Tsai,et al.  NEWS: a net-even-wiring system for the routing on a multilayer PGA package , 1998, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[19]  Chung-Kuan Cheng,et al.  Layer Minimization of Escape Routing in Area Array Packaging , 2006, 2006 IEEE/ACM International Conference on Computer Aided Design.

[20]  David Z. Pan,et al.  Diffusion-based placement migration , 2005, Proceedings. 42nd Design Automation Conference, 2005..

[21]  Wayne Wei-Ming Dai,et al.  SURF: rubber-band routing system for multichip modules , 1993, IEEE Design & Test of Computers.

[22]  Martin D. F. Wong,et al.  Simultaneous escape routing and layer assignment for dense PCBs , 2004, IEEE/ACM International Conference on Computer Aided Design, 2004. ICCAD-2004..

[23]  Atsushi Takahashi,et al.  A global routing method for 2-layer ball grid array packages , 2005, ISPD '05.

[24]  D. Crowley,et al.  Next generation electronics packaging utilizing flip chip technology , 2003, IEEE/CPMT/SEMI 28th International Electronics Manufacturing Technology Symposium, 2003. IEMT 2003..

[25]  D. T. Lee,et al.  A faster algorithm for rubber-band equivalent transformation for planar VLSI layouts , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[26]  Lei He,et al.  Topological routing to maximize routability for package substrate , 2008, 2008 45th ACM/IEEE Design Automation Conference.

[27]  Jarrod A. Roy,et al.  High-Performance Routing at the Nanometer Scale , 2007, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[28]  Yao-Wen Chang,et al.  A routing algorithm for flip-chip design , 2005, ICCAD-2005. IEEE/ACM International Conference on Computer-Aided Design, 2005..

[29]  Hai Zhou,et al.  Parallel CAD: Algorithm Design and Programming Special Section Call for Papers TODAES: ACM Transactions on Design Automation of Electronic Systems , 2010 .