Fast path-based timing analysis for CPPR

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Common-path-pessimism removal (CPPR) is a pivotal step to achieve accurate timing signoff. Unnecessary pessimism might arise quality-of-result (QoR) concerns such as reporting worse violations than the true timing properties owned by the physical circuit. In other words, signoff timing report will conclude a lower clock frequency at which circuits can operate than actual silicon implementations. Therefore, we introduce in this paper a fast path-based timing analysis for CPPR. Unlike existing approaches which are dominated by explicit path search, we perform implicit path representation which yields significantly smaller search space and faster runtime. Specifically, our algorithm is superior in both space and time saving, from which the 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 timing analysis contest have shown that our algorithm won the first place and achieved the best result in terms of accuracy and runtime over all participating teams.

Original languageEnglish (US)
Title of host publication2014 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 2014 - Digest of Technical Papers
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages596-599
Number of pages4
EditionJanuary
ISBN (Electronic)9781479962785
DOIs
StatePublished - Jan 5 2015
Event2014 33rd IEEE/ACM International Conference on Computer-Aided Design, ICCAD 2014 - San Jose, United States
Duration: Nov 2 2014Nov 6 2014

Publication series

NameIEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers, ICCAD
NumberJanuary
Volume2015-January
ISSN (Print)1092-3152

Other

Other2014 33rd IEEE/ACM International Conference on Computer-Aided Design, ICCAD 2014
CountryUnited States
CitySan Jose
Period11/2/1411/6/14

Fingerprint

Networks (circuits)
Clocks
Data storage equipment
Silicon

ASJC Scopus subject areas

  • Software
  • Computer Science Applications
  • Computer Graphics and Computer-Aided Design

Cite this

Huang, T. W., Wu, P. C., & Wong, M. D. F. (2015). Fast path-based timing analysis for CPPR. In 2014 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 2014 - Digest of Technical Papers (January ed., pp. 596-599). [7001413] (IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers, ICCAD; Vol. 2015-January, No. January). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICCAD.2014.7001413

Fast path-based timing analysis for CPPR. / Huang, Tsung Wei; Wu, Pei Ci; Wong, Martin D.F.

2014 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 2014 - Digest of Technical Papers. January. ed. Institute of Electrical and Electronics Engineers Inc., 2015. p. 596-599 7001413 (IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers, ICCAD; Vol. 2015-January, No. January).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Huang, TW, Wu, PC & Wong, MDF 2015, Fast path-based timing analysis for CPPR. in 2014 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 2014 - Digest of Technical Papers. January edn, 7001413, IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers, ICCAD, no. January, vol. 2015-January, Institute of Electrical and Electronics Engineers Inc., pp. 596-599, 2014 33rd IEEE/ACM International Conference on Computer-Aided Design, ICCAD 2014, San Jose, United States, 11/2/14. https://doi.org/10.1109/ICCAD.2014.7001413
Huang TW, Wu PC, Wong MDF. Fast path-based timing analysis for CPPR. In 2014 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 2014 - Digest of Technical Papers. January ed. Institute of Electrical and Electronics Engineers Inc. 2015. p. 596-599. 7001413. (IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers, ICCAD; January). https://doi.org/10.1109/ICCAD.2014.7001413
Huang, Tsung Wei ; Wu, Pei Ci ; Wong, Martin D.F. / Fast path-based timing analysis for CPPR. 2014 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 2014 - Digest of Technical Papers. January. ed. Institute of Electrical and Electronics Engineers Inc., 2015. pp. 596-599 (IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers, ICCAD; January).
@inproceedings{f1d538da715c463db9d8a76140ea6b97,
title = "Fast path-based timing analysis for CPPR",
abstract = "Common-path-pessimism removal (CPPR) is a pivotal step to achieve accurate timing signoff. Unnecessary pessimism might arise quality-of-result (QoR) concerns such as reporting worse violations than the true timing properties owned by the physical circuit. In other words, signoff timing report will conclude a lower clock frequency at which circuits can operate than actual silicon implementations. Therefore, we introduce in this paper a fast path-based timing analysis for CPPR. Unlike existing approaches which are dominated by explicit path search, we perform implicit path representation which yields significantly smaller search space and faster runtime. Specifically, our algorithm is superior in both space and time saving, from which the 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 timing analysis contest have shown that our algorithm won the first place and achieved the best result in terms of accuracy and runtime over all participating teams.",
author = "Huang, {Tsung Wei} and Wu, {Pei Ci} and Wong, {Martin D.F.}",
year = "2015",
month = "1",
day = "5",
doi = "10.1109/ICCAD.2014.7001413",
language = "English (US)",
series = "IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers, ICCAD",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "January",
pages = "596--599",
booktitle = "2014 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 2014 - Digest of Technical Papers",
address = "United States",
edition = "January",

}

TY - GEN

T1 - Fast path-based timing analysis for CPPR

AU - Huang, Tsung Wei

AU - Wu, Pei Ci

AU - Wong, Martin D.F.

PY - 2015/1/5

Y1 - 2015/1/5

N2 - Common-path-pessimism removal (CPPR) is a pivotal step to achieve accurate timing signoff. Unnecessary pessimism might arise quality-of-result (QoR) concerns such as reporting worse violations than the true timing properties owned by the physical circuit. In other words, signoff timing report will conclude a lower clock frequency at which circuits can operate than actual silicon implementations. Therefore, we introduce in this paper a fast path-based timing analysis for CPPR. Unlike existing approaches which are dominated by explicit path search, we perform implicit path representation which yields significantly smaller search space and faster runtime. Specifically, our algorithm is superior in both space and time saving, from which the 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 timing analysis contest have shown that our algorithm won the first place and achieved the best result in terms of accuracy and runtime over all participating teams.

AB - Common-path-pessimism removal (CPPR) is a pivotal step to achieve accurate timing signoff. Unnecessary pessimism might arise quality-of-result (QoR) concerns such as reporting worse violations than the true timing properties owned by the physical circuit. In other words, signoff timing report will conclude a lower clock frequency at which circuits can operate than actual silicon implementations. Therefore, we introduce in this paper a fast path-based timing analysis for CPPR. Unlike existing approaches which are dominated by explicit path search, we perform implicit path representation which yields significantly smaller search space and faster runtime. Specifically, our algorithm is superior in both space and time saving, from which the 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 timing analysis contest have shown that our algorithm won the first place and achieved the best result in terms of accuracy and runtime over all participating teams.

UR - http://www.scopus.com/inward/record.url?scp=84936884075&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84936884075&partnerID=8YFLogxK

U2 - 10.1109/ICCAD.2014.7001413

DO - 10.1109/ICCAD.2014.7001413

M3 - Conference contribution

AN - SCOPUS:84936884075

T3 - IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers, ICCAD

SP - 596

EP - 599

BT - 2014 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 2014 - Digest of Technical Papers

PB - Institute of Electrical and Electronics Engineers Inc.

ER -