Presentation
Path-Based Timing Analysis Acceleration via Segment-Level Timing Arc Reuse
DescriptionPath-Based Static Timing Analysis (PBA) offers high accuracy but incurs high runtime due to redundant computations. We present a segment-level reuse framework that accelerates PBA by reducing its inherent complexity. Timing paths are decomposed into multi-fanin-bounded segments, enabling delay reuse across structurally identical subpaths. A dual-indexed SegHashMap and a slew-sensitive model with Sobolev supervision ensure safe, pessimism-preserving reuse. Our segment-centric engine reconstructs end-to-end delays with minimal overhead. Experiments show 195× average speedup over parallel CPU PBA and 2–3× gains over GPU methods—highlighting complexity reduction as a promising new direction for scalable timing sign-off.
Event Type
Research Manuscript
TimeMonday, July 2710:30am - 10:43am PDT
LocationMtg Room 202AB