Summary: Portable Parallel FFT for MIMD Multiprocessors
appeared in Concurrency Practice and Experience, 10:8, (1998),583­605
Amir Averbuch
Eran Gabber
Computer Science Dept.
School of Mathematical Sciences
Tel­Aviv University
Tel­Aviv 69978 Israel
E­Mail: amir@math.tau.ac.il
Abstract
A portable parallelization of the Cooley­Tukey FFT algorithm for MIMD multipro­
cessors is presented. The implementation uses the Virtual Machine for MultiProcessors
(VMMP)[18] and PVN [25] portable software packages. Since VMMP provides the
same set of services on all target machines, a single version of the parallel FFT code
was used for shared memory multiprocessor (25 processors Sequent Symmetry), shared
bus (MOS­running distributed UNIX) and for a distributed memory multiprocessors
(Transputers network and 64 processors IBM SP2). It is accompanied with detailed
performance analysis of the implementations. The algorithm achieved high efficiencies
on all target machines. The analysis indicates that most overheads are caused by the
target architecture and not by VMMP or PVM inefficiencies.

Source: Averbuch, Amir - School of Computer Science, Tel Aviv University

Collections: Computer Technologies and Information Sciences