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:20260402T024533Z
LOCATION:3004\, Level 3
DTSTART;TZID=America/Los_Angeles:20250625T134500
DTEND;TZID=America/Los_Angeles:20250625T140000
UID:dac_DAC 2025_sess136_RESEARCH1818@linklings.com
SUMMARY:Optimizing Recovery Logic in Speculative HLS
DESCRIPTION:Dylan Leothaud and Jean-Michel Gorius (Université de Rennes), 
 Simon Rokicki (Irisa), and Steven Derrien (Université de Bretagne Occident
 ale)\n\nHigh-Level Synthesis (HLS) excels at handling compute-intensive lo
 ops with straightforward control but struggles to identify parallelism in 
 kernels with complex and irregular control-flow. To address this, novel sc
 heduling techniques based on speculation have been introduced. While these
  methods outperform traditional static scheduling, they also introduce sig
 nificant area overhead, particularly in the rollback control logic. Optimi
 zing the cost of this rollback control logic remains an open challenge. In
  this work, we show how it is possible to simplify and/or eliminate rollba
 ck logic using a combination of static analysis and linear programming. Ou
 r results show improvements in both execution throughput and area cost.\n\
 nTopics: EDA\n\nTracks: EDA5: RTL/Logic Level and High-level Synthesis\n\n
 Session Chairs: Aman Gayasen (Advanced Micro Devices (AMD)) and Christian 
 Pilato (Politecnico di Milano)\n\n
END:VEVENT
END:VCALENDAR