BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:America/New_York
X-LIC-LOCATION:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260422T143139Z
LOCATION:Exhibit Hall A3
DTSTART;TZID=America/New_York:20241120T083000
DTEND;TZID=America/New_York:20241120T090000
UID:submissions.supercomputing.org_SC24_sess501_awd101@linklings.com
SUMMARY:High Level Compiler Transformations: Brief History and Application
 s (2024 ACM/IEEE-CS Ken Kennedy Award presentation)
DESCRIPTION:David Padua (University of Illinois Urbana-Champaign)\n\nHigh-
 level compiler transformations were developed soon after the first compile
 rs. They are used to manipulate compound statements such as loops and if s
 tatements in order to vectorize, parallelize, and tile them to benefit fro
 m parallelism and enhance locality.  Since high-level compiler transformat
 ions were at the core of much of Ken Kennedy’s work and have also been the
  main area of interest of the speaker, this is the natural topic for this 
 talk. \n\nThe first part of the talk will contain a brief history of resea
 rch in high-level compiler transformations. The results obtained by Ken Ke
 nnedy and numerous other researchers have been quite influential, to the p
 oint of being ubiquitous in today’s compilers and providing a powerful alg
 ebra of program transformations. Despite the important accomplishments, th
 ere is still much room for improvement, especially in the area of methodol
 ogies for the implementation and application of compiler transformations. 
 \n\nThe second part will focus on compiler instability, which is a manifes
 tation of the lack of a good methodology for compiler implementation and f
 or deciding when to apply each program transformation. Given different ver
 sions of the same program which are obtained from each other by automatic 
 transformations, a compiler is said to be instable when the object codes g
 enerated for these versions have different performances. Instability makes
  compilers weak optimization tools.\n\nA tool, called Locus, will be descr
 ibed in the final part of the presentation. Locus contains a language to c
 oncisely describe a collection of transformations and facilitate the use o
 f search engines. Locus can be used to convert programs into autotuning sy
 stems which by exploring the space of possible versions contribute to atte
 nuate the impact of instability.\n\nRegistration Category: Tech Program Re
 g Pass\n\nSession Chairs: Venkatesh Kannan (Irish Centre for High‑End Comp
 uting (ICHEC)) and Scott Pakin (Los Alamos National Laboratory (LANL))\n\n
END:VEVENT
END:VCALENDAR