18 citations · 29 across the 13 of their papers we have counts for
8 papers · 1 filter
Linnea: Automatic Generation of Efficient Linear Algebra Programs
Henrik Barthels, Christos Psarras, Paolo Bientinesi
The translation of linear algebra computations into efficient sequences of library calls is a non-trivial task that requires expertise in both linear algebra and high-performance c…
Automatic Generation of Efficient Linear Algebra Programs
Henrik Barthels, Christos Psarras, Paolo Bientinesi
The level of abstraction at which application experts reason about linear algebra computations and the level of abstraction used by developers of high-performance numerical linear…
Program Generation for Linear Algebra Using Multiple Layers of DSLs
Daniele G. Spampinato, Diego Fabregat-Traver, Markus Püschel +1
Numerical software in computational science and engineering often relies on highly-optimized building blocks from libraries such as BLAS and LAPACK, and while such libraries provid…
The Generalized Matrix Chain Algorithm
Henrik Barthels, Marcin Copik, Paolo Bientinesi
In this paper, we present a generalized version of the matrix chain algorithm to generate efficient code for linear algebra problems, a task for which human experts often invest da…
Spin Summations: A High-Performance Perspective
Paul Springer, Devin Matthews, Paolo Bientinesi
Besides tensor contractions, one of the most pronounced computational bottlenecks in the non-orthogonally spin-adapted forms of the quantum chemistry methods CCSDT and CCSDTQ, and…
HPTT: A High-Performance Tensor Transposition C++ Library
Paul Springer, Tong Su, Paolo Bientinesi
Recently we presented TTC, a domain-specific compiler for tensor transpositions. Despite the fact that the performance of the generated code is nearly optimal, due to its offline n…