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:20220715T000509Z
LOCATION:Level 2 Lobby
DTSTART;TZID=America/Los_Angeles:20220713T180000
DTEND;TZID=America/Los_Angeles:20220713T190000
UID:dac_DAC 2022_sess262_LBR102@linklings.com
SUMMARY:Efficient Timing Propagation with Simultaneous Structural and Pipe
 line Parallelisms
DESCRIPTION:Late Breaking Results Poster, Networking Reception\n\nEfficien
 t Timing Propagation with Simultaneous Structural and Pipeline Parallelism
 s\n\nChiu, Huang\n\nGraph-based timing propagation (GBP) is an essential c
 omponent for all static timing analysis (STA) algorithms. To speed up GBP,
  the state-of-the-art timer leverages the task  graph model to explore str
 uctural parallelism in an STA graph. However, many designs exhibit linear 
 segments that cause the parallelism to serialize, degrading the performanc
 e significantly. To overcome this problem, we introduce an efficient GBP f
 ramework by exploring both structure and pipeline parallelisms in an STA t
 ask graph. Our framework identifies linear segments and parallelizes their
  propagation tasks using embedded pipeline in an STA task graph. We have d
 emonstrated up to 25% performance improvement over the state-of-the-art ta
 sk graph-based timer.
END:VEVENT
END:VCALENDAR