Communications of the ACM - Special section on computer architecture
Combinatorial Algorithms: Theory and Practice
Combinatorial Algorithms: Theory and Practice
Generalized Hypercube and Hyperbus Structures for a Computer Network
IEEE Transactions on Computers
Processor allocation in an N-cube multiprocessor using gray codes
IEEE Transactions on Computers
Hypernet: A communication-efficient architecture for constructing massively parallel computers
IEEE Transactions on Computers
Matching algorithms to array processors
ACM '87 Proceedings of the 1987 Fall Joint Computer Conference on Exploring technology: today and tomorrow
Message routing in an injured hypercube
C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
A parallel row-based algorithm for standard cell placement with integrated error control
DAC '89 Proceedings of the 26th ACM/IEEE Design Automation Conference
Task migration in hypercube multiprocessors
ISCA '89 Proceedings of the 16th annual international symposium on Computer architecture
Generalized Measures of Fault Tolerance with Application to N-Cube Networks
IEEE Transactions on Computers
Dilation d embedding of a hyper-pyramid into a hypercube
Proceedings of the 1989 ACM/IEEE conference on Supercomputing
On the mapping problem for multi-level systems
Proceedings of the 1989 ACM/IEEE conference on Supercomputing
Adaptive Fault-Tolerant Routing in Hypercube Multicomputers
IEEE Transactions on Computers
Subcube Allocation and Task Migration in Hypercube Multiprocessors
IEEE Transactions on Computers
Parallel Recognition and Parsing on the Hypercube
IEEE Transactions on Computers
The Twisted N-Cube with Application to Multiprocessing
IEEE Transactions on Computers
Analysis of replicated data algorithms on processor array architectures
Proceedings of the 1991 ACM/IEEE conference on Supercomputing
Comparison of hypercube, hypernet, and symmetric hypernet architectures
ACM SIGARCH Computer Architecture News
Parallel Algorithms for Geometric Connected Component Labeling on a Hypercube Multiprocessor
IEEE Transactions on Computers
Embedding hyperpyramids into hypercubes
IBM Journal of Research and Development
RH: A Versatile Family of Reduced Hypercube Interconnection Networks
IEEE Transactions on Parallel and Distributed Systems
Embedding Classical Communication Topologies in the Scalable OPAM Architecture
IEEE Transactions on Parallel and Distributed Systems
Implementation of 5-point/9-point multi-level methods on hypercube architectures
ICS '90 Proceedings of the 4th international conference on Supercomputing
A new approach to fast control of r2× r2 3-stage benes networks of r×r crossbar switches
ISCA '90 Proceedings of the 17th annual international symposium on Computer Architecture
Parallel preconditioners for elliptic PDEs
Supercomputing '96 Proceedings of the 1996 ACM/IEEE conference on Supercomputing
Programming a Hypercube Multicomputer
IEEE Software
On Mapping Systolic Algorithms onto the Hypercube
IEEE Transactions on Parallel and Distributed Systems
Parallel Simulated Annealing Algorithms for Cell Placement on Hypercube Multiprocessors
IEEE Transactions on Parallel and Distributed Systems
Depth-First Search Approach for Fault-Tolerant Routing in Hypercube Multicomputers
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Efficient Mapping Algorithms for a Class of Hierarchical Systems
IEEE Transactions on Parallel and Distributed Systems
A Reconfigurable Modular Fault-Tolerant Hypercube Architecture
IEEE Transactions on Parallel and Distributed Systems
Multicoloring of Grid-Structured PDE Solvers on Shared-Memory Multiprocessors
IEEE Transactions on Parallel and Distributed Systems
PeerCluster: A Cluster-Based Peer-to-Peer System
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 15.01 |
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.