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:20211208T164413Z
LOCATION:Level 2 - Lobby
DTSTART;TZID=America/Los_Angeles:20211208T180000
DTEND;TZID=America/Los_Angeles:20211208T190000
UID:dac_DAC 2021_sess244_LBR114@linklings.com
SUMMARY:Late Breaking Results: An Effective Legalization Algorithm for Het
 erogeneous FPGAs with Complex Constraints
DESCRIPTION:Late Breaking Results Poster, Networking Reception\n\nLate Bre
 aking Results: An Effective Legalization Algorithm for Heterogeneous FPGAs
  with Complex Constraints\n\nHuang\n\nAn ideal legalization method should 
 remove all overlaps and satisfy the design rules (clock, routability, loca
 tion and chain constraints, etc.) while minimizing both the average and ma
 ximum movements. This paper first identifies a virtual range to cluster an
  instance with the location constraint and formulate minimum cost integer 
 linear programming. We use an adaptive algorithm to deal with chain-aware 
 legalization for better quality and runtime trade-offs. Finally, a cell re
 finement technique is proposed to improve the solution quality further. Ex
 perimental results show that our algorithm achieves the best average and m
 aximum cell movements, smallest routed wirelength, and shortest routing ru
 ntime.\n\nVirtual Program: Presented In-Person
END:VEVENT
END:VCALENDAR