X-architecture obstacles-avoiding routing with ECO consideration

In the paper, we formulate a novel obstacle-avoiding engineering change ordering (ECO) driven minimal tree construction problem. The objective is to build a better routing tree in the sense of increasing ECO flexibility to force the routing tree pass through regions in which more spare cells are available so that the additional total wirelength compared to a conventional wirelength oriented routing tree can be minimized. We incorporate the concept of inserting the virtual nodes which indicate sub-regions having more available spare cells by evaluating the distribution of spare cells. With the terminals, the corners of obstacles and the added virtual nodes, a routing tree is then constructed. Experimental results show that the number of available spare cells near the routing tree constructed by our algorithm is increased up to 65.82%, while only 2.08% of additional total wirelength.

[1]  Igor L. Markov,et al.  Automating post-silicon debugging and repair , 2007, ICCAD 2007.

[2]  Kuang-Yao Lee,et al.  On Using Spare Cells for Functional Changes with Wirelength Consideration , 2009 .

[3]  Chih-Wei Chang,et al.  A Metal-Only-ECO Solver for Input-Slew and Output-Loading Violations , 2010, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[4]  Chris C. N. Chu,et al.  A Novel Performance-Driven Topology Design Algorithm , 2007, 2007 Asia and South Pacific Design Automation Conference.

[5]  Massoud Pedram,et al.  Layout driven technology mapping , 1991, 28th ACM/IEEE Design Automation Conference.

[6]  Malgorzata Marek-Sadowska,et al.  Engineering change using spare cells with constant insertion , 2007, ICCAD.

[7]  Yih-Lang Li,et al.  An Efficient Tile-Based ECO Router Using Routing Graph Reduction and Enhanced Global Routing Flow , 2007, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[8]  Igor L. Markov,et al.  Reap what you sow: spare cells for post-silicon metal fix , 2008, ISPD '08.

[9]  Ting-Chi Wang,et al.  A Fast and Stable Algorithm for Obstacle-Avoiding Rectilinear Steiner Minimal Tree Construction , 2007, 2007 Asia and South Pacific Design Automation Conference.

[10]  Yao-Wen Chang,et al.  Multilevel full-chip routing for the X-based architecture , 2005, Proceedings. 42nd Design Automation Conference, 2005..

[11]  Sachin S. Sapatnekar,et al.  A timing-constrained algorithm for simultaneous global routing of multiple nets , 2000, IEEE/ACM International Conference on Computer Aided Design. ICCAD - 2000. IEEE/ACM Digest of Technical Papers (Cat. No.00CH37140).

[12]  Yao-Wen Chang,et al.  ECO timing optimization using spare cells , 2007, 2007 IEEE/ACM International Conference on Computer-Aided Design.

[13]  Yih-Lang Li,et al.  An Efficient Tile-Based ECO Router Using Routing Graph Reduction and Enhanced Global Routing Flow , 2007, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[14]  Shih-Chieh Chang,et al.  Spare Cells With Constant Insertion for Engineering Change , 2009, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.