Show simple item record

The tensor product of bulk synchronous parallel algorithms

dc.rights.licenseCC-BY-NC-ND
dc.contributor.advisorBisseling, Rob
dc.contributor.authorKoopman, Thomas
dc.date.accessioned2022-01-26T00:00:28Z
dc.date.available2022-01-26T00:00:28Z
dc.date.issued2022
dc.identifier.urihttps://studenttheses.uu.nl/handle/20.500.12932/395
dc.description.abstractA Bulk Synchronous Parallel (BSP) algorithm is a type of parallel algorithm where communication and computation is separated. We present a way to generalise BSP algorithms for linear functions to a BSP algorithm for the tensor product of linear functions. This is applied to the discrete Fourier transform in higher dimensions, yielding a novel parallel algorithm.
dc.description.sponsorshipUtrecht University
dc.language.isoEN
dc.subjectA Bulk Synchronous Parallel (BSP) algorithm is a type of parallel algorithm where communication and computation is separated. We present a way to generalise BSP algorithms for linear functions to a BSP algorithm for the tensor product of linear functions. This is applied to the discrete Fourier transform in higher dimensions, yielding a novel parallel algorithm.
dc.titleThe tensor product of bulk synchronous parallel algorithms
dc.type.contentMaster Thesis
dc.rights.accessrightsOpen Access
dc.subject.keywordsFFT, BSP, parallle computing, tensor product, category theory
dc.subject.courseuuMathematical Sciences
dc.thesis.id1959


Files in this item

Thumbnail
Name:
master_thesis.pdf
Size:
655.0Kb
Format:
PDF
View/Open

This item appears in the following Collection(s)

Show simple item record