Dense linear algebra codes are often expressed and coded in terms of BLAS calls. This approach, however, achieves suboptimal performance due to the overheads associated to such calls. Taking as an example the dense Cholesky factorization of a symmetric positive definite matrix we show that the potential of non-canonical data structures for dense linear algebra can be better exploited with the use of specialized inner kernels. The use of non-canonical data structures together with specialized inner kernels has low overhead and can produce excellent performance. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Herrero, J. R. (2008). New data structures for matrices and specialized inner kernels: Low overhead for high performance. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4967 LNCS, pp. 659–667). https://doi.org/10.1007/978-3-540-68111-3_69
Mendeley helps you to discover research relevant for your work.