DMCA
The Scalability of FFT on Parallel Computers (1993)
| Venue: | IEEE Transactions on Parallel and Distributed Systems |
| Citations: | 78 - 14 self |
BibTeX
@ARTICLE{Gupta93thescalability,
author = {Anshul Gupta and Vipin Kumar},
title = {The Scalability of FFT on Parallel Computers},
journal = {IEEE Transactions on Parallel and Distributed Systems},
year = {1993},
volume = {4},
pages = {922--932}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
In this paper, we present the scalability analysis of parallel Fast Fourier Transform algorithm on mesh and hypercube connected multicomputers using the isoefficiency metric. The isoefficiency function of an algorithm architecture combination is defined as the rate at which the problem size should grow with the number of processors to maintain a fixed efficiency. On the hypercube architecture, a commonly used parallel FFT algorithm can obtain linearly increasing speedup with respect to the number of processors with only a moderate increase in problem size. But there is a limit on the achievable efficiency and this limit is determined by the ratio of CPU speed and communication bandwidth of the hypercube channels. Efficiencies higher than this threshold value can be obtained if the problem size is increased very rapidly. If the hardware supports cut-through routing, then this threshold can also be overcome by using an alternate less scalable parallel formulation. The scalabilit...
Keyphrases
parallel computer problem size moderate increase achievable efficiency hypercube channel isoefficiency function cut-through routing scalability analysis communication bandwidth cpu speed algorithm architecture combination scalable parallel formulation threshold value hypercube architecture fixed efficiency parallel fft algorithm parallel fast fourier transform algorithm
