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:20260402T024534Z
LOCATION:3004\, Level 3
DTSTART;TZID=America/Los_Angeles:20250623T113000
DTEND;TZID=America/Los_Angeles:20250623T114500
UID:dac_DAC 2025_sess134_RESEARCH1863@linklings.com
SUMMARY:A  Fast, Iterative Clock Skew Scheduling Algorithm with Dynamic Se
 quential Graph Extraction
DESCRIPTION:Shijian Chen (State Key Lab of Processors, Institute of Comput
 ing Technology, Chinese Academy of Sciences); Yihang Qiu (University of Ch
 inese Academy of Sciences); Biwei Xie and Mingyu Chen (State Key Lab of Pr
 ocessors, Institute of Computing Technology, Chinese Academy of Sciences);
  and Xingquan Li (Peng Cheng Laboratory)\n\nClock skew scheduling (CSS) is
  a well-known technique that improves design timing slack by adjusting clo
 ck latency to flip-flops.\nCSS requires obtaining timing path information 
 between sequential elements (including flip-flops and I/O ports), known as
  sequential graph extraction, which is the most time-consuming part of adv
 anced CSS.\nIn this paper, to quickly identify the potential of clock skew
  in slack optimization, we propose an iterative CSS algorithm that leverag
 es timing propagation to facilitate sequential graph extraction.\nThen, we
  provide a comprehensive skew calculation method that considers multiple c
 lock latency constraints, obtaining the target latency of each flip-flop.\
 nFinally, we present slack optimization techniques to achieve the target l
 atencies.\nOur algorithm achieves a 49.11x speedup compared to the advance
 d CSS algorithm based on partial graph extraction, reducing 90.05\% of the
  extracted edges.\nCompared to a state-of-the-art CSS-based slack optimiza
 tion methodology, our algorithm delivers a 27.01x speedup with superior sl
 ack improvement.\n\nTopics: EDA\n\nTracks: EDA3: Timing Analysis and Optim
 ization\n\nSession Chairs: Zhiyao Xie (Hong Kong University of Science and
  Technology (HKUST)) and Xin Zhao (IBM)\n\n
END:VEVENT
END:VCALENDAR
