Re:Outperforming LAPACK with C++ metaprogramming
by stochastic_monk on Monday January 29, 2018 @02:17PM
(#16259910)
If your matrices are of arbitrary size, Blaze [0] would be my pick. It has the best performance on their benchmarks, Baptiste Wicht's benchmarks, and my own.
Though if the matrices are guaranteed to be small (like in this example), libxsmm [1] is specialized and highly optimized for this use case and beats its competitors above.
And yes, it's absolutely essential to make sure you didn't just move computations to compile-time.
Though if the matrices are guaranteed to be small (like in this example), libxsmm [1] is specialized and highly optimized for this use case and beats its competitors above.
And yes, it's absolutely essential to make sure you didn't just move computations to compile-time.
[0]: https://bitbucket.org/blaze-lib/blaze
[1]: https://github.com/hfp/libxsmm