Clock routing for high-performance ICs

  • Authors:
  • Michael A. B. Jackson;Arvind Srinivasan;E. S. Kuh

  • Affiliations:
  • Electronics Research Laboratory, University of California, Berkeley, CA;Electronics Research Laboratory, University of California, Berkeley, CA;Electronics Research Laboratory, University of California, Berkeley, CA

  • Venue:
  • DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
  • Year:
  • 1991

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we focus on routing techniques for optimizing clock signals in small-cell (e.g., standard-cell, sea-of gate, etc.…) ASICs. In previously reported work, the routing of the clock net has been performed using ordinary global routing techniques based on a minimum spanning or minimal Steiner tree that have little understanding of clock routing problems. We present a novel approach to clock routing that all but eliminates clock skew and yields excellent phase delay results for a wide range of chip sizes, net sizes (pin count), minimum feature sizes, and pin distributions on both randomly created and standard industrial benchmarks. For certain classes of pin distributions we have proven theoretically and observed experimentally a decrease in skew with an increase in net size. In practice, we have observed a two to three order magnitude reduction in skew when compared to a minimum rectilinear spanning tree.