GLARE: Global and local wiring aware routability evaluation

Industry routers are very complex and time consuming, and are becoming more so with the explosion in design rules and design for manufacturability requirements that multiply with each technology node. Global routing is just the first phase of a router and serves the dual purpose of (i) seeding the following phases of a router and (ii) evaluating whether the current design point is routable. Lately, it has become common to use a “light mode” version of the global router, similar to today's academic routers, to quickly evaluate the routability of a given placement. This use model suffers from two primary weaknesses: (i) it does not adequately model the local routing resources, while the model is important to remove opens and shorts and eliminate DRC violations, (ii) the metrics used to represent congestion are non-intuitive and often fail to pinpoint the key issues that need to be addressed. This paper presents solutions to both issues, and empirically demonstrates that incorporating the proposed solutions within a global routing based congestion analyzer yields a more accurate view of design routability.

[1]  Azadeh Davoodi,et al.  A parallel integer programming approach to global routing , 2010, Design Automation Conference.

[2]  Shankar Krishnamoorthy,et al.  Estimating routing congestion using probabilistic analysis , 2001, ISPD '01.

[3]  Jarrod A. Roy,et al.  CRISP: Congestion reduction by iterated spreading during placement , 2009, 2009 IEEE/ACM International Conference on Computer-Aided Design - Digest of Technical Papers.

[4]  Yue Xu,et al.  FastRoute 4.0: Global router with efficient via minimization , 2009, 2009 Asia and South Pacific Design Automation Conference.

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

[6]  Chris C. N. Chu,et al.  FLUTE: Fast Lookup Table Based Rectilinear Steiner Minimal Tree Algorithm for VLSI Design , 2008, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[7]  Michael D. Moffitt MaizeRouter: Engineering an Effective Global Router , 2008, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[8]  Chris C. N. Chu,et al.  IPR: An Integrated Placement and Routing Algorithm , 2007, 2007 44th ACM/IEEE Design Automation Conference.

[9]  Yao-Wen Chang,et al.  High-performance global routing with fast overflow reduction , 2009, 2009 Asia and South Pacific Design Automation Conference.

[10]  Patrick Groeneveld,et al.  Probabilistic congestion prediction , 2004, ISPD '04.

[11]  Ting-Chi Wang,et al.  NTHU-Route 2.0: A fast and stable global router , 2008, 2008 IEEE/ACM International Conference on Computer-Aided Design.

[12]  Jarrod A. Roy,et al.  What makes a design difficult to route , 2010, ISPD '10.

[13]  Azadeh Davoodi,et al.  Congestion analysis for global routing via integer programming , 2011, 2011 IEEE/ACM International Conference on Computer-Aided Design (ICCAD).

[14]  Min Pan,et al.  FastRoute: A Step to Integrate Global Routing into Placement , 2006, 2006 IEEE/ACM International Conference on Computer Aided Design.

[15]  Kun Yuan,et al.  BoxRouter 2.0: architecture and implementation of a hybrid and robust global router , 2007, ICCAD 2007.