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.

Conference Day
Tue 25 Jun

Displayed time zone: Tijuana, Baja California change

16:00 - 17:00
PerformancePLDI Research Papers at 224AB
Chair(s): Ting CaoMicrosoft Research
16:00
20m
Talk
Co-optimizing Memory-Level Parallelism and Cache-Level Parallelism
PLDI Research Papers
Xulong TangPenn State, Mahmut Taylan KandemirPennsylvania State University, USA, Mustafa KarakoyTOBB University of Economics and Technology, Turkey, Meenakshi ArunachalamIntel, USA
Media Attached
16:20
20m
Talk
Low-Latency Graph Streaming using Compressed Purely-Functional Trees
PLDI Research Papers
Laxman DhulipalaCarnegie Mellon University, Guy E. BlellochCarnegie Mellon University, Julian ShunMIT
16:40
20m
Talk
Composable, Sound Transformations of Nested Recursion and Loops
PLDI Research Papers
Kirshanthan SundararajahPurdue University, Milind KulkarniPurdue University
Media Attached