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 条
  • [31] A fast path planning approach for unmanned aerial vehicles
    Li, Shidong
    Zhou, Huihua
    Hu, Jia
    Ai, Qing
    Cai, Chao
    CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2015, 27 (13): : 3446 - 3460
  • [32] A fast parallel algorithm for finding the longest common sequence of multiple biosequences
    Chen, Yixin
    Wan, Andrew
    Liu, Wei
    BMC BIOINFORMATICS, 2006, 7 (Suppl 4)
  • [33] A fast parallel algorithm for finding the longest common sequence of multiple biosequences
    Yixin Chen
    Andrew Wan
    Wei Liu
    BMC Bioinformatics, 7
  • [34] A fast parallel longest common subsequence algorithm based on pruning rules
    Liu, Wei
    Chen, Yixin
    Chen, Ling
    Qin, Ling
    FIRST INTERNATIONAL MULTI-SYMPOSIUMS ON COMPUTER AND COMPUTATIONAL SCIENCES (IMSCCS 2006), PROCEEDINGS, VOL 1, 2006, : 27 - +
  • [35] Ghost artifact removal using a parallel imaging approach
    Winkelmann, R
    Börnert, P
    Dössel, O
    MAGNETIC RESONANCE IN MEDICINE, 2005, 54 (04) : 1002 - 1009
  • [36] A parallel computing approach to fast geostatistical areal interpolation
    Guan, Qingfeng
    Kyriakidis, Phaedon C.
    Goodchild, Michael F.
    INTERNATIONAL JOURNAL OF GEOGRAPHICAL INFORMATION SCIENCE, 2011, 25 (08) : 1241 - 1267
  • [37] Parallel common path phase-shifting interferometer with a digital reflective grating
    Bai, Hongyi
    Shan, Mingguang
    Zhong, Zhi
    Guo, Lili
    Zhang, Yabin
    SEVENTH INTERNATIONAL SYMPOSIUM ON PRECISION MECHANICAL MEASUREMENTS, 2016, 9903
  • [38] Schopenhauer's pessimism in Borges: a common Christian heritage
    Plante, Claudia
    HILO DE LA FABULA, 2021, (21):
  • [39] Fast Transmission Matrix Measurement of a Multimode Optical Fiber With Common Path Reference
    Florentin, Raphael
    Kermene, Vincent
    Desfarges-Berthelemot, Agnes
    Barthelemy, Alain
    IEEE PHOTONICS JOURNAL, 2018, 10 (05):
  • [40] A FAST COST-OPTIMAL PARALLEL ALGORITHM FOR THE LOWEST COMMON ANCESTOR PROBLEM
    LIN, R
    OLARIU, S
    PARALLEL COMPUTING, 1992, 18 (05) : 511 - 516