Graph-theoretic approach to clock skew optimization

Rahul B. Deokar, Sachin S. Sapatnekar

Research output: Contribution to journalConference articlepeer-review

132 Scopus citations


This paper addresses the problem of minimizing the clock period of a circuit by optimizing the clock skews. We incorporate uncertainty factors and present a formulation that ensures that the optimization will be safe. In [1], the problem of clock period optimization is formulated as a linear program. We first propose an efficient graph-based solution that takes advantage of the structure of the problem. We also show that the results of [1] may result in exceedingly large skews, and propose a method to reduce these skews without sacrificing the optimality of the clock period. Experimental results on several ISCAS89 benchmark circuits are provided.

Original languageEnglish (US)
Pages (from-to)407-410
Number of pages4
JournalProceedings - IEEE International Symposium on Circuits and Systems
StatePublished - Dec 1 1994
EventProceedings of the 1994 IEEE International Symposium on Circuits and Systems. Part 3 (of 6) - London, England
Duration: May 30 1994Jun 2 1994


Dive into the research topics of 'Graph-theoretic approach to clock skew optimization'. Together they form a unique fingerprint.

Cite this