PARALLEL FFT ALGORITHMS FOR MIMD COMPUTERS

被引:0
|
作者
FUNG, MK
NANDI, AK
机构
[1] Electrical Engineering Department, Imperial College of Science Technology and Medicine
关键词
ALGORITHMS; FAST FOURIER TRANSFORMS;
D O I
10.1049/el:19910181
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Two methods of computing the FFT (fast Fourier transform) concurrently by multiple computers are presented. Both methods have been implemented on a set of transputers. The first method runs on a simple cyclic network, whereas the second one requires a hypercube configuration. Based on simulations and analysis, their relative advantages and disadvantages in terms of speed-up performance, memory requirement, and host participation are discussed.
引用
收藏
页码:286 / 288
页数:3
相关论文
共 50 条
  • [41] PARALLEL GRAPH ALGORITHMS FOR HYPERCUBE COMPUTERS
    DAS, SK
    DEO, N
    PRASAD, S
    [J]. PARALLEL COMPUTING, 1990, 13 (02) : 143 - 158
  • [42] Asynchronous genetic algorithms on parallel computers
    Zeigler, Bernard P.
    Kim, Jinwoo
    [J]. Australian Electronics Engineering, 1994, 27 (02):
  • [43] OPTIMAL SORTING ALGORITHMS FOR PARALLEL COMPUTERS
    BAUDET, G
    STEVENSON, D
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 1978, 27 (01) : 84 - 87
  • [44] Introduction to parallel computers: Architecture and algorithms
    Emerson, DR
    [J]. HIGH PERFORMANCE COMPUTING IN FLUID DYNAMICS, 1996, 3 : 1 - 42
  • [45] ELLIPTIC EQUATION ALGORITHMS ON PARALLEL COMPUTERS
    MCBRYAN, OA
    VANDEVELDE, EF
    [J]. COMMUNICATIONS IN APPLIED NUMERICAL METHODS, 1986, 2 (03): : 311 - 316
  • [46] SEISMIC MIGRATION ALGORITHMS ON PARALLEL COMPUTERS
    MADISETTI, VK
    MESSERSCHMITT, DG
    [J]. IEEE TRANSACTIONS ON SIGNAL PROCESSING, 1991, 39 (07) : 1642 - 1654
  • [47] SOME ALGORITHMS FOR VECTOR OR PARALLEL COMPUTERS
    ERHEL, J
    LICHNEWSKY, A
    THOMASSET, F
    [J]. PHYSICA A, 1984, 124 (1-3): : 587 - 602
  • [48] FFT ALGORITHMS FOR SIMD PARALLEL PROCESSING SYSTEMS
    JAMIESON, LH
    MUELLER, PT
    SIEGEL, HJ
    [J]. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1986, 3 (01) : 48 - 71
  • [49] Reducing the synchronization overhead in parallel nonsymmetric Krylov algorithms on MIMD machines
    Maheswaran, M
    Webb, KJ
    Siegel, HJ
    [J]. 1998 INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING - PROCEEDINGS, 1998, : 405 - 413
  • [50] PERFORMANCE EVALUATION OF THE BINARY TREE ACCESS MECHANISM IN MIMD TYPE PARALLEL COMPUTERS.
    Sueyoshi, Toshinori
    Saisho, Keizo
    Arita, Itsujiro
    [J]. 1600, (17):