SpEQ: Translation of Sparse Codes using Equivalences
In this talk we present SpEQ, a quick and correct strategy for detecting semantics in sparse codes and enabling automatic translation to high-performance library calls or domain-specific languages (DSLs). Sparse compilers can automatically generate fast implementations for given computations using requested storage formats; however, the opposite direction – retrieving high-level computation and storage details from already sparse codes – is largely unaddressed. Sparse codes are difficult to optimize automatically without full knowledge of these computation and storage details, yet, many large programs, such as legacy codes, contain handwritten sparse implementations that are tedious and error-prone to optimize by hand. And, when the next language or DSL is introduced, the process must be repeated.
Tue 25 JunDisplayed time zone: Windhoek change
13:40 - 15:20 | |||
13:40 20mTalk | Equality Saturation and Joins Sparse Max Willsey UC Berkeley | ||
14:00 20mTalk | SpEQ: Translation of Sparse Codes using Equivalences Sparse Avery Laird University of Toronto | ||
14:20 20mTalk | Design DSLs with xDSL Sparse Tobias Grosser University of Cambridge, UK | ||
14:40 20mTalk | Compiling Control Flow in Sparse and Structured Array Programs Sparse Willow Ahrens Massachusetts Institute of Technology | ||
15:00 20mPanel | Panel: Compilation Frameworks Sparse Max Willsey UC Berkeley, Avery Laird University of Toronto, Tobias Grosser University of Cambridge, UK, Willow Ahrens Massachusetts Institute of Technology |