Zero skew clock routing in X-architecture based on an improved greedy matching algorithm Academic Article uri icon

abstract

  • 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. © 2007 Elsevier B.V. All rights reserved.

author list (cited authors)

  • Shen, W., Cai, Y., Hong, X., Hu, J., & Lu, B.

citation count

  • 4

publication date

  • May 2008