메뉴 건너뛰기




Volumn 29, Issue 6, 2003, Pages 679-690

A parallel 1-D FFT algorithm for the Hitachi SR8000

Author keywords

All to all communication; Cyclic distribution; Distributed memory parallel computer; Fast Fourier transform; Vector symmetric multiprocessor

Indexed keywords

ALGORITHMS; DATA REDUCTION; DATA STORAGE EQUIPMENT; FAST FOURIER TRANSFORMS;

EID: 0038147173     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8191(03)00039-5     Document Type: Article
Times cited : (16)

References (18)
  • 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
  • 3
    • 21844493537 scopus 로고
    • A self-sorting in-place fast Fourier transform algorithm suitable for vector and parallel processing
    • Hegland M. A self-sorting in-place fast Fourier transform algorithm suitable for vector and parallel processing. Numerische Mathematik. 68:1994;507-547.
    • (1994) Numerische Mathematik , vol.68 , pp. 507-547
    • Hegland, M.1
  • 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 Comput. 22:1996;539-553.
    • (1996) Parallel Comput. , vol.22 , pp. 539-553
    • Hegland, M.1
  • 7
    • 0025403252 scopus 로고
    • FFTs in external or hierarchical memory
    • Bailey D.H. FFTs in external or hierarchical memory. J. Supercomput. 4:1990;23-35.
    • (1990) J. Supercomput. , vol.4 , pp. 23-35
    • Bailey, D.H.1
  • 9
    • 0034159014 scopus 로고    scopus 로고
    • Effective implementations of multi-dimensional radix-2 FFT
    • Yamamoto S. Effective implementations of multi-dimensional radix-2 FFT. Comput. Phys. Commun. 125:2000;1-7.
    • (2000) Comput. Phys. Commun. , vol.125 , pp. 1-7
    • Yamamoto, S.1
  • 13
    • 84937396109 scopus 로고    scopus 로고
    • Pseudovectorization, SMP, and message passing on the Hitachi SR8000-F1
    • Proceedings of the 6th International Euro-Par Conference (Euro-Par 2000), Springer-Verlag
    • M. Brehm, R. Bader, H. Heller, R. Ebner, Pseudovectorization, SMP, and message passing on the Hitachi SR8000-F1, in: Proceedings of the 6th International Euro-Par Conference (Euro-Par 2000), Vol. 1900 of Lecture Notes in Computer Science, Springer-Verlag, 2000, pp. 1351-1361.
    • (2000) Lecture Notes in Computer Science , vol.1900 , pp. 1351-1361
    • Brehm, M.1    Bader, R.2    Heller, H.3    Ebner, R.4
  • 14
    • 0037911255 scopus 로고
    • An implementation of multiple and multi-variate Fourier transforms on vector processors
    • Hegland M. An implementation of multiple and multi-variate Fourier transforms on vector processors. SIAM J. Sci. Comput. 16:1995;271-288.
    • (1995) SIAM J. Sci. Comput. , vol.16 , pp. 271-288
    • Hegland, M.1
  • 15
    • 0001316941 scopus 로고
    • An adaptation of the fast Fourier transform for parallel processing
    • Pease M.C. An adaptation of the fast Fourier transform for parallel processing. J. ACM. 15:1968;252-264.
    • (1968) J. ACM , vol.15 , pp. 252-264
    • Pease, M.C.1
  • 16
    • 0021470572 scopus 로고
    • FFT algorithms for vector computers
    • Swarztrauber P.N. FFT algorithms for vector computers. Parallel Comput. 1:1984;45-63.
    • (1984) Parallel Comput. , vol.1 , pp. 45-63
    • Swarztrauber, P.N.1
  • 17
    • 0031261334 scopus 로고    scopus 로고
    • Fast radix 2, 3, 4, and 5 kernefor for fast Fourier transformations on computers with overlapping multiply-add instructions
    • Goedecker S. Fast radix 2, 3, 4, and 5 kernefor for fast Fourier transformations on computers with overlapping multiply-add instructions. SIAM J. Sci. Comput. 18:1997;1605-1611.
    • (1997) SIAM J. Sci. Comput. , vol.18 , pp. 1605-1611
    • Goedecker, S.1
  • 18
    • 0035341167 scopus 로고    scopus 로고
    • An extended split-radix FFT algorithm
    • Takahashi D. An extended split-radix FFT algorithm. IEEE Signal Process. Lett. 8:2001;145-147.
    • (2001) IEEE Signal Process. Lett. , vol.8 , pp. 145-147
    • Takahashi, D.1


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