Representation-transparent matrix algorithms with scalable performance

Positive results from new object-oriented tools for scientific programming are reported. Using template classes, abstractions of matrix representations are available that subsume conventional row-major, column-major, either Z- or IMorton-order, as well as block-wise combinations of these. Moreover, the design of the Matrix Template Library (MTL) has been independently extended to provide recursators, to support block-recursive algorithms, supplementing MTL’s iterators. Data types modeling both concepts enable the programmer to implement both iterative and recursive algorithms (or even both) on all of the aforementioned matrix representations at once for a wide family of important scientific operations. We illustrate the unrestricted applicability of our matrixrecursator on matrix multiplication. The same generic blockrecursive function, unaltered, is instantiated on different triplets of matrix types. Within a base block, either a library multiplication or a user-provided, platfo...

• Type: Conference
• Year: 2007
• Where: ICS
• Authors: Peter Gottschling, David S. Wise, Michael D. Adams
• Keywords: Aforementioned Matrix Representations, ICS 2007, Matrix Representations, Matrix Template Library, Theoretical Computer Science