FFT algorithms for SIMD parallel processing systems

Journal Article · Fri Feb 28 23:00:00 EST 1986 · J. Parallel Distrib. Comput.; (United States)

DOI:https://doi.org/10.1016/0743-7315(86)90027-4· OSTI ID:6505932

Jamieson, L H; Mueller, Jr, P T; Siegel, H J

SIMD (single instruction stream - multiple data stream) algorithms for one- and two-dimensional discrete Fourier transforms are presented. Parallel structurings of algorithms for efficient computation for a variety of machine size/problem size combinations are presented and analyzed. Through these algorithms, techniques for exploiting relationships between problem size and machine size are demonstrated. The algorithms are evaluated in terms of the number of arithmetic operations and interprocessor data transfers required. The ability of various interconnection networks presented in the literature to perform the needed transfers is examined. It is shown that the efficiency of a particular data distribution/algorithm decomposition approach is a function of the machine-size/problem-size relationship.

• Research Organization: School of Electrical Engineering, Purdue Univ., West Lafayette, IN 47907
• OSTI ID: 6505932
• Journal Information: J. Parallel Distrib. Comput.; (United States), Journal Name: J. Parallel Distrib. Comput.; (United States) Vol. 3:1; ISSN JPDCE
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
990210* -- Supercomputers-- (1987-1989)
990230 -- Mathematics & Mathematical Models-- (1987-1989)
ALGORITHMS
ARRAY PROCESSORS
COMMUNICATIONS
COMPUTERS
DATA TRANSMISSION
DIGITAL COMPUTERS
EFFICIENCY
FOURIER TRANSFORMATION
INTEGRAL TRANSFORMATIONS
MATHEMATICAL LOGIC
MATHEMATICAL OPERATORS
ONE-DIMENSIONAL CALCULATIONS
PARALLEL PROCESSING
PROGRAMMING
SIZE
SUPERCOMPUTERS
TRANSFORMATIONS
TWO-DIMENSIONAL CALCULATIONS