Write a Blog >>
SPLASH 2017
Sun 22 - Fri 27 October 2017 Vancouver, Canada
Thu 26 Oct 2017 11:37 - 12:00 at Regency C - Optimizing Compilation and Verification Chair(s): Gregor Richards

This paper presents GLORE, a novel approach to enabling the detection and removal of large-scoped redundant computations in nested loops. GLORE works on LER-notation, a new representation of computations in both regular and irregular loops. Together with a set of novel algorithms, it makes GLORE able to systematically consider computation reordering at both the expression level and the loop level in a unified manner. GLORE shows an applicability much broader than prior methods have, and frequently lowers the computational complexities of some nested loops that are elusive to prior optimization techniques, producing significantly larger speedups.

Thu 26 Oct
Times are displayed in time zone: Tijuana, Baja California change

10:30 - 12:00
Optimizing Compilation and VerificationOOPSLA at Regency C
Chair(s): Gregor RichardsUniversity of Waterloo
10:30
22m
Talk
The Tensor Algebra Compiler
OOPSLA
DOI
10:52
22m
Talk
TreeFuser: A Framework for Analyzing and Fusing General Recursive Tree Traversals
OOPSLA
Laith SakkaPurdue University, Kirshanthan SundararajahPurdue University, Milind KulkarniPurdue University
DOI
11:15
22m
Talk
Verifying Spatial Properties of Array Computations
OOPSLA
Dominic OrchardUniversity of Kent, UK, Mistral Contrastin, Matthew DanishUniversity of Cambridge, UK, Andrew RiceUniversity of Cambridge, UK
DOI
11:37
22m
Talk
GLORE: Generalized Loop Redundancy Elimination upon LER-Notation
OOPSLA
Yufei DingNorth Carolina State University, Xipeng ShenNorth Carolina State University
DOI