1 November 1992 Performance analysis of a parallel FFT algorithm on a transputer network
Author Affiliations +
Proceedings Volume 1823, Machine Vision Applications, Architectures, and Systems Integration; (1992) https://doi.org/10.1117/12.132062
Event: Applications in Optical Science and Engineering, 1992, Boston, MA, United States
Abstract
Fast Fourier Transforms (FFTs) are frequently employed in various applications such as image processing and speech recognition. Though FFT calculations can be speeded up considerably, real time processing requirements are well above that of modern day uniprocessor systems. Computing power can be substantially increased through the exploitation of the inherent parallelism available in FFT calculations. However, experimental performance analysis of the Parallel FFT (PFFT) algorithm has not been sufficiently investigated in a loosely coupled multiprocessor environment. In this paper we evaluate the implementation of a PFFT on a network of T800 series transputers connected in the form of a grid. We analyze the speedup obtained taking into account both computation load and communication overhead. A rudimentary load balancing algorithm has been incorporated so that load balancing takes into account both computation and communication loads. Realistic performance figures are provided taken through actual measurements on the system and they are compared with figures obtained from an analysis of practical complexity of the implementation.
© (1992) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Kurt Sterzl, Anthony Symons, and V. Lakshmi Narasimhan "Performance analysis of a parallel FFT algorithm on a transputer network", Proc. SPIE 1823, Machine Vision Applications, Architectures, and Systems Integration, (1 November 1992); doi: 10.1117/12.132062; https://doi.org/10.1117/12.132062
PROCEEDINGS
8 PAGES


SHARE
Advertisement
Advertisement
RELATED CONTENT


Back to Top