Basic HTML version of Foils prepared April 22 2000

Foil 37 Parallel FFT and Hypercubes II

From Parallel FFT and use in PDE Solvers Computational Science Class CPS615 -- Winter Semester 2000. by Geoffrey C. Fox


The relevance of this to Cooley Tukey FFT can be seen from basic recursive step which precisely involves linking Fourier coefficients which also just differ by one in a single binary digit
Hypercube had other useful features e.g. the 64 node 6 dimensional hypercube includes meshes (8 by 8, 4 by 4 by 4, 2 by 8 by 4 etc.)
However nowadays one builds general purpose switches (communication systems) and does not focus on particular communication topologies
Hypercube Topology for 8 machines
Seitz and
Fox with
Caltech
64 node
Hypercube
1983



© Northeast Parallel Architectures Center, Syracuse University, npac@npac.syr.edu

If you have any comments about this server, send e-mail to webmaster@npac.syr.edu.

Page produced by wwwfoil on Mon Apr 24 2000