A Provably Good and Practically Efficient Algorithm for Common Path Pessimism Removal in Large Designs

Common path pessimism removal (CPPR) is imperative for eliminating redundant pessimism during static timing analysis (STA). However, turning on CPPR can significantly increase the analysis runtime by 10-100\times in large designs. Recent years have seen much research on improving the algorithmic eff...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:2021 58th ACM/IEEE Design Automation Conference (DAC) s. 715 - 720
Hlavní autori: Guo, Zizheng, Huang, Tsung-Wei, Lin, Yibo
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 05.12.2021
Predmet:
Algorithmic efficiency
Data structures
Design automation
Graphics processing units
Runtime
Timing
Turning
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract Common path pessimism removal (CPPR) is imperative for eliminating redundant pessimism during static timing analysis (STA). However, turning on CPPR can significantly increase the analysis runtime by 10-100\times in large designs. Recent years have seen much research on improving the algorithmic efficiencies of CPPR, but most are architecturally constrained by either the speed-accuracy trade-off or design-specific pruning heuristics. In this paper, we introduce a novel CPPR algorithm that is provably good and practically efficient. We have evaluated our algorithm on large industrial designs and demonstrated promising performance over the current state-of-the-art. As an example, our algorithm outperforms the baseline by 36-135\times faster when generating the top-10K post-CPPR critical paths on a million-gate design. At the extreme, our algorithm with one core is even 4-16\times faster than the baseline with 8 cores.
AbstractList Common path pessimism removal (CPPR) is imperative for eliminating redundant pessimism during static timing analysis (STA). However, turning on CPPR can significantly increase the analysis runtime by 10-100\times in large designs. Recent years have seen much research on improving the algorithmic efficiencies of CPPR, but most are architecturally constrained by either the speed-accuracy trade-off or design-specific pruning heuristics. In this paper, we introduce a novel CPPR algorithm that is provably good and practically efficient. We have evaluated our algorithm on large industrial designs and demonstrated promising performance over the current state-of-the-art. As an example, our algorithm outperforms the baseline by 36-135\times faster when generating the top-10K post-CPPR critical paths on a million-gate design. At the extreme, our algorithm with one core is even 4-16\times faster than the baseline with 8 cores.
Author Guo, Zizheng
Huang, Tsung-Wei
Lin, Yibo
Author_xml – sequence: 1
  givenname: Zizheng
  surname: Guo
  fullname: Guo, Zizheng
  email: gzz@pku.edu.cn
  organization: Peking University,CECA, CS Department,Beijing,China
– sequence: 2
  givenname: Tsung-Wei
  surname: Huang
  fullname: Huang, Tsung-Wei
  email: tsung-wei.huang@utah.edu
  organization: University of Utah,ECE Department,Salt Lake City,USA
– sequence: 3
  givenname: Yibo
  surname: Lin
  fullname: Lin, Yibo
  email: yibolin@pku.edu.cn
  organization: Peking University,CECA, CS Department,Beijing,China
BookMark eNotkF1LwzAYhSMoqHO_QIT8gc2k-exl6eYmFByi1-NN-2YLNIm0Rdi_t-Buzjk8F8_FeSS3KSck5IWzNeesfN1UNbfMyHXBCr4uldXMqhuyLI3lWispCiPZPVmOY3BMM2XlnA_EV_Qw5F9w_YXucu4opG4m0E6hhX6GW-9DGzBNtOpPeQjTOVKfB1rnGHOiB5jO9ICzNYYx0k-Ms6ynIdEGhhPSDY7hlMYncuehH3F57QX5ftt-1ftV87F7r6tmBYU108oJ57Ur0RgtlbNWtUYJ5EopxrvOoudeWy7naQprXcul4BqgFK0ACxzEgjz_ewMiHn-GEGG4HK9viD-gp1fv
ContentType Conference Proceeding
DBID 6IE
6IH
CBEJK
RIE
RIO
DOI 10.1109/DAC18074.2021.9586085
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan (POP) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP) 1998-present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
EISBN 9781665432740
1665432748
EndPage 720
ExternalDocumentID 9586085
Genre orig-research
GrantInformation_xml – fundername: National Science Foundation
  funderid: 10.13039/100000001
GroupedDBID 6IE
6IH
ACM
ALMA_UNASSIGNED_HOLDINGS
CBEJK
RIE
RIO
ID FETCH-LOGICAL-a287t-b3bf6b9e77645b885c753e155501dd8ef1f6814dd87288bc14316aa93c3a8a1a3
IEDL.DBID RIE
ISICitedReferencesCount 22
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000766079700120&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
IngestDate Wed Aug 27 02:28:30 EDT 2025
IsPeerReviewed false
IsScholarly true
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-a287t-b3bf6b9e77645b885c753e155501dd8ef1f6814dd87288bc14316aa93c3a8a1a3
PageCount 6
ParticipantIDs ieee_primary_9586085
PublicationCentury 2000
PublicationDate 2021-Dec.-5
PublicationDateYYYYMMDD 2021-12-05
PublicationDate_xml – month: 12
  year: 2021
  text: 2021-Dec.-5
  day: 05
PublicationDecade 2020
PublicationTitle 2021 58th ACM/IEEE Design Automation Conference (DAC)
PublicationTitleAbbrev DAC
PublicationYear 2021
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssib060584060
Score 2.2972758
Snippet Common path pessimism removal (CPPR) is imperative for eliminating redundant pessimism during static timing analysis (STA). However, turning on CPPR can...
SourceID ieee
SourceType Publisher
StartPage 715
SubjectTerms Algorithmic efficiency
Data structures
Design automation
Graphics processing units
Runtime
Timing
Turning
Title A Provably Good and Practically Efficient Algorithm for Common Path Pessimism Removal in Large Designs
URI https://ieeexplore.ieee.org/document/9586085
WOSCitedRecordID wos000766079700120&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3Pa8IwFA4qO-y0DR37TQ47rtrYtEmO4o_tIFLGNrxJ0iSboK1oFfbf7yV2jsEuu4UHTel7pe99zfe9h9C9pZInNHNIFeAqjRIbCAmoVWtmiBWaGj957m3MJhM-nYq0hh4OWhhjjCefmbZb-rN8XWRb96usI2KeQIlQR3XGkr1W6_vdcad7kJvCSqRDQtEZ9PrEtXoBENgl7eraX0NUfA4Znfzv7qeo9SPGw-khzZyhmsmbyPacbSfV4hM_FoXGMtd433sInA7GoW8NARvi3uK9WM_LjyWG-hQ7QUiR4xQKP5w6CizEeYmfzRI2W-B5jseOGo4HntixaaHX0fCl_xRUIxMCCdCnDFSkbKKEAf_QWHEeZwBHDNQMcUi05sYSm3BCYcm6nKuMOCW8lCLKIsklkdE5auRFbi4QhqdijEF9RKVyJFTBwlAyYeEzoBLLwkvUdD6arfZdMWaVe67-Nl-jYxcGTwSJb1CjXG_NLTrKduV8s77zofwCkdqfTw
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3dS8MwEA9zCvqksonf5sFHuzXrR5LHsQ8n1lFkyt5G0iQ62FrZuoH_vZeuTgRffAsHTeld6d2v-f3uELo1vmChn1ikCnDV90LjcAGoVSmqieHK18XkudeIDodsPOZxBd1ttTBa64J8pht2WZzlqyxZ2V9lTR6wEEqEHbRrJ2eVaq3vt8ee70F2ckuZDnF5s9vuENvsBWBgizTKq3-NUSmySP_wf_c_QvUfOR6Ot4nmGFV0WkOmbW1rIWef-D7LFBapwpvuQ-B2MPaK5hCwIW7P3rLFNH-fY6hQsZWEZCmOofTDsSXBQqTn-FnPYbMZnqY4suRw3C2oHcs6eun3Rp2BUw5NcASAn9yRnjSh5JrS0A8kY0ECgERD1RC4RCmmDTEhIz4saYsxmRCrhReCe4knmCDCO0HVNEv1KcLwVJRSqJB8IS0NlVPXFZQb-BDI0FD3DNWsjyYfm74Yk9I953-bb9D-YPQUTaKH4eMFOrAhKWghwSWq5ouVvkJ7yTqfLhfXRVi_AA6Hopg
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2021+58th+ACM%2FIEEE+Design+Automation+Conference+%28DAC%29&rft.atitle=A+Provably+Good+and+Practically+Efficient+Algorithm+for+Common+Path+Pessimism+Removal+in+Large+Designs&rft.au=Guo%2C+Zizheng&rft.au=Huang%2C+Tsung-Wei&rft.au=Lin%2C+Yibo&rft.date=2021-12-05&rft.pub=IEEE&rft.spage=715&rft.epage=720&rft_id=info:doi/10.1109%2FDAC18074.2021.9586085&rft.externalDocID=9586085