โ Scribed by Yonggen Huang; Yakup Paker
No coin nor oath required. For personal study only.
Huang, Y. and Y Paker, A parallel FFT algorithm for transputer networks, Parallel Computing 17 (1991) 895-906 This paper presents a parallel FFT algorithm suitable for MIMD machines_ It has the properties of uniform granularity, the dominance of computation, and suitability to large data matrices The algorithm has been implemented for a tree and cubic types of transputer network in Occam language. A set of performance figures has been derived for different size of networks and initial matrices.
๐ SIMILAR VOLUMES
Tervola, P. and W. Yeung, Parallel Jacobi algorithm for matrix diagonalisation on transputer networks, Parallel Computing 17 (1991) 155-163 We present a parallel algorithm for the determination of the eigenvalues and eigenvectors of a real symmetric matrix. The algorithm allocates a certain number o
The implementation of three parallel sorting algorithms, namely binary sort, odd-even transposition sort and bitonic sort, on a network of transputers is analysedin the paper. The variation in the performance of these algorithms as the number of processors and sort size are changed is investigated.