Publication: Hierarchical Load Balancing for Parallel Fast Legendre Transforms
Loading...
Open/View Files
Date
1996
Authors
Published Version
Published Version
Journal Title
Journal ISSN
Volume Title
Publisher
The Harvard community has made this article openly available. Please share how this access benefits you.
Citation
Shalaby, Nadia and S. Lennart Johnsson. 1996. Hierarchical Load Balancing for Parallel Fast Legendre Transforms. Harvard Computer Science Group Technical Report TR-18-96.
Abstract
We present a parallel Fast Legendre Transform (FLT) based on the Driscol-Healy algorithm with computation complexity O(N log2N). The parallel FLT is load-balanced in a hierarchical fashion. We use a load-balanced FFT to deduce a load-balanced parallel fast cosine transform, which in turn serves as a building block for the Legendre transform engine, from which the parallel FLT is constructed. We demonstrate how the arithmetic, memory and communication complexities of the parallel FLT are hierarchically derived via the complexity of its modular blocks.
Description
Other Available Sources
Research Data
Keywords
Terms of Use
This article is made available under the terms and conditions applicable to Other Posted Material (LAA), as set forth at Terms of Service