Implementation of parallel FFT algorithms on distributed memory machines with a minimum overhead of communication

DOI10.1016/S0167-8191(96)00039-7zbMath0875.68523MaRDI QIDQ1350022

C. Calvin

Publication date: 27 February 1997

Published in: Parallel Computing (Search for Journal in Brave)

zbMATH Keywords

HypercubeMeshTorusMono and bi-dimensional FFTOverlap of communications by computationsPipelining techniques

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Distributed algorithms (68W15)

Related Items (1)

Congruent Number Theta Coefficients to 1012

This page was built for publication: Implementation of parallel FFT algorithms on distributed memory machines with a minimum overhead of communication