Uni-directional hypercubes

Authors:
Chih-Hsiang Chou;David H. C. Du
Affiliations:
Department of Computer Science, University of Minnesota, Minneapolis, Minnesota;Department of Computer Science, University of Minnesota, Minneapolis, Minnesota
Venue:
Proceedings of the 1990 ACM/IEEE conference on Supercomputing
Year:
1990

Citing 2
Cited 6

The cosmic cube

Communications of the ACM - Special section on computer architecture
The cube-connected cycles: a versatile network for parallel computation

Communications of the ACM

Bidirectional versus Unidirectional Networks: Cost/Performance Trade-Offs

MASCOTS '95 Proceedings of the 3rd International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems
Hamiltonicity, vertex symmetry, and broadcasting of uni-directional hypercubes

PAS '95 Proceedings of the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis
A Comparative Study of Star Graphs and Rotator Graphs

ICPP '94 Proceedings of the 1994 International Conference on Parallel Processing - Volume 01
Orienting Cayley graphs generated by transposition trees

Computers & Mathematics with Applications
Strong structural properties of unidirectional star graphs

Discrete Applied Mathematics
Routing and wavelength assignment for hypercube in array-based WDM optical networks

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Uni-directional hypercubes are hypercube interconnection topologies with simplex uni-directional links. While accommodating large number of nodes, uni-directional hypercubes require less complicated communication hardware than conventional bi-directional hypercubes. In addition, they alleviate the pin-limitation problem encountered in fabricating VLSI hypercubes and allow hypercube implementation of the Metropolitan Area Networks using optical fiber links. We propose in this paper two novel schemes of the uni-directional hypercubes. Our research results show that both proposed schemes, while using uni-directional links only, preserve most of the nice characteristics of conventional hypercubes such as short diameter, short average distance and efficient routing. In particular, the diameter of the second scheme with degree n is n+1 (n+2) only when n ≠ 3 (n = 3).