Show simple item record

dc.rights.licenseCC-BY-NC-ND
dc.contributor.advisorBisseling, R.H.
dc.contributor.authorKurt, H.
dc.date.accessioned2016-03-01T18:00:47Z
dc.date.available2016-03-01T18:00:47Z
dc.date.issued2016
dc.identifier.urihttps://studenttheses.uu.nl/handle/20.500.12932/21949
dc.description.abstractMondriaan is a hypergraph based matrix partitioner, used to distribute the matrix and vectors in parallel sparse matrix-vector multiplication (SpMV) when calculating the product $u=Av$. In this study, we investigate the problem of distributing the input vector $v$ over our $P$ processors, in order to reduce the number of messages, while keeping the communication volume more or less equal. A novel method assigning each vector element to the lowest numbered processor gives us significantly lower total message count, while keeping the communication volume constant. Another method, a novel hypergraph based heuristic, roughly halves the total amount of messages, while it increases the communication volume. Both newly developed methods provide large reductions in the total amount of messages and can hence be considered as alternative vector distribution methods.
dc.description.sponsorshipUtrecht University
dc.format.extent494931
dc.format.mimetypeapplication/pdf
dc.language.isoen
dc.titleImproving the Mondriaan vector distribution
dc.type.contentMaster Thesis
dc.rights.accessrightsOpen Access
dc.subject.keywordsmondriaan; parallel algorithms; sparse matrix vector multiplication; vector distribution
dc.subject.courseuuMathematical Sciences


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record