Summary: Portable Parallel FFT for MIMD Multiprocessors
appeared in Concurrency Practice and Experience, 10:8, (1998),583605
Computer Science Dept.
School of Mathematical Sciences
TelAviv 69978 Israel
A portable parallelization of the CooleyTukey FFT algorithm for MIMD multipro
cessors is presented. The implementation uses the Virtual Machine for MultiProcessors
(VMMP) and PVN  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 (MOSrunning 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.