UI-Timer 1.0: An Ultrafast Path-Based Timing Analysis Algorithm for CPPR

被引:34
作者
Huang, Tsung-Wei [1 ]
Wong, Martin D. F. [1 ]
机构
[1] Univ Illinois, Dept Elect & Comp Engn, Urbana, IL 61801 USA
基金
美国国家科学基金会;
关键词
Common path pessimism removal (CPPR); static timing analysis (STA);
D O I
10.1109/TCAD.2016.2524566
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The recent TAU computer-aided design (CAD) contest has aimed to seek novel ideas for accurate and fast common path pessimism removal (CPPR). Unnecessary pessimism forces the static timing analysis tool to report worse violation than the true timing properties owned by physical circuits, thereby misleading signoff timing into a lower clock frequency at which circuits can operate than actual silicon implementations. Therefore, we introduce in this paper UI-Timer 1.0, a powerful CPPR algorithm which achieves high accuracy and ultrafast runtime. Unlike existing approaches which are dominated by explicit path search, UI-Timer 1.0 proves that by implicit path representation the amount of search effort can be significantly reduced. Our timer is superior in both space and time saving, from which memory storage and important timing quantities are available in constant space and constant time per path during the search. Experimental results on industrial benchmarks released from TAU 2014 CAD contest have justified that UI-Timer 1.0 achieved the best result in terms of accuracy and runtime over existing CPPR algorithms.
引用
收藏
页码:1862 / 1875
页数:14
相关论文
共 24 条
[1]   K*: A heuristic search algorithm for finding the k shortest paths [J].
Aljazzar, Husain ;
Leue, Stefan .
ARTIFICIAL INTELLIGENCE, 2011, 175 (18) :2129-2154
[2]  
[Anonymous], 2015, INCREMENTAL TIMING A
[3]  
[Anonymous], 2009, STATIC TIMING ANAL N
[4]  
[Anonymous], 2014, TAU 2014 CONTEST PES
[5]   MIN-MAX HEAPS AND GENERALIZED PRIORITY-QUEUES [J].
ATKINSON, MD ;
SACK, JR ;
SANTORO, N ;
STROTHOTTE, T .
COMMUNICATIONS OF THE ACM, 1986, 29 (10) :996-1000
[6]   The LCA problem revisited [J].
Bender, MA ;
Farach-Colton, M .
LATIN 2000: THEORETICAL INFORMATICS, 2000, 1776 :88-94
[7]  
Bhardwaj S., 2013, U. S. Patent, Patent No. [20 120 278 778 A1, 20120278778]
[8]  
Cormen T. H., 2009, SINGLE SOURCE SHORTE
[9]  
Eppstein D., 1994, Proceedings. 35th Annual Symposium on Foundations of Computer Science (Cat. No.94CH35717), P154, DOI 10.1109/SFCS.1994.365697
[10]  
Garg V., 2014, Proc. IEEE/ACM ICCAD, P592