Cache optimization for sparse matrix-vector multiplication
Year: 2015
Type: dissertation
Abstract: In this thesis we introduce a cost measure to compare the cache-\nfriendliness of different permutations of the rows and columns of a given\nmatrix. And we implement a simple algorithm that tries to reorder the\nrows and columns of a given matrix in hopes of increasing the cache-\nfriendliness.
Author: P.J. Mulder
Language: English
Subfield: Hardware and Architecture
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W1420435612
