A fast incremental clock Skew scheduling algorithm for slack optimization

被引:0
作者
Wang, Kui [1 ]
Fang, Hao [1 ]
Xu, Hu [1 ]
Cheng, Xu [1 ]
机构
[1] Peking Univ, Dept Comp Sci & Technol, Beijing 100871, Peoples R China
来源
2008 ASIA AND SOUTH PACIFIC DESIGN AUTOMATION CONFERENCE, VOLS 1 AND 2 | 2008年
关键词
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We propose a fast clock skew scheduling algorithm which minimizes clock period and enlarges the slacks of timing critical paths. To reduce the run-time of the timing analysis engine, our algorithm allows the sequential graph to be partly extracted. And the runtime of itself is almost linear to the size of the extracted sequential graph. Experimental results show its runtime is less than a minute for a design with more than ten thousands of flip-flops.
引用
收藏
页码:440 / 445
页数:6
相关论文
共 14 条
  • [1] ALBRECHT C, 1999, IEEE ACM INT C COMP, P232
  • [2] Albrecht C, 2006, DES AUT TEST EUROPE, P1090
  • [3] [Anonymous], 2005, IWLS 2005 BENCHMARKS
  • [4] Burns SM, 1991, THESIS CALIFORNIA I
  • [5] CLOCK SKEW OPTIMIZATION
    FISHBURN, JP
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 1990, 39 (07) : 945 - 951
  • [6] KOURTEV IS, 1999, IEEE ACM INT C COMP, P239
  • [7] Optimal clock skew scheduling tolerant to process variations
    Neves, JL
    Friedman, EG
    [J]. 33RD DESIGN AUTOMATION CONFERENCE, PROCEEDINGS 1996, 1996, : 623 - 628
  • [8] PAPAEFTHYMIOU MC, 1994, P 3 ACM S PAR ALG AR, P65
  • [9] Ravindran K, 2003, ICCAD-2003: IEEE/ACM DIGEST OF TECHNICAL PAPERS, P801
  • [10] Practical fast clock-schedule design algorithms
    Takahashi, A
    [J]. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2006, E89A (04): : 1005 - 1011