메뉴 건너뛰기




Volumn 3732 LNCS, Issue , 2006, Pages 1159-1167

An implementation of parallel 3-D FFT using short vector SIMP instructions on clusters of PCs

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; PARALLEL PROCESSING SYSTEMS; PERSONAL COMPUTERS; THREE DIMENSIONAL; VECTORS;

EID: 33745315010     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11558958_139     Document Type: Conference Paper
Times cited : (1)

References (19)
  • 1
    • 84968470212 scopus 로고
    • An algorithm for the machine calculation of complex Fourier series
    • Cooley, J.W., Tukey, J.W.: An algorithm for the machine calculation of complex Fourier series, Math. Comput. 19 (1965) 297-301
    • (1965) Math. Comput. , vol.19 , pp. 297-301
    • Cooley, J.W.1    Tukey, J.W.2
  • 2
    • 0022721382 scopus 로고
    • Two and three dimensional FFTs on highly parallel computers
    • Brass, A., Pawley, G.S.; Two and three dimensional FFTs on highly parallel computers. Parallel Computing 3 (1986) 167-184
    • (1986) Parallel Computing , vol.3 , pp. 167-184
    • Brass, A.1    Pawley, G.S.2
  • 4
    • 0030165735 scopus 로고    scopus 로고
    • Real and complex fast Fourier transforms on the Fujitsu VPP 500
    • Hegland, M.: Real and complex fast Fourier transforms on the Fujitsu VPP 500. Parallel Computing 22 (1996) 539-553
    • (1996) Parallel Computing , vol.22 , pp. 539-553
    • Hegland, M.1
  • 5
    • 0030285174 scopus 로고    scopus 로고
    • Implementation of parallel FFT algorithms on distributed memory machines with a minimum overhead of communication
    • Calvin, C.: Implementation of parallel FFT algorithms on distributed memory machines with a minimum overhead of communication. Parallel Computing 22 (1996) 1255-1279
    • (1996) Parallel Computing , vol.22 , pp. 1255-1279
    • Calvin, C.1
  • 6
    • 0037402659 scopus 로고    scopus 로고
    • Efficient implementation of parallel three-dimensional FFT on clusters of PCs
    • Takahashi, D.: Efficient implementation of parallel three-dimensional FFT on clusters of PCs. Computer Physics Communications 152 (2003) 144-150
    • (2003) Computer Physics Communications , vol.152 , pp. 144-150
    • Takahashi, D.1
  • 10
    • 35048892074 scopus 로고    scopus 로고
    • SIMD vectorization of straight line FFT code
    • Proc. 9th International Euro-Par Conference (Euro-Par 2003). Springer-Verlag
    • Kral, S., Franchetti, F., Lorenz, J., Ueberhuber, C.W.: SIMD vectorization of straight line FFT code. In: Proc. 9th International Euro-Par Conference (Euro-Par 2003). Volume 2790 of Lecture Notes in Computer Science., Springer-Verlag (2003) 251-260
    • (2003) Lecture Notes in Computer Science , vol.2790 , pp. 251-260
    • Kral, S.1    Franchetti, F.2    Lorenz, J.3    Ueberhuber, C.W.4
  • 11
    • 20744449792 scopus 로고    scopus 로고
    • The design and implementation of FFTW3
    • Frigo, M., Johnson, S.G.: The design and implementation of FFTW3. In: Proc. IEEE. Volume 93. (2005) 216-231
    • (2005) Proc. IEEE , vol.93 , pp. 216-231
    • Frigo, M.1    Johnson, S.G.2
  • 13
    • 0025403252 scopus 로고
    • FFTs in external or hierarchical memory
    • Bailey, D.H.: FFTs in external or hierarchical memory. The Journal of Supercomputing 4 (1990) 23-35
    • (1990) The Journal of Supercomputing , vol.4 , pp. 23-35
    • Bailey, D.H.1
  • 18
    • 0021470572 scopus 로고
    • FFT algorithms for vector computers
    • Swarztrauber, P.N.: FFT algorithms for vector computers. Parallel Computing 1 (1984) 45-63
    • (1984) Parallel Computing , vol.1 , pp. 45-63
    • Swarztrauber, P.N.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.