Performance of a pipelined ring algorithm for Fast Fourier Transform on transputer arrays
Data(s) |
01/07/1994
|
---|---|
Resumo |
In this paper a pipelined ring algorithm is presented for efficient computation of one and two dimensional Fast Fourier Transform (FFT) on a message passing multiprocessor. The algorithm has been implemented on a transputer based system and experiments reveal that the algorithm is very efficient. A model for analysing the performance of the algorithm is developed from its computation-communication characteristics. Expressions for execution time, speedup and efficiency are obtained and these expressions are validated with experimental results obtained on a four transputer system. The analytical model is then used to estimate the performance of the algorithm for different number of processors, and for different sizes of the input data. |
Formato |
application/pdf |
Identificador |
http://eprints.iisc.ernet.in/36681/1/PERFORMANCE.pdf Purushotham, J and Basu, A and Kulkarni, D and Patnaik, LM (1994) Performance of a pipelined ring algorithm for Fast Fourier Transform on transputer arrays. In: Computers & Electrical Engineering, 20 (4). 319-326 . |
Publicador |
Elsevier science |
Relação |
http://dx.doi.org/10.1016/0045-7906(94)90045-0 http://eprints.iisc.ernet.in/36681/ |
Palavras-Chave | #Others |
Tipo |
Journal Article PeerReviewed |