skip to main content
10.1145/127601.127688acmconferencesArticle/Chapter ViewAbstractPublication PagesdacConference Proceedingsconference-collections
Article
Free Access

High-performance clock routing based on recursive geometric matching

Authors Info & Claims
Published:01 June 1991Publication History
First page image

References

  1. 1.D. Avis, "Worst Case Bounds for the Euclidean Matching Problem", International J. CompuL Math. Appl. 7 (1981), pp. 251-257.Google ScholarGoogle ScholarCross RefCross Ref
  2. 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", Proc. IEEE ICCD, Port Chester, Oct. 1986, pp. 118-122.Google ScholarGoogle Scholar
  3. 3.H. Bakoglu, Circuits, Interconnections and Packaging for VLS1, Addison-Wesley, 1990.Google ScholarGoogle Scholar
  4. 4.J. J. Bartholdi and L. K. Platzman, "A Fast Heuristic Based on Spacefilling Curves for Minimum-Weight Matching in the Plane", Inf. Proc. Letters 17 (1983), pp. 17%180.Google ScholarGoogle ScholarCross RefCross Ref
  5. 5.S. Dhar, M. A. Franklin and D. F. Warm, "Reduction of Clock Delays in VLSI Structures", Proc. 1EEE ICCD, Port Chester, Oct. 1984, pp. 778-783.Google ScholarGoogle Scholar
  6. 6.A. L. Fisher and It. T. Kung, "Synchronizing Large Systolic Arrays", Proc. SPIE 341, May 1982, pp. 44-52.Google ScholarGoogle Scholar
  7. 7.M. A. B. Jackson, A. Srinivasan and E. S. Kuh, "Clock Routing for High-Performance ICs", Proc. A CM/IEEE DAC, June 1990, pp. 573-579. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. 8.A. Kahng, J. Cong and G. Robins, "High- Performance Clock Routing Based on Recursive Geometric Matching", UCLA CSD TR-900045, Nov. 1990.Google ScholarGoogle Scholar
  9. 9.A. Kahng and G. Robins, "A New Family of Steiner Tree Heuristics With Good Performance" The Iterated 1-Steiner Approach", Proc. IEEE ICCAD, Nov. 1990, pp. 428-431.Google ScholarGoogle Scholar
  10. 10.E. Lawler, Combinatorial Optimization: Networks and Matroids, Holt Rinehart and Winston, New York, 1976.Google ScholarGoogle Scholar
  11. 11.i. Lin and H. C. Du, "Performance-Driven Constructive Placement", Proc. DAC (1990), pp. 103- 105. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. 12.T. M. Lin and C. A. Mead, "Signal Delay in General RC Networks", IEEE Trans. on CAD CAD- 3(4) (1984), pp. 331-349.Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. 13.F. P. Preparata and M. I. Shamos, Computational Geometry: An Introduction, New York, Springer- Verlag, 1985. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. 14.P. Ramanathan and K. G. Shin, "A Clock Distribution Scheme for Non-Symmetric VLSI Circuits", Proc. IEEE ICCAD, November 1989, pp. 398-401.Google ScholarGoogle Scholar
  15. 15.J. R.ubinstein, P. Penfield and M. A. Horowitz, "Signal Delay in RC Tree Networks", IEEE Trans. on CAD CAD-2(3) (1983), pp. 202-211.Google ScholarGoogle Scholar
  16. 16.T. L. Snyder and J. M. Steele, "Worst-Case Greedy Matchings in the Unit d-Cube", Networks 20 (1990), pp. 779-800.Google ScholarGoogle ScholarCross RefCross Ref
  17. 17.A. Srinivasan, private communication, Oct. 1990.Google ScholarGoogle Scholar
  18. 18.J. M. Steele, "Growth Rates of Euclidean Minimal Spanning Trees With Power Weighted Edges", The Annals of Probability 16(4) (1988), pp. 1767-1787.Google ScholarGoogle ScholarCross RefCross Ref
  19. 19.K. J. Supowit and E. M. Reingold, "Divide and Conquer Heuristics for Minimum Weighted Euclidean Matching", SIAM J. Computing 12(1) (1983), pp. 118-143.Google ScholarGoogle ScholarCross RefCross Ref
  20. 20.K.J. Supowit, E. M. Reingold, and D. A. Plaisted, "The Travelling Salesman Problem and Minimum Matching in the Unit Square", SIAM J. Computing 12(1) (1983), pp. 144-156.Google ScholarGoogle ScholarCross RefCross Ref
  21. 21.P. Vaidya, "Geometry Helps in Matching", A CM Symposium on the Theory of Computing, pp. 422- 425. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. 22.D. F. Wann and M. A. Franklin, "Asynchronous and Clocked Control Structure for VLSI Based Interconnection Networks", IEEE Trans. on Compute~ 21(3) (1983), pp. 284-293.Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. High-performance clock routing based on recursive geometric matching

            Recommendations

            Comments

            Login options

            Check if you have access through your login credentials or your institution to get full access on this article.

            Sign in
            • Published in

              cover image ACM Conferences
              DAC '91: Proceedings of the 28th ACM/IEEE Design Automation Conference
              June 1991
              783 pages
              ISBN:0897913957
              DOI:10.1145/127601

              Copyright © 1991 ACM

              Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

              Publisher

              Association for Computing Machinery

              New York, NY, United States

              Publication History

              • Published: 1 June 1991

              Permissions

              Request permissions about this article.

              Request Permissions

              Check for updates

              Qualifiers

              • Article

              Acceptance Rates

              Overall Acceptance Rate1,770of5,499submissions,32%

              Upcoming Conference

              DAC '24
              61st ACM/IEEE Design Automation Conference
              June 23 - 27, 2024
              San Francisco , CA , USA

            PDF Format

            View or Download as a PDF file.

            PDF

            eReader

            View online with eReader.

            eReader