Tue 25 Jun 2019 16:40 - 17:00 at 224AB - Performance Chair(s): Ting Cao

Scheduling transformations reorder a program's operations to improve locality and/or parallelism. The polyhedral model is a general framework for composing and applying {\em instance-wise} scheduling transformations for loop-based programs, but there is no analogous framework for recursive programs. This paper presents an approach for composing and applying scheduling transformations—like inlining, interchange, and code motion—to nested recursive programs. This paper describes the phases of the approach—representing dynamic instances, composing and applying transformations, reasoning about correctness—and shows that these techniques can verify the soundness of composed transformations.

Tue 25 Jun
Times are displayed in time zone: (GMT-07:00) Tijuana, Baja California change

16:00 - 17:00: PLDI Research Papers - Performance at 224AB
Chair(s): Ting CaoMicrosoft Research
pldi-2019-papers16:00 - 16:20
Xulong TangPenn State, Mahmut Taylan KandemirPennsylvania State University, USA, Mustafa KarakoyTOBB University of Economics and Technology, Turkey, Meenakshi ArunachalamIntel, USA
Media Attached
pldi-2019-papers16:20 - 16:40
Laxman DhulipalaCarnegie Mellon University, Guy E. BlellochCarnegie Mellon University, Julian ShunMIT
pldi-2019-papers16:40 - 17:00
Kirshanthan SundararajahPurdue University, Milind KulkarniPurdue University
Media Attached