research-article

iTimerC: common path pessimism removal using effective reduction methods

Authors:

Yu-Ming Yang,

Yu-Wei Chang,

Iris Hui-Ru JiangAuthors Info & Claims

ICCAD '14: Proceedings of the 2014 IEEE/ACM International Conference on Computer-Aided Design

Pages 600 - 605

Published: 03 November 2014 Publication History

Get Access

Abstract

Static timing analysis is a key process to guarantee timing closure for modern IC designs. Nevertheless, fast growing design complexities and increasing on-chip variations complicate this process. To capture more accurate timing performance of a design, common path pessimism removal is prevalent to eliminate artificially induced pessimism in clock paths during timing analysis. To avoid exhaustive exploration on all paths in a design, in this paper, we present a novel timing analysis framework removing common path pessimism based on block-based static timing analysis, timing graph reduction, and dynamic bounding. Experimental results show that the proposed method is highly scalable, especially with short runtimes for large-scale designs. Moreover, our approach outperforms TAU 2014 timing contest winners, generating accurate results and achieving more than 2.13X speedups.

References

[1]

C. Visweswariah, et al., "First-order incremental block-based statistical timing analysis," in Proc. DAC, July 2004, pp. 331--336.

Digital Library

Google Scholar

[2]

J. Bhasker and R. Chadha, Static timing analysis for nanometer designs: A practical approach, Springer, 2009.

Digital Library

Google Scholar

[3]

N. Gupta, "Removing Pessimism and Optimism in Timing Analysis," EETimes. http://www.eetimes.com/document.asp?doc_id=1279958

Google Scholar

[4]

P. Cunningham, et al., "Clock concurrent optimization," Azuro white paper, Feb. 2009.

Google Scholar

[5]

J. Hu, et al., "TAU 2014 contest on removing Common path pessimism during timing analysis," in Proc. TAU Workshop, Mar. 2014, pp.56--63.

Google Scholar

[6]

J. Zejda and P. Frain, "General framework for removal of clock network pessimism," in Proc. ICCAD, Nov. 2002, pp. 632--639.

Digital Library

Google Scholar

[7]

D. J. Hathaway, et al., "Network timing analysis method which eliminates timing variations between signals traversing a common circuit path," US Patent no. 5,636,372, 1997.

Google Scholar

[8]

K. Kalafala, et al., "System and method for correlated process pessimism removal for static timing analysis," US Patent no. 7,117,466, 2006.

Google Scholar

[9]

R. W. Smith, "Half cycle common path pessimism removal method," US Patent no. 7,765,503, 2010.

Google Scholar

[10]

C. Soviani, et al., "Efficient exhaustive path-based static timing analysis using a fast estimation technique," US Patent no. 8,079,004, 2011.

Google Scholar

[11]

C. M. Darsow and T. D. Helvey, "Implementing forward tracing to reduce pessimism in static timing of logic blocks laid out in parallel structures on an integrated circuit chip," US Patent Application 2012/0023466, 2012.

Google Scholar

[12]

S. Singh, et al., "Common path pessimism removal for hierarchical timing analysis," US Patent no. 8,572,532, 2013.

Google Scholar

Cited By

View all

Lai KHuang THo T(2019)A General Cache Framework for Efficient Generation of Timing Critical PathsProceedings of the 56th Annual Design Automation Conference 201910.1145/3316781.3317744(1-6)Online publication date: 2-Jun-2019
https://dl.acm.org/doi/10.1145/3316781.3317744
Lee PJiang IChen TShin Y(2018)FastpassProceedings of the 23rd Asia and South Pacific Design Automation Conference10.5555/3201607.3201643(172-177)Online publication date: 22-Jan-2018
https://dl.acm.org/doi/10.5555/3201607.3201643
Lee PJiang I(2018)iTimerMACM Transactions on Design Automation of Electronic Systems10.1145/314981823:4(1-21)Online publication date: 11-Jun-2018
https://dl.acm.org/doi/10.1145/3149818
Show More Cited By

Recommendations

iTimerC 2.0: Fast Incremental Timing and CPPR Analysis
ICCAD '15: Proceedings of the IEEE/ACM International Conference on Computer-Aided Design

To achieve timing closure, performance-driven optimizations are repeatedly performed throughout the modern IC design flow. Along with these optimization operations, how to incrementally update timing information efficiently and accurately becomes a ...
TAU 2014 contest on removing common path pessimism during timing analysis
ISPD '14: Proceedings of the 2014 on International symposium on physical design

To margin against modeling limitations in considering design and electrical complexities (e.g., crosstalk coupling, voltage drops) as well as variability (e.g., manufacturing process, environmental), "early" and "late" signal propagation delays in ...
Soft-Clustering Driven Flip-flop Placement Targeting Clock-induced OCV
ISPD '20: Proceedings of the 2020 International Symposium on Physical Design

On-Chip Variation (OCV) in advanced technology nodes introduces delay uncertainties that may cause timing violations. This problem drastically affects the clock tree that, besides the growing design complexity, needs to be appropriately synthesized to ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

ICCAD '14: Proceedings of the 2014 IEEE/ACM International Conference on Computer-Aided Design

November 2014

801 pages

ISBN:9781479962778

General Chair:
Yao-Wen Chang
National Taiwan Univ., Taipei, Taiwan

In-Cooperation

IEEE SSCS Shanghai Chapter
IEEE-EDS: Electronic Devices Society

Publisher

IEEE Press

Publication History

Published: 03 November 2014

Check for updates

Author Tags

Qualifiers

Research-article

Conference

ICCAD '14

Sponsor:

CEDA
ACM
SIGDA

ICCAD '14: IEEE/ACM INTERNATIONAL CONFERENCE ON COMPUTER-AIDED DESIGN

November 3 - 6, 2014

California, San Jose

Acceptance Rates

Overall Acceptance Rate 457 of 1,762 submissions, 26%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
97
Total Downloads

Downloads (Last 12 months)1
Downloads (Last 6 weeks)0

Reflects downloads up to 15 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Lai KHuang THo T(2019)A General Cache Framework for Efficient Generation of Timing Critical PathsProceedings of the 56th Annual Design Automation Conference 201910.1145/3316781.3317744(1-6)Online publication date: 2-Jun-2019
https://dl.acm.org/doi/10.1145/3316781.3317744
Lee PJiang IChen TShin Y(2018)FastpassProceedings of the 23rd Asia and South Pacific Design Automation Conference10.5555/3201607.3201643(172-177)Online publication date: 22-Jan-2018
https://dl.acm.org/doi/10.5555/3201607.3201643
Lee PJiang I(2018)iTimerMACM Transactions on Design Automation of Electronic Systems10.1145/314981823:4(1-21)Online publication date: 11-Jun-2018
https://dl.acm.org/doi/10.1145/3149818
Huang TWong M(2016)UI-Timer 1.0IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/TCAD.2016.252456635:11(1862-1875)Online publication date: 1-Nov-2016
https://dl.acm.org/doi/10.1109/TCAD.2016.2524566
Peddawad CGoel ADheeraj BChandrachoodan NMarculescu DLiu F(2015)iitRACEProceedings of the IEEE/ACM International Conference on Computer-Aided Design10.5555/2840819.2840945(903-909)Online publication date: 2-Nov-2015
https://dl.acm.org/doi/10.5555/2840819.2840945
Huang TWong MMarculescu DLiu F(2015)OpenTimerProceedings of the IEEE/ACM International Conference on Computer-Aided Design10.5555/2840819.2840944(895-902)Online publication date: 2-Nov-2015
https://dl.acm.org/doi/10.5555/2840819.2840944
Lee PJiang ILi CChiu WYang YMarculescu DLiu F(2015)iTimerC 2.0Proceedings of the IEEE/ACM International Conference on Computer-Aided Design10.5555/2840819.2840943(890-894)Online publication date: 2-Nov-2015
https://dl.acm.org/doi/10.5555/2840819.2840943

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Recommendations

iTimerC 2.0: Fast Incremental Timing and CPPR Analysis

TAU 2014 contest on removing common path pessimism during timing analysis

Soft-Clustering Driven Flip-flop Placement Targeting Clock-induced OCV