Communications of the ACM - Special section on computer architecture
The connection machine
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 and Topological Properties of Crossed Cubes
IEEE Transactions on Parallel and Distributed Systems
Diagnosability of Crossed Cubes under the Comparison Diagnosis Model
IEEE Transactions on Parallel and Distributed Systems
Folded-crossed hypercube: a complete interconnection network
Journal of Systems Architecture: the EUROMICRO Journal
Embedding Binary Trees into Crossed Cubes
IEEE Transactions on Computers
The Crossed Cube Architecture for Parallel Computation
IEEE Transactions on Parallel and Distributed Systems
On the Fault-Tolerant Pancyclicity of Crossed Cubes
ICPADS '02 Proceedings of the 9th International Conference on Parallel and Distributed Systems
Fault-tolerant cycle-emebedding of crossed cubes
Information Processing Letters
Optimal Path Embedding in Crossed Cubes
IEEE Transactions on Parallel and Distributed Systems
Characterization of Connection Assignment of Diagnosable Systems
IEEE Transactions on Computers
Embedding a family of disjoint multi-dimensional meshes into a crossed cube
Information Processing Letters
Hi-index | 0.00 |
We present an algorithm that constructs subnetworks from an n-dimensional crossed cube, denoted CQn, so that for any given κ, 2 ≤ κ ≤ n − 1, the algorithm can generate a κ-connected subnetwork that contains all 2n original nodes of CQn and preserves the symmetrical structure. The κ-connected subnetworks constructed are all optimal in the sense that they use the minimum number of links to maintain the required connectivity. Being able to construct κ-connected, all-node subnetworks are important in many applications, such as computing in the presence of faulty links, or diagnosing the system with a lower fault bound. Links that are not used by the induced subnetworks could be used in parallel by some other computing tasks, improving the overall resource utilization of the system. © 2011 Wiley Periodicals, Inc. NETWORKS, 2012 © 2012 Wiley Periodicals, Inc.