Multigrid Algorithms on the Hypercube Multiprocessor
Chan, Yousef Saad · IEEE Transactions on Computers · 1986
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.
Cited by 146 works. doi:10.1109/tc.1986.1676698
Authors
References
- The cosmic cube
- Topological properties of hypercubes
- Generalized Hypercube and Hyperbus Structures for a Computer Network
- Multigrid methods: Fundamental algorithms, model problem analysis and applications
- Combinatorial algorithms
- Solution of Partial Differential Equations on Vector and Parallel Computers
- Solution of Partial Differential Equations on Vector and Parallel Computers
- Performance Optimization Using Extended Critical Path Analysis in Multithreaded Programs on Multiprocessors
- Data communication in hypercubes
- MULTIGRID SOLVERS ON PARALLEL COMPUTERS