Multigrid algorithms on the hypercube multiprocessor
Journal Article
·
· IEEE Trans. Comput.; (United States)
This paper examines several ways of implementing multigrid algorithms on the hypercube multiprocessor. The authors consider both the standard multigrid algorithms and a concurrent version proposed by Gannon and Van Rosendale. They 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.
- Research Organization:
- Dept. of Computer Science, Yale Univ., New Haven, CT 06520
- OSTI ID:
- 7152157
- Journal Information:
- IEEE Trans. Comput.; (United States), Journal Name: IEEE Trans. Comput.; (United States) Vol. C-35:11; ISSN ITCOB
- Country of Publication:
- United States
- Language:
- English
Similar Records
Parallel multigrid algorithms implemented on memory-coupled multiprocessors
The fast hartley transform on the hypercube multiprocessors
Topological properties of hypercubes
Journal Article
·
Mon Oct 31 23:00:00 EST 1988
· Nucl. Sci. Eng.; (United States)
·
OSTI ID:6275566
The fast hartley transform on the hypercube multiprocessors
Book
·
Wed Dec 31 23:00:00 EST 1986
·
OSTI ID:6933003
Topological properties of hypercubes
Journal Article
·
Fri Jul 01 00:00:00 EDT 1988
· IEEE Trans. Comput.; (United States)
·
OSTI ID:6890070