Improving the Efficiency of Static Timing Analysis with False Paths.pdfVIP

Improving the Efficiency of Static Timing Analysis with False Paths Shuo Zhou, Bo Yao, Hongyu Chen, Yi Zhu, Mike Hutton Truman Collins, Sridhar Srinivasan, and Chung-Kuan Cheng Altera Corp., San Jose, CA, USA Nanchi Chou, and Peter Suaris Univ. of California at San Diego mhutton@ Mentor Graphics Corp., Wilsonville, OR, USA La Jolla, CA, USA truman_collins@ szhou@ Abstract - We improve the efficiency of static timing analysis the prefix and suffix paths at the vertex. Therefore, by matching the when false paths are considered. The efficiency of timing analysis is prefix and suffix rule sets, we can achieve all the complete true paths critical for the performance driven optimization program because through the vertex. We cover the complete true paths using a timing analysis is invoked heavily in the inner loop. However, when biclique covering approach, and collect the prefix rule sets into rule false paths are dealt in timing analysis, a large number of tags need to collections. A formal proof guarantees that we can propagate and be created and propagated, and thus deteriorated the efficiency. In keep merging the rule collections recursively at every vertex in this paper, we