Paper Info
Title
Hydra: Automatic algorithm exploration from linear algebra equations
Abstract
Hydra accepts an equation written in terms of operations on matrices and automatically produces highly efficient code to solve these equations. Processing of the equation starts by tiling the matrices. This transforms the equation into either a single new equation containing terms involving tiles or into multiple equations some of which can be solved in parallel with each other. Hydra continues transforming the equations using tiling and seeking terms that Hydra knows how to compute or equations it knows how to solve. The end result is that by transforming the equations Hydra can produce multiple solvers with different locality behavior and/or different parallel execution profiles. Next, Hydra applies empirical search over this space of possible solvers to identify the most efficient version. In this way, Hydra enables the automatic production of efficient solvers requiring very little or no coding at all and delivering performance approximating that of the highly tuned library routines such as Intel's MKL.
Year
DOI
Venue
2013
10.1109/CGO.2013.6494999
CGO
Keywords
Field
DocType
linear algebra equation,different locality behavior,efficient solvers,multiple equation,automatic algorithm exploration,multiple solvers,equations hydra,different parallel execution profile,possible solvers,single new equation,efficient version,efficient code,linear algebra,parallel algorithms
Linear algebra,Locality,Matrix (mathematics),Matrix algebra,Computer science,Parallel algorithm,Parallel computing,Algorithm,Coding (social sciences),Lernaean Hydra
Conference
Citations 
PageRank 
References 
0
0.34
6
Authors
3
Name
Order
Citations
PageRank
David A. Padua14540590.45
Denis Barthou223826.14
Alexandre X. Duchateau330.82