BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:America/Los_Angeles
X-LIC-LOCATION:America/Los_Angeles
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20240626T180034Z
LOCATION:3008\, 3rd Floor
DTSTART;TZID=America/Los_Angeles:20240625T113000
DTEND;TZID=America/Los_Angeles:20240625T114500
UID:dac_DAC 2024_sess137_RESEARCH063@linklings.com
SUMMARY:Ink: Efficient Incremental k-Critical Path Generation
DESCRIPTION:Research Manuscript\n\nChe Chang, Tsung-Wei Huang, and Dian-Lu
 n Lin (University of Wisconsin, Madison); Guannan Guo (University of Illin
 ois at Urbana-Champaign); and Shiju Lin (The Chinese University of Hong Ko
 ng)\n\nCritical Path Generation (CPG) is crucial for static timing analysi
 s applications to validate timing constraints. Recent years have witnessed
  CPG algorithms that rank critical paths efficiently and accurately. Howev
 er, they all lack incrementality, which is the ability to quickly update c
 ritical paths after the circuit is incrementally modified. To solve this, 
 we introduce Ink, an efficient incremental CPG algorithm. Ink identifies r
 eusable paths for the next query and effectively prunes the path search sp
 ace. Ink is up to 22.4× faster and consumes up to 31% less memory than a s
 tate-of-the-art timer when generating one million paths on a large design.
 \n\nTopic: EDA\n\nKeyword: Timing and Power Analysis and Optimization\n\nS
 ession Chairs: Yibo Lin (Peking University) and Qi Sun (Cornell University
 )
END:VEVENT
END:VCALENDAR