Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
A Variation on the Hypercube with Lower Diameter
IEEE Transactions on Computers
Topological properties of the crossed cube architecture
Parallel Computing
Connectivity of the crossed cube
Information Processing Letters
Edge Congestion of Shortest Path Systems for All-to-All Communication
IEEE Transactions on Parallel and Distributed Systems
Embedding Binary Trees into Crossed Cubes
IEEE Transactions on Computers
The Crossed Cube Architecture for Parallel Computation
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Diagnosability of Crossed Cubes under the Comparison Diagnosis Model
IEEE Transactions on Parallel and Distributed Systems
Diagnosability of Crossed Cubes under the Comparison Diagnosis Model
IEEE Transactions on Parallel and Distributed Systems
Fault-tolerant cycle-emebedding of crossed cubes
Information Processing Letters
Crossed Rings—Small-diameter Multiring Switches and Their 1-1-Rearrangeability
Automation and Remote Control
Node-pancyclicity and edge-pancyclicity of crossed cubes
Information Processing Letters
Optimal Path Embedding in Crossed Cubes
IEEE Transactions on Parallel and Distributed Systems
Paths in Möbius cubes and crossed cubes
Information Processing Letters
The forwarding indices of augmented cubes
Information Processing Letters
Node-pancyclicity and edge-pancyclicity of hypercube variants
Information Processing Letters
Embedding meshes into crossed cubes
Information Sciences: an International Journal
Fault-free Hamiltonian cycles in crossed cubes with conditional link faults
Information Sciences: an International Journal
Edge-pancyclicity and path-embeddability of bijective connection graphs
Information Sciences: an International Journal
Embedding a family of disjoint 3D meshes into a crossed cube
Information Sciences: an International Journal
Geodesic pancyclicity of crossed cubes
MATH'06 Proceedings of the 10th WSEAS International Conference on APPLIED MATHEMATICS
Embedding a family of disjoint multi-dimensional meshes into a crossed cube
Information Processing Letters
Fault-tolerant embedding of paths in crossed cubes
Theoretical Computer Science
Conditional fault diameter of crossed cubes
Journal of Parallel and Distributed Computing
Constructing the nearly shortest path in crossed cubes
Information Sciences: an International Journal
Embedding fault-free cycles in crossed cubes with conditional link faults
The Journal of Supercomputing
The Journal of Supercomputing
Node-pancyclicity and edge-pancyclicity of crossed cubes
Information Processing Letters
Paths in Möbius cubes and crossed cubes
Information Processing Letters
Embedding a long fault-free cycle in a crossed cube with more faulty nodes
Information Processing Letters
A class of hierarchical graphs as topologies for interconnection networks
Theoretical Computer Science
Embedding meshes/tori in faulty crossed cubes
Information Processing Letters
A survey of comparison-based system-level diagnosis
ACM Computing Surveys (CSUR)
Research on petersen graphs and hyper-cubes connected interconnection networks
ACSAC'06 Proceedings of the 11th Asia-Pacific conference on Advances in Computer Systems Architecture
Complete path embeddings in crossed cubes
Information Sciences: an International Journal
Node-disjoint paths in a level block of generalized hierarchical completely connected networks
Theoretical Computer Science
Independent spanning trees in crossed cubes
Information Sciences: an International Journal
DVcube: A novel compound architecture of disc-ring graph and hypercube-like graph
Theoretical Computer Science
Hi-index | 0.01 |
An $n$-dimensional crossed cube, $CQ_n$, is a variation of hypercubes. In this paper, we give a new shortest path routing algorithm based on a new distance measure defined herein. In comparison with Efe's algorithm, which generates one shortest path in $O(n^2)$ time, our algorithm can generate more shortest paths in $O(n)$ time. Based on a given shortest path routing algorithm, we consider a new performance measure of interconnection networks called edge congestion. Using our shortest path routing algorithm and assuming that message exchange between all pairs of vertices is equally probable, we show that the edge congestion of crossed cubes is the same as that of hypercubes. Using the result of edge congestion, we can show that the bisection width of crossed cubes is $2^{n-1}$. We also prove that wide diameter and fault diameter are $\lceil {\frac{n}{2}} \rceil + 2$. Furthermore, we study embedding of cycles in cross cubes and construct more types than previous work of cycles of length at least four.