BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Representing Data Collections for Analysis and Transformation - To
 mmy McMichen\, Northwestern University
DTSTART:20240308T104500Z
DTEND:20240308T114500Z
UID:TALK212686@talks.cam.ac.uk
CONTACT:Timothy M Jones
DESCRIPTION:To fully leverage the capabilities of modern computer hardware
 \, compilers become a necessity. By automatically applying hundreds of var
 ied optimizations\, compilers generate binaries that make efficient use of
  these capabilities. The intermediate representation (IR) of an optimizing
  compiler is the most important decision in its design\, clearly laying ou
 t the scope and goal of optimizations. For example\, the now ubiquitous us
 e of static single assignment (SSA) forms enhances the compiler’s abilit
 y to perform data flow analysis both accurately and efficiently. However\,
  modern optimizing compilers have turned a blind eye to the representation
  of memory in the program\, leaving optimizations on the layout and usage 
 of memory as a secondary consideration. This decision hands developers the
  arduous task of describing both the semantics and layout of their data in
  memory. As a result\, high-level concepts like data collections are prema
 turely lowered to low-level memory representations. From this\, the compil
 er can only glean conservative information about the memory in a program
 —e.g.\, alias analysis—and can make little to no strong guarantees for
  data collections more complex than arrays. This poses a barrier to optimi
 zation.\nTo remedy this issue\, we propose MEMOIR\, a language-agnostic SS
 A IR for irregular data collections. At the core of MEMOIR is a decoupling
  of the memory used to store data from that used to logically organize dat
 a. With this decoupling\, compiler optimizations can reason about the stat
 e of a collection at any given program point without ambiguity. Through it
 s SSA form\, MEMOIR generalizes a wealth of scalar optimizations to operat
 e on data collections at the element granularity. Additionally\, it opens 
 the door for an entirely new class of memory layout and reuse optimization
 s that are impossible in modern compilers.\n\n 
LOCATION:SS03\, Computer Laboratory\, William Gates Building
END:VEVENT
END:VCALENDAR