摘要: A zero-skew routing algorithm with clustering and improvement methods is proposed. This generates a in O(n log n) time for n pins, it proven that the order of total wire length best possible. Our achieves 20% reduction on benchmark data compared known algorithm.
acm.org
elsevier.com
sci-hub.se 参考文章(13)
Masato Edahiro, Minimum skew and minimum path length routing in VLSI layout design Nec Research & Development. ,vol. 32, pp. 569- 575 ,(1991)
J. Cong, A.B. Kahng, G. Robins, Matching-based methods for high-performance clock routing IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. ,vol. 12, pp. 1157- 1169 ,(1993) , 10.1109/43.238608
Michael I. Shamos, Franco P. Preparata, Computational Geometry: An Introduction ,(1978)
Michael R. Garey, David S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness ,(1979)
J. Michael Steele, Growth Rates of Euclidean Minimal Spanning Trees With Power Weighted Edges Annals of Probability. ,vol. 16, pp. 1767- 1787 ,(1988) , 10.1214/AOP/1176991596
J.-M. Ho, Y.-C. Hsu, T.-H. Chao, Zero skew clock net routing design automation conference. pp. 518- 523 ,(1992) , 10.5555/113938.149623
Andrew Kahng, Jason Cong, Gabriel Robins, High-performance clock routing based on recursive geometric matching design automation conference. pp. 322- 327 ,(1991) , 10.1145/127601.127688
E.G. Friedman, S. Powell, Design and analysis of a hierarchical clock distribution system for synchronous standard cell/macrocell VLSI IEEE Journal of Solid-state Circuits. ,vol. 21, pp. 240- 246 ,(1986) , 10.1109/JSSC.1986.1052510
Ting-Hai Chao, Yu-Chin Hsu, Jan-Ming Ho, A.B. Kahng, Zero skew clock routing with minimum wirelength IEEE Transactions on Circuits and Systems Ii: Analog and Digital Signal Processing. ,vol. 39, pp. 799- 814 ,(1992) , 10.1109/82.204128
Michael A. B. Jackson, Arvind Srinivasan, E. S. Kuh, Clock routing for high-performance ICs design automation conference. pp. 573- 579 ,(1990) , 10.1145/123186.123406