Clock network sizing via sequential linear programming with time-domain analysis

  • Authors:
  • Kai Wang;Malgorzata Marek-Sadowska

  • Affiliations:
  • University of California, Santa Barbara, CA;University of California, Santa Barbara, CA

  • Venue:
  • Proceedings of the 2004 international symposium on Physical design
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we present a novel approach to the problem of clock skew minimization by buffer and wire sizing. The original nonlinear programming problem is transformed to a sequence of linear programs, by taking the first order Taylor's expansion of clock path delay with respect to buffer and wire widths. The sensitivities of clock path delay, with respect to buffer and wire widths, are efficiently updated for each linear program by applying time domain analysis to the clock network in a divide-and-conquer fashion. Our technique can take into account the power supply variations, which have significant impact on clock skew. We demonstrate experimentally that in several iterations, the proposed technique is capable of reducing substantially the skew of clock networks.