Multiprocessor FFT methods

Journal Article · Wed Dec 31 23:00:00 EST 1986 · SIAM J. Sci. Stat. Comput.; (United States)

DOI:https://doi.org/10.1137/0908011· OSTI ID:6442255

Briggs, W L; Hart, L B; Sweet, R A; O'Gallagher, A

Proceeding first by experiment and then by analysis, the problem of implementing FFT algorithms on a shared memory multiprocessor is investigated. Several algorithms for performing a single FFT and multiple FFTs are implemented and compared on the Denelcor HEP computer. These algorithms are then analyzed using performance models which reproduce the experimental timing curves. For both the single and multiple FFT a clear choice of superior algorithms can be made. These algorithms are expected to be useful and to preserve their performance characteristics on other shared memory multiprocessors.

• Research Organization: Mathematics Dept., Univ. of Colorado, Denver, CO 80202
• OSTI ID: 6442255
• Journal Information: SIAM J. Sci. Stat. Comput.; (United States), Journal Name: SIAM J. Sci. Stat. Comput.; (United States) Vol. 8:1; ISSN SIJCD
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
990210* -- Supercomputers-- (1987-1989)
ALGORITHMS
ARRAY PROCESSORS
COMPUTERS
DENELCOR COMPUTERS
DIGITAL COMPUTERS
FOURIER TRANSFORMATION
GRAPHS
INTEGRAL TRANSFORMATIONS
MATHEMATICAL LOGIC
MATHEMATICAL MODELS
MEMORY DEVICES
PARALLEL PROCESSING
PERFORMANCE
PROGRAMMING
RESEARCH PROGRAMS
SUPERCOMPUTERS
TIME DEPENDENCE
TRANSFORMATIONS