Cache optimization for sparse matrix-vector multiplication

Abstract

In this thesis we introduce a cost measure to compare the cache- friendliness of different permutations of the rows and columns of a given matrix. And we implement a simple algorithm that tries to reorder the rows and columns of a given matrix in hopes of increasing the cache- friendliness.