BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Drupal iCal API//EN
X-WR-CALNAME:Events items teaser
X-WR-TIMEZONE:America/Toronto
BEGIN:VTIMEZONE
TZID:America/Toronto
X-LIC-LOCATION:America/Toronto
BEGIN:DAYLIGHT
TZNAME:EDT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
DTSTART:20050403T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20041031T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69b2d958b6528
DTSTART;TZID=America/Toronto:20050923T113000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20050923T113000
URL:https://uwaterloo.ca/artificial-intelligence-group/events/ai-seminar-le
 arning-basic-block-scheduling-heuristics
LOCATION:DC - William G. Davis Computer Research Centre 200 University Aven
 ue West 2306C (AI lab) Waterloo ON N2L 3G1 Canada
SUMMARY:AI seminar: Learning basic block scheduling heuristics from optimal
 \ndata
CLASS:PUBLIC
DESCRIPTION:Speaker: Tyrel Russell\n\nInstruction scheduling is an importan
 t step for improving the\nperformance of object code produced by a compile
 r. A fundamental\nproblem in instruction scheduling is to find a minimum l
 ength schedule\nfor a basic block---a straight-line sequence of code with 
 a single\nentry point and a single exit point---subject to precedence\, la
 tency\,\nand resource constraints. Solving the problem exactly is known to
  be\ndifficult\, and most compilers use a greedy list scheduling algorithm
 \ncoupled with a heuristic.
DTSTAMP:20260312T151848Z
END:VEVENT
END:VCALENDAR