Process-variation-tolerant clock skew minimization
Shen Lin, Carmen Wong · 1994
In this paper, we propose a novel hierarchical multiple-merge zero skew clock routing algorithm. The routing results pro-duced by our approach will have zero skew in the nominal case and minimal skew increase in the presence of worst process variations. In order to construct such a clock rout-ing, we formulate the linear placement with maximum spread problem and provide an O(nminfn; Pg logn logP) algo-rithm for optimally solving this problem, where n is the num-ber of cells to be placed and P is the maximum spread. Experimental results show that our algorithm can indeed reduce the skew in various manufacturing variations effec-tively. 1 Introduction. Skew is defined as the maximum difference among the de-