The tensor product of bulk synchronous parallel algorithms
Publication date
Authors
DOI
Document Type
Master Thesis
Metadata
Show full item recordCollections
License
CC-BY-NC-ND
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.
Keywords
FFT, BSP, parallle computing, tensor product, category theory