A comparison of optimal FFTs on torus and hypercube multicomputers
From MaRDI portal
Publication:5940995
DOI10.1016/S0167-8191(00)00107-1zbMath0972.68003OpenAlexW2022042949WikidataQ127374483 ScholiaQ127374483MaRDI QIDQ5940995
Paul N. Swarztrauber, Steven W. Hammond
Publication date: 20 August 2001
Published in: Parallel Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-8191(00)00107-1
Network design and communication in computer systems (68M10) Mathematical problems of computer architecture (68M07)
Related Items
Five-step FFT algorithm with reduced computational complexity, THE COMMUNICATION MACHINE, High-order accurate solution of the incompressible Navier-Stokes equations on massively parallel computers