Zero skew clock routing in X-architecture based on an improved greedy matching algorithm

As technology advances into nanometer territory, clock network layout plays an increasingly important role in determining circuit quality indicated by timing, power consumption, cost, power supply noise and tolerance to process variation. To alleviate the challenges to the existing routing algorithms due to the continuous increase of the problem size and the high-performance requirement, X-architecture has been proposed and applied to routing in that it can reduce wirelength and via counts, and thus improves the performance and routability compared with the conventional Manhattan routing. In this paper, we investigate zero skew clock routing using X-architecture based on an improved greedy matching algorithm (GMZSTX). The fitted Elmore delay model is employed to improve the accuracy over the Elmore delay model. The interactions among distance, delay balance and load balance are analyzed. Based on this analysis, an effective and efficient greedy matching scheme is suggested to reduce wire snaking and to get a more balanced clock tree. The proposed algorithm is simple and fast for practical applications. Experimental results on benchmark circuits show that our algorithm (GMZSTX) achieves a reduction of 8.15% in total wirelength, 30.19% in delay and 55.31% in CPU time on average compared with zero skew clock routing in the Manhattan plane (BB+DME-2, which means using the top-down balanced bipartition (BB) method [T.H. Chao, Y.C. Hsu, J.M. Ho, et al., Zero skew routing with minimum wirelength, IEEE Trans. Circuits Syst. II-Analog & Digital Signal Process 39 (11) (1992) 799-814] to generate the tree topology and using the Deferred-Merge Embedding (DME) algorithm [T.H. Chao, Y.C. Hsu, J.M. Ho, et al., Zero skew routing with minimum wirelength, IEEE Trans. Circuits Syst. II-Analog & Digital Signal Process 39 (11) (1992) 799-814] to embed the internal nodes), and reduces delay and CPU time by 17.44% and 62.21% on average over the BB+DME-4 method (which is similar to BB+DME-2, but routing in X-architecture). Our SPICE simulation further verifies the correctness of the resulting clock tree.

[1]  Jiang Hu,et al.  Buffered clock tree for high quality IC design , 2004, International Symposium on Signals, Circuits and Systems. Proceedings, SCS 2003. (Cat. No.03EX720).

[2]  Yici Cai,et al.  Zero skew clock routing with tree topology construction using simulated annealing method , 2005, 2005 IEEE International Symposium on Circuits and Systems.

[3]  Steven L. Teig,et al.  The X architecture: not your father's diagonal wiring , 2002, SLIP '02.

[4]  Jason Cong,et al.  Minimum-cost bounded-skew clock routing , 1995, Proceedings of ISCAS'95 - International Symposium on Circuits and Systems.

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

[6]  R. Tsay.  Exact zero skew , 1991, ICCAD 1991.

[7]  Jason Cong,et al.  High-performance clock routing based on recursive geometric matching , 1991, 28th ACM/IEEE Design Automation Conference.

[8]  Arvind Srinivasan,et al.  Clock routing for high-performance ICs , 1991, DAC '90.

[9]  Benny K. Nielsen,et al.  An Exact Algorithm for the Uniformly-Oriented Steiner Tree Problem , 2002, ESA.

[10]  Masato Edahiro,et al.  An Efficient Zero-Skew Routing Algorithm , 1994, 31st Design Automation Conference.

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

[12]  Andrew B. Kahng,et al.  Planar-DME: a single-layer zero-skew clock tree router , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[13]  Andrew B. Kahng,et al.  Power-aware placement , 2005, Proceedings. 42nd Design Automation Conference, 2005..

[14]  Qing Zhu,et al.  Planar clock routing for high performance chip and package co-design , 1996, IEEE Trans. Very Large Scale Integr. Syst..

[15]  Narayanan Vijaykrishnan,et al.  A clock power model to evaluate impact of architectural and technology optimizations , 2002, IEEE Trans. Very Large Scale Integr. Syst..

[16]  Chak-Kuen Wong,et al.  On Some Distance Problems in Fixed Orientations , 1987, SIAM J. Comput..

[17]  Andrew B. Kahng,et al.  Highly scalable algorithms for rectilinear and octilinear Steiner trees , 2003, ASP-DAC '03.

[18]  D. T. Lee,et al.  On Steiner tree problem with 45/spl deg/ routing , 1995, Proceedings of ISCAS'95 - International Symposium on Circuits and Systems.

[19]  Kaushik Roy,et al.  Estimation of inductive and resistive switching noise on power supply network in deep sub-micron CMOS circuits , 2000, Proceedings 2000 International Conference on Computer Design.

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

[21]  Der-Tsai Lee,et al.  The Steiner Minimal Tree Problem in the λ-geometry Plane , 1996 .

[22]  Cheng-Kok Koh,et al.  UST/DME: a clock tree router for general skew constraints , 2000, TODE.

[23]  Andrew B. Kahng,et al.  Estimation of wirelength reduction for λ-geometry vs. manhattan placement and routing , 2003, SLIP '03.

[24]  D. T. Lee,et al.  The Steiner Minimal Tree Problem in the lambda-Geormetry Plane , 1996, ISAAC.

[25]  Arif Ishaq Abou-Seido,et al.  Fitted Elmore delay: a simple and accurate interconnect delay model , 2004, IEEE Trans. Very Large Scale Integr. Syst..