Abstract
In this paper a new approach is presented in order to overlap all communication intensive steps appearing in the four-step FFT algorithm—initial data distribution, matrix transpose, and final data collection—with computation. The presented method is based on a Kronecker product factorization of the four-step FFT algorithm.
Cite
CITATION STYLE
APA
Karner, H., & Ueberhuber, C. W. (1999). Overlapped four-step FFT computation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1557, pp. 590–591). Springer Verlag. https://doi.org/10.1007/3-540-49164-3_64
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free