메뉴 건너뛰기




Volumn 2716, Issue , 2003, Pages 99-108

An OpenMP implementation of parallel FFT and its performance on IA-64 processors

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPLICATION PROGRAMMING INTERFACES (API); CACHE MEMORY; ONE DIMENSIONAL;

EID: 34548206810     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45009-2_8     Document Type: Article
Times cited : (8)

References (11)
  • 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
    • 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
  • 6
    • 84945901304 scopus 로고    scopus 로고
    • A blocking algorithm for parallel 1-D FFT on shared-memory parallel computers
    • Proc. 6th International Conference on Applied Parallel Computing (PARA 2002) Springer-Verlag
    • Takahashi, D.: A blocking algorithm for parallel 1-D FFT on shared-memory parallel computers. In: Proc. 6th International Conference on Applied Parallel Computing (PARA 2002). Volume 2367 of Lecture Notes in Computer Science., Springer-Verlag (2002) 380-389
    • (2002) Lecture Notes in Computer Science , vol.2367 , pp. 380-389
    • Takahashi, D.1
  • 7
    • 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
  • 10
    • 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
  • 11
    • 84958951221 scopus 로고    scopus 로고
    • Performance evaluation of OpenMP applications with nested parallelism
    • Proc. 5th Workshop on Languages, Compilers, and Run-Time Systems for Scalable Computers (LCR 2000). Springer-Verlag
    • Tanaka, Y., Taura, K., Sato, M., Yonezawa, A.: Performance evaluation of OpenMP applications with nested parallelism. In: Proc. 5th Workshop on Languages, Compilers, and Run-Time Systems for Scalable Computers (LCR 2000). Volume 1915 of Lecture Notes in Computer Science., Springer-Verlag (2000) 100-112
    • (2000) Lecture Notes in Computer Science , vol.1915 , pp. 100-112
    • Tanaka, Y.1    Taura, K.2    Sato, M.3    Yonezawa, A.4


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