Recent progress in using recursion as a general technique for producing dense linear algebra library software for today's memory tiered computer systems is presented. To allow for efficient utilization of a memory hierarchy, our approach is to apply the technique of hierarchical blocking. The success of our approach includes novel recursive blocked algorithms, hybrid data formats and superscalar kernels. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Kågström, B. (2006). Management of deep memory hierarchies - Recursive blocked algorithms and hybrid data structures for dense matrix computations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3732 LNCS, pp. 21–32). Springer Verlag. https://doi.org/10.1007/11558958_3
Mendeley helps you to discover research relevant for your work.