Share Email Print
cover

Proceedings Paper

Performance analysis of a parallel FFT algorithm on a transputer network
Author(s): Kurt Sterzl; Anthony Symons; V. Lakshmi Narasimhan
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper 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.

Paper Details

Date Published: 1 November 1992
PDF: 8 pages
Proc. SPIE 1823, Machine Vision Applications, Architectures, and Systems Integration, (1 November 1992); doi: 10.1117/12.132062
Show Author Affiliations
Kurt Sterzl, Univ. of Queensland (Australia)
Anthony Symons, Univ. of Queensland (Australia)
V. Lakshmi Narasimhan, Univ. of Queensland (Australia)


Published in SPIE Proceedings Vol. 1823:
Machine Vision Applications, Architectures, and Systems Integration
Bruce G. Batchelor; Susan Snell Solomon; Frederick M. Waltz, Editor(s)

© SPIE. Terms of Use
Back to Top