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 OctDisplayed time zone: Tijuana, Baja California change
Thu 26 Oct
Displayed time zone: Tijuana, Baja California change
10:30 - 12:00 | Optimizing Compilation and VerificationOOPSLA at Regency C Chair(s): Gregor Richards University of Waterloo | ||
10:30 22mTalk | The Tensor Algebra Compiler OOPSLA Fredrik Kjolstad MIT CSAIL, Shoaib Kamil Adobe, Stephen Chou MIT CSAIL, David Lugato CEA, France, Saman Amarasinghe MIT DOI | ||
10:52 22mTalk | TreeFuser: A Framework for Analyzing and Fusing General Recursive Tree Traversals OOPSLA Laith Sakka Purdue University, Kirshanthan Sundararajah Purdue University, Milind Kulkarni Purdue University DOI | ||
11:15 22mTalk | Verifying Spatial Properties of Array Computations OOPSLA Dominic Orchard University of Kent, UK, Mistral Contrastin , Matthew Danish University of Cambridge, UK, Andrew Rice University of Cambridge, UK DOI | ||
11:37 22mTalk | GLORE: Generalized Loop Redundancy Elimination upon LER-Notation OOPSLA DOI | ||