A progressive two-stage global routing for macro-cell based designs

We propose a two-stage global routing algorithm based on mixed integer programming and a novel network-flow model. Results from various test cases including a subset of routes on a commercial 64-bit microprocessor core show that our method outperforms commercial CCT router. On average, we achieved 29% less delay violations, 40% less repeater usage on resulting routing-trees, 20% less maximum delay violation and better congestion distribution.

[1]  Li-Da Huang,et al.  Maze Routing with Buffer Insertion under Transition Time Constraints , 2003, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[2]  Majid Sarrafzadeh,et al.  Four-bend top-down global routing , 1998, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[3]  Lisa Fleischer,et al.  Approximating fractional multicommodity flow independent of the number of commodities , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[4]  Raia Hadsell,et al.  Improved global routing through congestion estimation , 2003, Proceedings 2003. Design Automation Conference (IEEE Cat. No.03CH37451).

[5]  Patrick H. Madden,et al.  Congestion reduction in traditional and new routing architectures , 2003, GLSVLSI '03.

[6]  Sachin S. Sapatnekar,et al.  A timing-constrained simultaneous global routing algorithm , 2002, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[7]  Lisa Fleischer,et al.  Approximating Fractional Multicommodity Flow Independent of the Number of Commodities , 2000, SIAM J. Discret. Math..

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

[9]  Lisa Fleischer,et al.  Fast and simple approximation schemes for generalized flow , 2002, Math. Program..