Clock Skew Scheduling Under Process Variations

Authors:
Xinjie Wei;Yici Cai;Xianlong Hong
Affiliations:
Tsinghua University, China;Tsinghua University, China;Tsinghua University, China
Venue:
ISQED '06 Proceedings of the 7th International Symposium on Quality Electronic Design
Year:
2006

Citing 8
Cited 3

Clock Skew Optimization

IEEE Transactions on Computers
Optimal clock skew scheduling tolerant to process variations

DAC '96 Proceedings of the 33rd annual Design Automation Conference
Buffered Clock Tree Synthesis with Non-Zero Clock Skew Schedulingfor Increased Tolerance to Process Parameter Variations

Journal of VLSI Signal Processing Systems - Special issue on high performance clock distribution networks
Cycle time and slack optimization for VLSI-chips

ICCAD '99 Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design
Clock skew scheduling for improved reliability via quadratic programming

ICCAD '99 Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design
Introduction to Algorithms

Introduction to Algorithms
Clock Scheduling and Clocktree Construction for High Performance ASICS

Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design
False Path and Clock Scheduling Based Yield-Aware Gate Sizing

VLSID '05 Proceedings of the 18th International Conference on VLSI Design held jointly with 4th International Conference on Embedded Systems Design

Physical aware clock skew rescheduling

Proceedings of the 17th ACM Great Lakes symposium on VLSI
Online clock skew tuning for timing speculation

Proceedings of the International Conference on Computer-Aided Design
Clock skew scheduling for timing speculation

DATE '12 Proceedings of the Conference on Design, Automation and Test in Europe

Quantified Score

Hi-index	0.00

Visualization

Abstract

Process variation may lead to chip fail because of the property variation of its data path and clock network. We consider the problem of finding an optimal clock schedule, which has not only the minimal clock period but also the maximal tolerant to process variation. Clock skew scheduling is modelled as a constraint difference system, which can be solved by graph theory. The basic traditional algorithm has the vulnerability that the skew value is near to the skew constraint boundary. The parametric shortest path algorithm inserts unified margin value in the skew constraint with loss of circuit performance. We present a novel approach that can maximize the safe margin during clock skew scheduling, which is evaluated by center error square index. Experimental results show that our incremental slack distribution algorithm has the optimal clock skew scheduling result with more safe margin and has more robust tolerant to process variation.