A Fast Parallel Approach for Common Path Pessimism Removal

被引:0
|
作者
Tsai, Chung-Hao [1 ]
Mak, Wai-Kei [1 ]
机构
[1] Natl Tsing Hua Univ, Dept Comp Sci, Hsinchu, Taiwan
关键词
Timing analysis; Common path pessimism removal;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Static timing analysis has always been indispensable in integrated circuit design. In order to consider design and electrical complexities (e.g., crosstalk coupling, voltage drops) as well as manufacturing and environmental variations, timing analysis is typically done using an "early-late" split. The early-late split timing analysis enables timers to effectively account for any within-chip variation effects. However, this dual-mode analysis may introduce unnecessary pessimism, which can lead to an over-conservative design. Thus, common path pessimism removal (CPPR) is introduced to eliminate this pessimism during timing analysis. A naive approach would require the analysis of all paths in the design. For today's designs with millions of gates, enumerating all paths is impractical. In this paper, we propose a new approach to effectively prune the redundant paths and develop a multi-threaded timing analysis tool called MTimer for fast and accurate CPPR. The results show that our timer can achieve 3.53X speedup on average comparing with the winner of the TAU 2014 contest and maintain 100% accuracy on removing common path pessimism during timing analysis.
引用
收藏
页码:372 / 377
页数:6
相关论文
共 50 条
  • [21] Crosstalk Pessimism Reduction with Path Base Analysis
    Tanaka, Genichi
    Nakashiro, Koichi
    ISQED 2009: PROCEEDINGS 10TH INTERNATIONAL SYMPOSIUM ON QUALITY ELECTRONIC DESIGN, VOLS 1 AND 2, 2009, : 601 - 606
  • [22] Common Path/Common Mode design approach for the Airborne Laser System
    Billman, KW
    Shattuck, PL
    GUIDANCE AND CONTROL 2001, 2001, 107 : 489 - 496
  • [23] Airborne laser system common path/common mode design approach
    Billman, KW
    Horwitz, BA
    Shattuck, PL
    AIRBORNE LASER ADVANCED TECHNOLOGY II, 1999, 3706 : 196 - 203
  • [24] Fast algorithms of hypercomplex calculations: Parallel approach
    Chicheva, M
    Aliev, M
    Yershov, A
    ISPA 2005: Proceedings of the 4th International Symposium on Image and Signal Processing and Analysis, 2005, : 100 - 104
  • [25] An approach for singularity avoidance path planning of parallel robots
    Yu, H
    Wang, JS
    Duan, GH
    Sun, LN
    ELEVENTH WORLD CONGRESS IN MECHANISM AND MACHINE SCIENCE, VOLS 1-5, PROCEEDINGS, 2004, : 1961 - 1965
  • [26] Fast massively parallel algorithms for shortest path within planar figures
    Kapralski, A
    VISUAL COMPUTER, 1996, 12 (10): : 484 - 502
  • [27] A fast method for the implementation of common vector approach
    Koc, Mehmet
    Barkana, Atalay
    Gerek, Oemer N.
    INFORMATION SCIENCES, 2010, 180 (20) : 4084 - 4098
  • [28] General framework for removal of clock network pessimism
    Zejda, J
    Frain, P
    IEEE/ACM INTERNATIONAL CONFERENCE ON CAD-02, DIGEST OF TECHNICAL PAPERS, 2002, : 632 - 639
  • [29] Common Path swept-source OCT interferometer with artifact removal
    Vergnole, Sebastien
    Lamouche, Guy
    Dufour, Marc L.
    Gauthier, Bruno
    COHERENCE DOMAIN OPTICAL METHODS AND OPTICAL COHERENCE TOMOGRAPHY IN BIOMEDICINE XII, 2008, 6847
  • [30] Fast Iterative Graph Computation: A Path Centric Approach
    Yuan, Pingpeng
    Zhang, Wenya
    Xie, Changfeng
    Jin, Hai
    Liu, Ling
    Lee, Kisung
    SC14: INTERNATIONAL CONFERENCE FOR HIGH PERFORMANCE COMPUTING, NETWORKING, STORAGE AND ANALYSIS, 2014, : 401 - 412