A comparison of optimal FFTs on torus and hypercube multicomputers

Parallel Computing

Volumn 27, Issue 6, 2001, Pages 847-859

  Swarztrauber, Paul N ^a   Hammond, Steven W ^a  

^a NATIONAL CENTER FOR ATMOSPHERIC RESEARCH   (United States)

Author keywords

Comparing torus and hypercube; Hypercube FFTs; Multiprocessor FFTs; Parallel communication algorithms; Torus FFTs

Indexed keywords

BANDWIDTH; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; COMPUTER ARCHITECTURE; DIGITAL ARITHMETIC; FAST FOURIER TRANSFORMS; INTERCONNECTION NETWORKS; PARALLEL ALGORITHMS;

HYPERCUBES; TORUS;

PARALLEL PROCESSING SYSTEMS;

EID: 0035342056     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8191(00)00107-1     Document Type: Article

References (17)

1. Optimal communication algorithms for hypercubes
2. Hypercubes vs 2D meshes
3. Design and performance of a scalable parallel community climate model
4. Optimal matrix transposition and bit reversal on hypercubes: All-to-all personalized communication
5. Index transformation algorithms in a linear algebra framework
6. Spanning graphs for optimum broadcasting and personalized communication in hypercubes
7. Optimal communication channel utilization for matrix transpose and related permutations on binary cubes
8. Problems with comparing interconnection networks: Is an alligator better than an Armadillo?
9. Data communication in hypercubes
10. Intensive hypercube communication: Prearranged communication in link-bound hypercubes
11. Supporting the hypercube programming model on mesh architectures
12. Multiprocessor FFTs
13. The vector parallel paradigm
14. Spectral transform methods for solving the shallow water equations on the sphere
15. Transposing arrays on multicomputers using de Bruijn sequences
16. Communication algorithms for isotropic tasks in hypercubes and wraparound meshes