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


1 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
2 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.)
3 However nowadays one builds general purpose switches (communication systems) and does not focus on particular communication topologies
4 Hypercube Topology for 8 machines
5 Seitz and
6 Fox with
7 Caltech
8 64 node
9 Hypercube
10 1983

in Table To:


© 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