An Efficient Critical Path Generation Algorithm Considering Extensive Path Constraints
The work
| Authors | Guannan Guo; Tsung‐Wei Huang; Chun-Xun Lin; Martin D. F. Wong |
|---|---|
| Editors | |
| Type | misc |
| Year | 2020 |
| Citekey | guo2020efficient |
Where it appeared
| Published in | Proceedings - ACM IEEE Design Automation Conference |
|---|---|
| Publisher | Association for Computing Machinery |
| Pages | 1--6 |
Identifiers
| DOI | 10.1109/dac18072.2020.9218750 |
|---|---|
| OpenAlex | W3091980371 |
Access
| Landing page | https://doi.org/10.1109/dac18072.2020.9218750 |
|---|
From OpenAlex, which stores abstracts as an index of words and their positions: what is shown is rebuilt from that, and reads fluently whether or not it is what the author wrote.
Abstract
In this paper, we introduce a fast and efficient critical path generation algorithm considering extensive path constraints on a Static Timing Analysis (STA) graph. Critical path generation is a key routine in the inner loop of path-based analysis and timing-driven synthesis flows. Our algorithm can report arbitrary numbers of critical paths on a logic cone constrained by a sequence of from/through/to pins under different min/max modes and rise/fall transitions. Our algorithm is general, efficient, and provably good. Experimental results have showed that our algorithm produces reports that matches a golden reference generated by an industrial signoff timer. Our results also correlate to a commercial timer yet achieving more than an order of magnitude speed-up.
How it got here
| How it got here | agent via openalex |
|---|---|
| Added | 2026-10-25 00:24 UTC |
| Not denied by | a person 2026-10-29 17:12 UTC |
Cite it as
@misc{guo2020efficient,
title = {An Efficient Critical Path Generation Algorithm Considering Extensive Path Constraints},
author = {Guannan Guo and Tsung‐Wei Huang and Chun-Xun Lin and Martin D. F. Wong},
year = {2020},
journal = {Proceedings - ACM IEEE Design Automation Conference},
publisher = {Association for Computing Machinery},
pages = {1--6},
doi = {10.1109/dac18072.2020.9218750},
}
This record lives at https://refs.drheap.org/guo2020efficient/ and will keep doing so.