A Practical Performance Comparison of Two Parallel Fast Fourier Transform Algorithms on Cluster of PCs

この論文にアクセスする

この論文をさがす

著者

抄録

In this paper, we present the performance analysis of two parallel Fast Fourier Transform algorithms, binary-exchange and transpose algorithms. These two algorithms were implemented and tested on a cluster of PCs using Message Passing Interface (MPI). The binary-exchange algorithm implementation was showing less processing and communication time than transpose algorithm.

収録刊行物

  • 電気学会論文誌. C, 電子・情報・システム部門誌 = The transactions of the Institute of Electrical Engineers of Japan. C, A publication of Electronics, Information and System Society

    電気学会論文誌. C, 電子・情報・システム部門誌 = The transactions of the Institute of Electrical Engineers of Japan. C, A publication of Electronics, Information and System Society 124(11), 2382-2383, 2004-11-01

    The Institute of Electrical Engineers of Japan

参考文献:  4件中 1-4件 を表示

各種コード

  • NII論文ID(NAID)
    10013713964
  • NII書誌ID(NCID)
    AN10065950
  • 本文言語コード
    ENG
  • 資料種別
    SHO
  • ISSN
    03854221
  • データ提供元
    CJP書誌  J-STAGE 
ページトップへ