Incomplete crossed hypercubes

Authors:
Yan-Qing Zhang;Yi Pan
Affiliations:
Department of Computer Science, Georgia State University, Atlanta, USA 30302-3994;Department of Computer Science, Georgia State University, Atlanta, USA 30302-3994
Venue:
The Journal of Supercomputing
Year:
2009

Citing 24
Cited 0

Incomplete Hypercubes

IEEE Transactions on Computers
Enhanced Hypercubes

IEEE Transactions on Computers
The Twisted N-Cube with Application to Multiprocessing

IEEE Transactions on Computers
The twisted cube topology for multiprocessors: a study in network asymmetry

Journal of Parallel and Distributed Computing
A Variation on the Hypercube with Lower Diameter

IEEE Transactions on Computers
An effective approach to the enhancement of incomplete hypercube computers

Journal of Parallel and Distributed Computing
Structural and Tree Embedding Aspects of Incomplete Hypercubes

IEEE Transactions on Computers
An effective routing algorithm in incomplete hypercubes

Parallel Computing
Parallel routing algorithms for incomplete hypercube interconnection networks

Parallel Computing
Topological properties of the crossed cube architecture

Parallel Computing
Traffic Analysis and Simulation Performance of Incomplete Hypercubes

IEEE Transactions on Parallel and Distributed Systems
Optimal broadcasting in hypercubes with link faults using limited global information

Journal of Systems Architecture: the EUROMICRO Journal
The Balanced Hypercube: A Cube-Based System for Fault-Tolerant Applications

IEEE Transactions on Computers
Adaptive Fault-Tolerant Routing in Cube-Based Multicomputers Using Safety Vectors

IEEE Transactions on Parallel and Distributed Systems
Embedding of binomial trees in hypercubes with link faults

Journal of Parallel and Distributed Computing
Edge Congestion and Topological Properties of Crossed Cubes

IEEE Transactions on Parallel and Distributed Systems
Broadcasting on Incomplete Hypercubes

IEEE Transactions on Computers
Embedding Binary Trees into Crossed Cubes

IEEE Transactions on Computers
Properties and Performance of Folded Hypercubes

IEEE Transactions on Parallel and Distributed Systems
The Crossed Cube Architecture for Parallel Computation

IEEE Transactions on Parallel and Distributed Systems
Optimal Simulation of Linear Multiprocessor Architectures on Multiply-Twisted Cube Using Generalized Gray Codes

IEEE Transactions on Parallel and Distributed Systems
The Mcube: a symmetrical cube based network with twisted links

IPPS '95 Proceedings of the 9th International Symposium on Parallel Processing
The Exchanged Hypercube

IEEE Transactions on Parallel and Distributed Systems
Optimal fault-tolerant embedding of paths in twisted cubes

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, a new interconnection network called the incomplete crossed hypercube is proposed for connecting processors of parallel computing systems. The incomplete crossed hypercube architecture denoted by CI n驴m n is made by combining two complete crossed hypercubes CQ n and CQ n驴m for 1驴m驴n. Several topological properties of CI n驴m n are analyzed. In particular, accurate mean internode distance formulas of both CQ n and CI n驴m n are given. Compared with the incomplete enhanced hypercube EI n驴m n , CI n驴m n has shorter mean internode distance for large n. An optimal routing algorithm for CI n驴m n is also described which guarantees the generation of a shortest path from a node to another in CI n驴m n .