dc.rights.license | CC-BY-NC-ND | |
dc.contributor.advisor | Bisseling, Prof. dr. R.H. | |
dc.contributor.author | Mulder, P.J. | |
dc.date.accessioned | 2015-08-28T17:00:46Z | |
dc.date.available | 2015-08-28T17:00:46Z | |
dc.date.issued | 2015 | |
dc.identifier.uri | https://studenttheses.uu.nl/handle/20.500.12932/21337 | |
dc.description.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. | |
dc.description.sponsorship | Utrecht University | |
dc.format.extent | 1597740 | |
dc.format.mimetype | application/pdf | |
dc.language.iso | en | |
dc.title | Cache optimization for sparse matrix-vector multiplication | |
dc.type.content | Bachelor Thesis | |
dc.rights.accessrights | Open Access | |
dc.subject.keywords | cache optimization, matrix–vector multiplication, sparse matrix, cache-oblivious | |
dc.subject.courseuu | Wiskunde | |