Process variation aware clock tree routing

Fast progress on VLSI technology makes clock skew more susceptible to process variations. We propose DME/BST based algorithms for clock tree routing to improve skew tolerance to process variations. The worst case skew due to process variations is estimated and employed to guide the decision making during the routing. Our method can be applied to general non-zero skew requirements. Minimizing total wirelength is considered as a secondary objective at the same time. Experimental results on benchmark circuits demonstrate great improvement on process variation tolerance through our algorithms.

[1]  J. Jensen,et al.  Sizing of clock distribution networks for high performance CPU chips , 1996, 33rd Design Automation Conference Proceedings, 1996.

[2]  Wayne Wei-Ming Dai,et al.  Useful-Skew Clock Routing with Gate Sizing for Low Power Design , 1997, J. VLSI Signal Process..

[3]  Jason Cong,et al.  Interconnect performance estimation models for design planning , 2001, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[4]  Jan-Ming Ho,et al.  Zero skew clock net routing , 1992, [1992] Proceedings 29th ACM/IEEE Design Automation Conference.

[5]  Eby G. Friedman,et al.  Design methodology for synthesizing clock distribution networks exploiting nonzero localized clock skew , 1996, IEEE Trans. Very Large Scale Integr. Syst..

[6]  Chung-Kuan Cheng,et al.  Skew Sensitivity Minimization Of Buffered Clock Tree , 1994, IEEE/ACM International Conference on Computer-Aided Design.

[7]  Masato Edahiro,et al.  A Clustering-Based Optimization Algorithm in Zero-Skew Routings , 1993, 30th ACM/IEEE Design Automation Conference.

[8]  Chak-Kuen Wong,et al.  Process-variation-tolerant clock skew minimization , 1994, ICCAD.

[9]  Jason Cong,et al.  Bounded-skew clock and Steiner routing , 1998, TODE.

[10]  Wayne Wei-Ming Dai,et al.  Buffer insertion and sizing under process variations for low power clock distribution , 1995, DAC '95.

[11]  Albert E. Ruehli,et al.  Multi-GHz interconnect effects in microprocessors , 2001, ISPD '01.

[12]  M. Edahiro,et al.  Delay Minimization For Zero-skew Routing , 1993, Proceedings of 1993 International Conference on Computer Aided Design (ICCAD).

[13]  E. Friedman,et al.  Topological design of clock distribution networks based on non-zero clock skew specifications , 1993, Proceedings of 36th Midwest Symposium on Circuits and Systems.

[14]  Ren-Song Tsay,et al.  An exact zero-skew clock routing algorithm , 1993, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[15]  Jan-Ming Ho,et al.  Zero skew clock routing with minimum wirelength , 1992 .

[16]  Marios C. Papaefthymiou,et al.  A clock tree topology extraction algorithm for improving the tolerance of clock distribution networks to delay uncertainty , 2001, ISCAS 2001. The 2001 IEEE International Symposium on Circuits and Systems (Cat. No.01CH37196).

[17]  Eby G. Friedman,et al.  Optimal clock skew scheduling tolerant to process variations , 1996, DAC '96.

[18]  Sachin S. Sapatnekar,et al.  Hybrid structured clock network construction , 2001, IEEE/ACM International Conference on Computer Aided Design. ICCAD 2001. IEEE/ACM Digest of Technical Papers (Cat. No.01CH37281).