Hydra: Automatic algorithm exploration from linear algebra equations

Alexandre Duchâteau (1) , David A. Padua (2) , Denis Barthou (3, 4)

1 UIUC - Department of Computer Science [UIUC]
2 UIUC - University of Illinois at Urbana-Champaign [Urbana]
3 LaBRI - Laboratoire Bordelais de Recherche en Informatique
4 RUNTIME - Efficient runtime systems for parallel architectures

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.

Domaines: Calcul parallèle, distribué et partagé [cs.DC]

Alexandre Duchâteau, David A. Padua, Denis Barthou. Hydra: Automatic algorithm exploration from linear algebra equations. Code Generation and Optimization, Feb 2013, Shenzhen, China. pp.1-10. ⟨hal-00920869⟩