Skip navigation
Skip navigation

Runtime sparse matrix format selection

Armstrong, Warren; Rendell, Alistair


There exist many storage formats for the in-memory representation of sparse matrices. Choosing the format that yields the quickest processing of any given sparse matrix requires considering the exact non-zero structure of the matrix, as well as the current execution environment. Each of these factors can change at runtime. The matrix structure can vary as computation progresses, while the environment can change due to varying system load, the live migration of jobs across a heterogeneous...[Show more]

CollectionsANU Research Publications
Date published: 2010-05
Type: Journal article
Source: Procedia Computer Science
DOI: 10.1016/j.procs.2010.04.016


File Description SizeFormat Image
Armstrong_Runtime2010.pdf133.91 kBAdobe PDFThumbnail

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  20 July 2017/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator