Race-condition-aware clock skew scheduling

The race conditions often limit the smallest feasible clock period that the optimal clock skew scheduling could achieve. Therefore, the combination of clock skew scheduling and delay insertion (for resolving the race conditions) might lead to further clock period reduction. However, the interactions between clock skew scheduling and delay insertion have not been well studied. In this paper, the authors provided a fresh viewpoint to look at this problem. A novel approach, called race-condition-aware (RCA) clock skew scheduling, is proposed to determine the clock skew schedule by taking the race conditions into account. The objective is not only to optimize the clock period, but also to heuristically minimize the required inserted delay. Compared with previous work, this approach has significant improvement in the time complexity.

[1]  Sachin S. Sapatnekar,et al.  A graph-theoretic approach to clock skew optimization , 1994, Proceedings of IEEE International Symposium on Circuits and Systems - ISCAS '94.

[2]  Shih-Hsu Huang,et al.  Clock Period Minimization of Non-Zero Clock Skew Circuits , 2003, ICCAD.

[3]  Marios C. Papaefthymiou,et al.  Understanding retiming through maximum average-delay cycles , 2005, Mathematical systems theory.

[4]  Robert K. Brayton,et al.  Minimum padding to satisfy short path constraints , 1993, ICCAD '93.

[5]  Marios C. Papaefthymiou Understanding retiming through maximum average-weight cycles , 1991, SPAA '91.

[6]  John P. Fishburn,et al.  Clock Skew Optimization , 1990, IEEE Trans. Computers.