Efficient implementation of parallel three-dimensional FFT on clusters of PCs |
| |
Authors: | Daisuke Takahashi |
| |
Affiliation: | Institute of Information Sciences and Electronics, University of Tsukuba 1-1-1 Tennodai, Tsukuba-shi, Ibaraki 305-8573, Japan |
| |
Abstract: | In this paper, we propose a high-performance parallel three-dimensional fast Fourier transform (FFT) algorithm on clusters of PCs. The three-dimensional FFT algorithm can be altered into a block three-dimensional FFT algorithm to reduce the number of cache misses. We show that the block three-dimensional FFT algorithm improves performance by utilizing the cache memory effectively. We use the block three-dimensional FFT algorithm to implement the parallel three-dimensional FFT algorithm. We succeeded in obtaining performance of over 1.3 GFLOPS on an 8-node dual Pentium III 1 GHz PC SMP cluster. |
| |
Keywords: | 02 70 -c |
本文献已被 ScienceDirect 等数据库收录! |
|