Title :
Optimal prescribed-domain clock skew scheduling
Author :
Li, Li ; Lu, Yinghai ; Zhou, Hai
Author_Institution :
Electr. Eng. & Comput. Sci., Northwestern Univ., Xi´´an, China
fDate :
Jan. 30 2012-Feb. 2 2012
Abstract :
Clock skew scheduling is an efficient technique to minimize the cycle period by properly assigning clock delays to registers in a circuit. But its effectiveness is limited by the difficulty in implementing a large number of arbitrary clock skews. Multi-domain clock skew scheduling and prescribed-domain clock skew scheduling are two alternatives to overcome this shortage by restricting the number of clock domains. While multi-domain clock skew scheduling has been proved to be NP-hard, the hardness of prescribed-domain clock skew scheduling algorithm remains evasive. In this paper, we give a positive answer to the open question by presenting the first efficient and optimal algorithm for prescribed-domain clock skew scheduling. Besides the runtime improvement over the previous method, the experimental results on ISCAS89 benchmarks show comparable quality to those generated by optimal multi-domain clock skew scheduling.
Keywords :
circuit complexity; clock distribution networks; logic design; minimisation; scheduling; sequential circuits; ISCAS89 benchmarks; NP-hard problem; arbitrary clock skew; clock delays; cycle period minimization; optimal multidomain clock skew scheduling; optimal prescribed-domain clock skew scheduling; runtime improvement; sequential circuit design; Algorithm design and analysis; Clocks; Delay; Processor scheduling; Registers; Runtime; Scheduling;
Conference_Titel :
Design Automation Conference (ASP-DAC), 2012 17th Asia and South Pacific
Conference_Location :
Sydney, NSW
Print_ISBN :
978-1-4673-0770-3
DOI :
10.1109/ASPDAC.2012.6165008