We present two implementations of dense matrix multiplication based on two different non-canonical array layouts: one based on a hypermatrix data structure (HM) where data submatrices are stored using a recursive layout; the other based on a simple block data layout with square blocks (SB) where blocks are arranged in column-major order. We show that the iterative code using SB outperforms a recursive code using HM and obtains competitive results on a variety of platforms. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Herrero, J. R., & Navarro, J. J. (2007). Using non-canonical array layouts in dense matrix operations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4699 LNCS, pp. 580–588). Springer Verlag. https://doi.org/10.1007/978-3-540-75755-9_70
Mendeley helps you to discover research relevant for your work.