Abstract
In Clock routing research, such practical considerations as hierarchical buffering, rise-time and overshoot constraints, obstacle- and legal location-checking, varying layer parasitics and congestion, and even the underlying design flow are often ignored. This paper explores directions in which traditional formulations can be extended so that the resulting algorithms are more useful in production design environments. Specifically, the following issues are addressed: (i) clock routing for varying layer parasitics with non-zero via parasitics; (ii) obstacle-avoidance clock routing; and (iii) hierarchical buffered tree synthesis. We develop new theoretical analyses and heuristics, and present experimental results that validate our new approaches.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A.B. Kahng and G. Robins, On Optimal Interconnections for VLSI, Kluwer Academic Publishers, 1995.
E.G. Friedman (Ed.), Clock Distribution Networks in VLSI Circuits and Systems: A Selected Reprint Volume, IEEE Press, 1995.
J.H. Huang, A.B. Kahng, and C.-W.A. Tsao, “On the boundedskew clock and steiner routing problems,” in Proc. ACM/IEEE Design Automation Conf., pp. 508-513, 1995. Also available as Technical Report CSD-940026x, Computer Science Dept., UCLA.
J. Cong and C.-K. Koh, “Minimum-cost bounded-skew clock routing,” in Proc. IEEE Intl. Symp. Circuits and Systems, Vol. 1, pp. 215-218, April 1995.
J. Cong, A.B. Kahng, C.-K. Koh, and C.-W.A. Tsao, “Boundedskew clock and Steiner routing under Elmore delay,” in Proc. IEEE Intl. Conf. Computer-Aided Design, pp. 66-71, Nov. 1995.
K.D. Boese and A.B. Kahng, “Zero-skew clock routing trees with minimum wirelength,” in Proc. IEEE Intl. Conf. on ASIC, pp. 1.1.1-1.1.5, 1992.
T.-H. Chao, Y.C. Hsu, J.M. Ho, K.D. Boese, and A.B. Kahng, ”Zero skew clock routing with minimum wirelength,” IEEE Trans. Circuits and Systems, Vol. 39, No. 11, pp. 799-814, Nov. 1992.
T.-H. Chao, Y.-C. Hsu, and J.-M. Ho, “Zero skew clock net routing,” in Proc. ACM/IEEE Design Automation Conf., pp. 518- 523, 1992.
M. Edahiro, “Minimum skew and minimum path length routing in VLSI layout design,” NEC Research and Development, Vol. 32, No. 4, pp. 569-575, 1991.
J. Cong, A.B. Kahng, C.-K. Koh, and C.-W.A. Tsao, ”Bounded-skew clock and Steiner routing under Elmore delay,” Technical Report CSD950030, Computer Science Dept., University of California, Los Angeles, Aug. 1995. Available by anonymous ftp to ftp.cs.ucla.edu, also available at http://vlsicad.cs.ucla.edu/~tsao.
M. Edahiro, “A clustering-based optimization algorithm in zeroskew routings,” in Proc. ACM/IEEE Design Automation Conf., pp. 612-616, June 1993.
M. Borah, R.M. Owens, and M.J. Irwin, “An edge-based heuristic for rectilinear Steiner trees,” IEEE Trans. Computer-Aided Design, Vol. 13, No. 12, pp. 1563-1568, Dec. 1994.
A.B. Kahng and C.-W.A. Tsao, “Low-cost single-layer clock trees with exact zero Elmore delay skew,” in Proc. IEEE Intl. Conf. Computer-Aided Design, 1994.
T. Asano, L. Guibas, J. Hershberger, and H. Imai, “Visibilitypolygon search and euclidean shortest paths,” in Proc. IEEE Symp. Foundations of Computer Science, pp. 155-164, 1995.
E. Welzl, “Constructing the visibility graph for n line segments in o.n2/ time,” Information Processing Letters, Vol. 20, pp. 167- 171, 1985.
A.B. Kahng and C.-W.A. Tsao, “Planar-dme: A single-layer zero-skew clock tree router,” IEEE Trans. Computer-Aided Design, Vol. 15, No. 1, Jan. 1996.
C.-W.A. Tsao, “VLSI Clock Net Routing,” Ph.D. thesis, University of California, Los Angeles, Oct. 1996.
J.G. Xi and W.W.-M. Dai, “Buffer insertion and sizing under process variations for low power clock distribution,” in Proc. ACM/IEEE Design Automation Conf., pp. 491-496, 1995.
S. Pullela, N. Menezes, J. Omar, and L.T. Pillage, “Skew and delay optimization for reliable buffered clock trees,” in Proc. IEEE Intl. Conf. Computer-Aided Design, pp. 556-562, 1993.
J. Chung and C.-K. Cheng, “Skew sensitivity minimization of buffered clock tree,” in Proc. IEEE Intl. Conf. Computer-Aided Design, pp. 280-283, 1994.
A. Vittal and M. Marek-Sadowska, “Power optimal buffered clock tree design,” in Proc. ACM/IEEE Design Automation Conf., San Francisco, June 1995.
Y.P. Chen and D.F. Wong, “An algorithm for zero-skew clock tree routing with buffer insertion,” in Proc. European Design and Test Conf., pp. 652-657, 1996.
C.J. Alpert and A.B. Kahng, “Geometric embeddings for faster (and better) multi-way partitioning,” in Proc. ACM/IEEE Design Automation Conf., pp. 743-748, 1993.
T.F. Gonzalez, “Clustering to minimize the maximum intercluster distance,” Theoretical Computer Science, Vol. 38, Nos. 2-3, pp. 293-306, June 1985.
A.B. Kahng and C.-W. Albert Tsao, “Planar-dme: Improved planar zero-skew clock routing with minimum pathlength delay,” in Proc. European Design Automation Conf. with with EUROVHDL, Grenoble, France, pp. 440-445, Sept. 1994. Also available as Technical Report CSD-940006, Computer Science Dept., UCLA.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Kahng, A.B., Tsao, CW.A. Practical Bounded-Skew Clock Routing. The Journal of VLSI Signal Processing-Systems for Signal, Image, and Video Technology 16, 199–215 (1997). https://doi.org/10.1023/A:1007995125716
Published:
Issue Date:
DOI: https://doi.org/10.1023/A:1007995125716