A blocking algorithm for FFT on cache-based processors

DOI10.1007/3-540-48228-8_58MaRDI QIDQ4535902zbMATH OpenFDO

Authors Daisuke Takahashi

Publication date 16 June 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2110/21100551

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computing methodologies and applications (68U99)

Recommendations

• A blocking algorithm for parallel 1-D FFT on shared-memory parallel computers
• A blocking algorithm for parallel 1-D FFT on clusters of PCs
• An OpenMP implementation of parallel FFT and its performance on IA-64 processors
• FFT algorithms and their adaptation to parallel processing
• scientific article; zbMATH DE number 3997125

Cited in

(3)

• An FFT performance model for optimizing general-purpose processor architecture
• A blocking algorithm for parallel 1-D FFT on shared-memory parallel computers
• A blocking algorithm for parallel 1-D FFT on clusters of PCs

This page was built for publication: A blocking algorithm for FFT on cache-based processors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4535902)