Paper: Hierarchical spanning trees and distributing on incomplete hypercubes

Authors:
Jenn-Yang Tien;Wei-Pang Yang
Affiliations:
Institute of Computer Science and Information Engineering, National Chiao Tung University, Hsinchu, Taiwan, 300, R.O.C.;Department of Computer and Information Science, National Chiao Tung University, Hsinchu, Taiwan, 300, R.O.C.
Venue:
Parallel Computing
Year:
1991

Citing 8
Cited 0

The cosmic cube

Communications of the ACM - Special section on computer architecture
Incomplete Hypercubes

IEEE Transactions on Computers
Topological Properties of Hypercubes

IEEE Transactions on Computers
Spanning balanced trees in Boolean cubes

SIAM Journal on Scientific and Statistical Computing
Optimum Broadcasting and Personalized Communication in Hypercubes

IEEE Transactions on Computers
Hierarchical Interconnection Networks for Multicomputer Systems

IEEE Transactions on Computers
Intensive hypercube communication. Prearranged communication in link-bound machines

Journal of Parallel and Distributed Computing
Optimal communication primitives and graph embeddings on hypercubes

Optimal communication primitives and graph embeddings on hypercubes

Quantified Score

Hi-index	0.00

Visualization

Abstract

Incomplete hypercubes are gaining increasing attention as one of the possible solutions for the limitation on the number of nodes in the hypercubes. Distributing, in which one node sends distinct messages to distinct nodes, and its reverse operation are frequently used operations on data parallel computation. In this paper, we propose two types of spanning trees in incomplete hypercubes (composed of an n-cube and a k-cube): the binomial hierarchical spanning tree-binomial HST, and the balanced hierarchical spanning tree-balanced HST, for distributing (and its reverse operation). Distributing algorithms based on a balanced HST take better advantage of overlap between communication ports, or have speedup up to k/2 or n/2 over that based on the binomial HST when concurrently communication on all ports are possible, from the view point of communication complexity. An algorithm to construct hierarchical spanning trees in general incomplete hypercubes, which consist of an arbitrary number of nodes, is also devised.