Data communication in hypercubes
Yousef Saad, Martin H. Schultz · Journal of Parallel and Distributed Computing · 1989
In this paper we consider several algorithms for exchanging data among processors in a hypercube network. The data transfer problems considered are those arising from classical numerical algorithms such as Gaussian elimination, conjugate gradient methods, and the N-body problem. We propose some estimates for the timings of the various algorithms which reveal that multiprocessors based on the hypercube topology can be very efficient in performing data exchange operations.
Cited by 148 works. doi:10.1016/0743-7315(89)90045-2
Authors
References
- The cosmic cube
- Topological properties of hypercubes
- Generalized Hypercube and Hyperbus Structures for a Computer Network
- Solution of Partial Differential Equations on Vector and Parallel Computers
- Communication efficient basic linear algebra computations on hypercube architectures
- Performance of the direct binary n-cube network for multiprocessors
- Complexity of dense-linear-system solution on a multiprocessor ring
- Multiple array processors for ocean acoustic problems