This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Multigrid Algorithms on the Hypercube Multiprocessor
November 1986 (vol. 35 no. 11)
pp. 969-977
T.F. Chan, Department of Computer Science, Yale University
This paper examines several ways of implementing multigrid algorithms on the hypercube multiprocessor. We consider both the standard multigrid algorithms and a concurrent version proposed by Gannon and Van Rosendale. We present several mappings of the mesh points onto the nodes of the cube. The main property of these mappings, which are based on binary reflected Gray codes, is that the distance between neighboring grid points remains constant from one grid level to another. This results in a communication effective implementation of multigrid algorithms on the hypercube multiprocessor.
Index Terms:
parallel computing, Gray codes, hypercube multiprocessor, multigrid algorithms, partial differential equations
Citation:
T.F. Chan, Y. Saad, "Multigrid Algorithms on the Hypercube Multiprocessor," IEEE Transactions on Computers, vol. 35, no. 11, pp. 969-977, Nov. 1986, doi:10.1109/TC.1986.1676698
Usage of this product signifies your acceptance of the Terms of Use.