dc.rights.license | CC-BY-NC-ND | |
dc.contributor.advisor | Bisseling, Rob | |
dc.contributor.author | Koopman, Thomas | |
dc.date.accessioned | 2022-01-26T00:00:28Z | |
dc.date.available | 2022-01-26T00:00:28Z | |
dc.date.issued | 2022 | |
dc.identifier.uri | https://studenttheses.uu.nl/handle/20.500.12932/395 | |
dc.description.abstract | A 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.sponsorship | Utrecht University | |
dc.language.iso | EN | |
dc.subject | A 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.title | The tensor product of bulk synchronous parallel algorithms | |
dc.type.content | Master Thesis | |
dc.rights.accessrights | Open Access | |
dc.subject.keywords | FFT, BSP, parallle computing, tensor product, category theory | |
dc.subject.courseuu | Mathematical Sciences | |
dc.thesis.id | 1959 | |