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.

• 社団法人 電気学会の論文
• 2004-11-01

著者

• Qureshi Kalim

  King Fahd University Of Petroleum & Minerals

• Rashid Haroon

  Comsats Institute Of Information Technology

関連論文

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

スポンサーリンク