BIB-VERSION:: CS-TR-v2.0
ID:: ncstrl.dartmouthcs//TR97-303
ENTRY:: January 22, 1997
ORGANIZATION:: Dartmouth College, Computer Science
TITLE:: Multiprocessor Out-of-Core FFTs with Distributed Memory and Parallel Disks
TYPE:: Technical Report (paper)
REVISION:: 1
AUTHOR:: Cormen, Thomas H.
AUTHOR:: Wegmann, Jake
AUTHOR:: Nicol, David M.
DATE:: January 1997
RETRIEVAL:: For a paper copy, email <reports@cs.dartmouth.edu>
RETRIEVAL:: For a paper copy, write to
       Technical Report Librarian
       Department of Computer Science
       Dartmouth College
       6211 Sudikoff Laboratory
       Hanover, NH 03755-3510
       USA
RETRIEVAL:: Compressed Postscript at http://www.cs.dartmouth.edu/reports/TR97-303.ps.Z
RETRIEVAL:: PDF at http://www.cs.dartmouth.edu/reports/TR97-303.pdf
ABSTRACT:: 
This paper extends an earlier out-of-core Fast Fourier Transform (FFT)
method for a uniprocessor with the Parallel Disk Model (PDM) to use
multiple processors.  Four out-of-core multiprocessor methods are
examined.  Operationally, these methods differ in the size of
"mini-butterfly" computed in memory and how the data are organized on
the disks and in the distributed memory of the multiprocessor.  The
methods also perform differing amounts of I/O and communication.  Two
of them have the remarkable property that even though they are
computing the FFT on a multiprocessor, all interprocessor
communication occurs outside the mini-butterfly computations.
Performance results on a small workstation cluster indicate that
except for unusual combinations of problem size and memory size, the
methods that do not perform interprocessor communication during the
mini-butterfly computations require approximately 86% of the time of
those that do.  Moreover, the faster methods are much easier to
implement.
NOTE::
Revised version appeared in IOPADS '97.
END:: ncstrl.dartmouthcs//TR97-303