Matching-Based Methods for High-Performance Clock Routing

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Volumn 12, Issue 8, 1993, Pages 1157-1169

  Cong, Jason ^a   Kahng, Andrew B ^a   Robins, Gabriel ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF VIRGINIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; LOGIC GATES;

BINARY TREE; CLOCK ROUTING; CLOCK SKEW; MATCHING BASED METHODS;

VLSI CIRCUITS;

EID: 0027644340     PISSN: 02780070     EISSN: 19374151     Source Type: Journal    
DOI: 10.1109/43.238608     Document Type: Article

References (34)

1. H. Bakoglu, Circuits, Interconnections and Packaging for VLSI. Reading, MA: Addison-Wesley, 1990.
2. H. Bakoglu, J. T. Walker, and J. D. Meindl, “A symmetric clock-distribution tree and optimized high-speed interconnections for reduced clock skew in ulsi and wsi circuits,” in Proc. IEEE Intl. Conf. on Computer Design, Port Chester, NY, Oct. 1986, pp. 118–122.
3. J. J. Bartholdi and L. K. Platzman, “A fast heuristic based on spacefilling curves for minimum-weight matching in the plane,” Inf. Proc. Lett., vol. 17, pp. 177–180, 1983.
4. K. D. Boese and A. B. Kahng, “Zero skew clock routing with minimum wirelength,” Tech. Rep. CSD-TR-920012, Computer Sci. Dep., UCLA, Mar. 1992.
5. K. D. Boese and A. B. Kahng, “Zero skew clock routing with minimum wirelength,” in Proc. IEEE Intl. ASIC Conf., Rochester, NY, September 1992, pp. 1-1.1-1-1.5.
6. T. H. Chao, Y. C. Hsu, and J. M. Ho, “Zero skew clock net routing,” in Proc. ACM/IEEE Design Automation Conf., Anaheim, CA, June 1992, pp. 518–523.
7. B. Chazelle and H. Edelsbrunner, “An optimal algorithm for intersecting line segments,” J. Ass. Comput. Mach., vol. 39, pp. 177—180, 1992.
8. J. Cong, A. B. Kahng, and G. Robins, “On clock routing for general cell layouts,” in Proc. IEEE Intl. ASIC Conf., Rochester, NY, Sept. 1991, pp. 14:5.1-14:5.4.
9. J. Cong, A. B. Kahng, G. Robins, M. Sarrafzadeh, and C. K. Wong, “Provably good performance-driven global routing,” IEEE Trans. Computer-Aided Design, vol. 11, pp. 739–752, 1992.
10. W. M. Dai, T. Asano, and E. S. Kuh, “Routing region definition and ordering scheme for building-block layout,” IEEE Trans. Computer-Aided Design, vol. CAD-4, pp. 189–197, 1985.
11. S. Dhar, M. A. Franklin, and D. F. Wann, “Reduction of clock delays in vlsi structures,” in Proc. IEEE Intl. Conf. on Computer Design, Port Chester, NY, Oct. 1984, pp. 778–783.
12. D. Dobberpuhl, et al., “A 200 mHz 64b dual-issue cmos microprocessor,” in Proc. IEEE Intl. Solid State Circuits Conf., San Francisco, Feb. 1992, pp. 106–107.
13. W. C. Elmore, “The transient response of damped linear networks with particular regard to wide-band amplifiers,” J. Appl. Phys., vol. 19, pp. 55–63, 1948.
14. J. Fishburn “Clock skew optimization,” IEEE Trans. on Computers, vol. 39, pp. 945–951, 1990.
15. A. L. Fisher and H. T. Kung, “Synchronizing large systolic arrays,” in Proc. SPIE, May 1982, pp. 44–52.
16. H. Gabow, “An efficient implementation of edmonds’ algorithm for maximum matching on graphs,” J. Ass. Comput. Mach., vol. 23, pp. 221–234, 1976.
17. M. Garey and D. S. Johnson, “The rectilinear Steiner problem is np-complete,” SIAM J. Appl. Math., vol. 32, pp. 826–834, 1977.
18. M. A. B. Jackson, A. Srinivasan, and E. S. Kuh, “Clock routing for high-performance IC’s,” in Proc. ACM/IEEE Design Automation Conf., June 1990, pp. 573–579.
19. A. B. Kahng, J. Cong, and G. Robins, “High-performance clock routing based on recursive geometric matching,” in Proc. ACM/IEEE Design Automation Conf., June 1991, pp. 322–327.
20. A. B. Kahng and G. Robins, “A new class of iterative steiner tree heuristics with good performance,” IEEE Trans. Computer-Aided Design, vol. 11, pp. 893–902, 1992.
21. E. Lawler, Combinatorial Optimization: Networks and Matroids. New York: Holt Rinehart and Winston, 1976.
22. I. Lin and D. H. C. Du, “Performance-driven constructive placement,” in Proc. ACM/IEEE Design Automation Conf., June 1990, pp. 103–106.
23. P. Ramanathan and K. G. Shin, “A clock distribution scheme for non-symmetric VLSI circuits,” in Proc. IEEE Intl. Conf. on Computer-Aided Design, Santa Clara, CA, Nov. 1989, pp. 398–401.
24. J. Rubinstein, P. Penfield, and M. A. Horowitz, “Signal delay in RC tree networks,” IEEE Trans. Computer-Aided Design, vol. CAD-2, pp. 202–211, 1983.
25. R. Sedgewick, Algorithms. 2nd ed. Reading, MA: Addison-Wesley, 1988.
26. T. L. Snyder and J. M. Steele, “Worst-case greedy matchings in the unit d-cube,” Networks, vol. 20, pp. 779–800, 1990.
27. A. Srinivasan, private communication, Oct. 1991.
28. J. M. Steele, “Growth rates of euclidean minimal spanning trees with power weighted edges,” Ann. Probability, vol. 16, pp. 1767–1787, 1988.
29. K. J. Supowit, “New techniques for some dynamic closest-point and farthest-point problems,” in Proc. ACM/SIAM Symp. on Discrete Algorithms, Jan. 1990, pp. 84–90.
30. K. J. Supowit and E. M. Reingold, “Divide and conquer heuristics for minimum weighted euclidean matching,” SIAM J. Comput., vol. 12, pp. 118–143, 1983.
31. K. J. Supowit, E. M. Reingold, and D. A. Plaisted, “The travelling salesman problem and minimum matching in the unit square,” SIAM J. Comput., vol. 12, pp. 144–156, 1983.
32. R. S. Tsay, “Exact zero skew,” in Proc. IEEE Intl. Conf. on Computer-Aided Design, Santa Clara, CA, Nov. 1991, pp. 336–339.
33. P. Vaidya, “Geometry helps in matching,” in Proc. ACM Symp. on Theory of Computing, 1988, pp. 422–425.
34. D. F. Wann and M. A. Franklin, “Asynchronous and clocked control structure for VLSI based interconnection networks,” IEEE Trans. on Computers, vol. 21, pp. 284–293, 1983.