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:20211208T164414Z
LOCATION:3016
DTSTART;TZID=America/Los_Angeles:20211209T163000
DTEND;TZID=America/Los_Angeles:20211209T170000
UID:dac_DAC 2021_sess104_RESEARCH579@linklings.com
SUMMARY:Ultra-Fast CGRA Scheduling to Enable Run Time, Programmable CGRAs
DESCRIPTION:Research Manuscript\n\nUltra-Fast CGRA Scheduling to Enable Ru
 n Time, Programmable CGRAs\n\nLee\n\nCoarse-Grained Reconfigurable Arrays 
 (CGRAs) offer the potential for both energy-efficiency and high-throughput
  in embedded systems today. One limitation of CGRAs is the extremely long 
 mapping time that can take many hours to complete. This, coupled with stat
 ic programming, limits the number of kernels that can be accelerated.\n\nI
 n this work, we propose a solution that aims to improve performance throug
 h a new low-complexity CGRA mapping algorithm that still achieves comparab
 le performance through key instruction placement restrictions. This result
 s in mapping times in the milliseconds; run time programming, and therefor
 e higher overall performance and efficiency, is now within reach for CGRAs
 .\n\nTopic: Design\n\nKeyword: SoC, Heterogeneous, and Reconfigurable Arch
 itectures\n\nVirtual Program: Presented In-Person
END:VEVENT
END:VCALENDAR