Basic HTML version of Foils prepared April 22 2000

Foil 36 Parallel FFT and Hypercubes I

From Parallel FFT and use in PDE Solvers Computational Science Class CPS615 -- Winter Semester 2000. by Geoffrey C. Fox
1 In days gone by, We used to use hypercube topology for parallel machines
2 Such machines have 2P processor nodes labeled
3 and the communication channels are such that every node x is connected to P other nodes -- connections run to those nodes whose binary representations differs in just one digit. For instance
4 and
5 are connected
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