Hierarchical Load Balancing for Parallel Fast Legendre Transforms

DSpace/Manakin Repository

Hierarchical Load Balancing for Parallel Fast Legendre Transforms

Citable link to this page

 

 
Title: Hierarchical Load Balancing for Parallel Fast Legendre Transforms
Author: Shalaby, Nadia; Johnsson, S. Lennart

Note: Order does not necessarily reflect citation order of authors.

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.
Full Text & Related Files:
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.
Terms of Use: This article is made available under the terms and conditions applicable to Other Posted Material, as set forth at http://nrs.harvard.edu/urn-3:HUL.InstRepos:dash.current.terms-of-use#LAA
Citable link to this page: http://nrs.harvard.edu/urn-3:HUL.InstRepos:25810999
Downloads of this work:

Show full Dublin Core record

This item appears in the following Collection(s)

 
 

Search DASH


Advanced Search
 
 

Submitters