Show simple item record

dc.rights.licenseCC-BY-NC-ND
dc.contributor.advisorBisseling, Prof. dr. R.H.
dc.contributor.authorMulder, P.J.
dc.date.accessioned2015-08-28T17:00:46Z
dc.date.available2015-08-28T17:00:46Z
dc.date.issued2015
dc.identifier.urihttps://studenttheses.uu.nl/handle/20.500.12932/21337
dc.description.abstractIn 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.sponsorshipUtrecht University
dc.format.extent1597740
dc.format.mimetypeapplication/pdf
dc.language.isoen
dc.titleCache optimization for sparse matrix-vector multiplication
dc.type.contentBachelor Thesis
dc.rights.accessrightsOpen Access
dc.subject.keywordscache optimization, matrix–vector multiplication, sparse matrix, cache-oblivious
dc.subject.courseuuWiskunde


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record