The cube-connected cycles: a versatile network for parallel computation
Communications of the ACM
Sparse hypercube-like interconnection networks
SAC '93 Proceedings of the 1993 ACM/SIGAPP symposium on Applied computing: states of the art and practice
Comments on "Hierarchical Cubic Networks"
IEEE Transactions on Parallel and Distributed Systems
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
IEEE Transactions on Computers
Embedding Binary Trees into Crossed Cubes
IEEE Transactions on Computers
Automatic Reconfiguration and Yield of the TESH Multicomputer Network
IEEE Transactions on Computers
IEEE Transactions on Parallel and Distributed Systems
Diagnosability of Crossed Cubes under the Comparison Diagnosis Model
IEEE Transactions on Parallel and Distributed Systems
Hyper-Star Graph: A New Interconnection Network Improving the Network Cost of the Hypercube
EurAsia-ICT '02 Proceedings of the First EurAsian Conference on Information and Communication Technology
Sparse hypercube: a minimal k-line broadcast graph
Discrete Applied Mathematics
Crossed Rings—Small-diameter Multiring Switches and Their 1-1-Rearrangeability
Automation and Remote Control
Hamiltonian properties on the class of hypercube-like networks
Information Processing Letters - Devoted to the rapid publication of short contributions to information processing
Conditional Diagnosability Measures for Large Multiprocessor Systems
IEEE Transactions on Computers
The t/k-Diagnosability of the BC Graphs
IEEE Transactions on Computers
Diagnosabilities of Regular Networks
IEEE Transactions on Parallel and Distributed Systems
Fault-Hamiltonicity of Hypercube-Like Interconnection Networks
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Node-pancyclicity and edge-pancyclicity of crossed cubes
Information Processing Letters
Optimal Path Embedding in Crossed Cubes
IEEE Transactions on Parallel and Distributed Systems
(t,k)-Diagnosis for Matching Composition Networks
IEEE Transactions on Computers
Many-to-Many Disjoint Path Covers in Hypercube-Like Interconnection Networks with Faulty Elements
IEEE Transactions on Parallel and Distributed Systems
Paths in Möbius cubes and crossed cubes
Information Processing Letters
Fault-diameter of Cartesian graph bundles
Information Processing Letters
(t, k) - Diagnosis for Matching Composition Networks under the MM* Model
IEEE Transactions on Computers
Node-pancyclicity and edge-pancyclicity of hypercube variants
Information Processing Letters
Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
Theoretical Computer Science
Embedding meshes into crossed cubes
Information Sciences: an International Journal
Optimal Embeddings of Paths with Various Lengths in Twisted Cubes
IEEE Transactions on Parallel and Distributed Systems
Fault-tolerant analysis of a class of networks
Information Processing Letters
On the spanning connectivity and spanning laceability of hypercube-like networks
Theoretical Computer Science
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
The two-equal-disjoint path cover problem of Matching Composition Network
Information Processing Letters
Geodesic pancyclicity of crossed cubes
MATH'06 Proceedings of the 10th WSEAS International Conference on APPLIED MATHEMATICS
A note about some properties of BC graphs
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
The edge fault-diameter of Cartesian graph bundles
European Journal of Combinatorics
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
The new torus network design based On 3-dimensional hypercube
ICACT'09 Proceedings of the 11th international conference on Advanced Communication Technology - Volume 1
Node-pancyclicity and edge-pancyclicity of crossed cubes
Information Processing Letters
Paths in Möbius cubes and crossed cubes
Information Processing Letters
Conditional diagnosability of matching composition networks under the PMC model
IEEE Transactions on Circuits and Systems II: Express Briefs
Edge fault-diameter of Cartesian product of graphs
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Hamiltonian property on binary recursive networks
FAW'07 Proceedings of the 1st annual international conference on Frontiers in algorithmics
A class of hierarchical graphs as topologies for interconnection networks
Theoretical Computer Science
Information Sciences: an International Journal
One-to-one communication in twisted cubes under restricted connectivity
Frontiers of Computer Science in China
Efficient unicast in bijective connection networks with the restricted faulty node set
Information Sciences: an International Journal
Fault-tolerant edge-pancyclicity of locally twisted cubes
Information Sciences: an International Journal
The spined cube: A new hypercube variant with smaller diameter
Information Processing Letters
Edge fault-diameter of graph product
ICCOMP'10 Proceedings of the 14th WSEAS international conference on Computers: part of the 14th WSEAS CSCC multiconference - Volume II
Fault diameters of graph products and bundles
ICCOMP'10 Proceedings of the 14th WSEAS international conference on Computers: part of the 14th WSEAS CSCC multiconference - Volume II
Theoretical Computer Science
Wirelength of 1-fault hamiltonian graphs into wheels and fans
Information Processing Letters
Independent spanning trees on twisted cubes
Journal of Parallel and Distributed Computing
X-torus: a variation of torus topology with lower diameter and larger bisection width
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part V
Complete path embeddings in crossed cubes
Information Sciences: an International Journal
A case for random shortcut topologies for HPC interconnects
Proceedings of the 39th Annual International Symposium on Computer Architecture
Hamiltonicity and Pancyclicity of binary recursive networks
ISPA'07 Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications
{2,3}-Extraconnectivities of hypercube-like networks
Journal of Computer and System Sciences
Independent spanning trees in crossed cubes
Information Sciences: an International Journal
Mixed fault diameter of Cartesian graph bundles
Discrete Applied Mathematics
Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes
Journal of Parallel and Distributed Computing
Three-dimensional Petersen-torus network: a fixed-degree network for massively parallel computers
The Journal of Supercomputing
DVcube: A novel compound architecture of disc-ring graph and hypercube-like graph
Theoretical Computer Science
Hamiltonian cycles in hypercubes with faulty edges
Information Sciences: an International Journal
Wide-diameter of Product Graphs
Fundamenta Informaticae
| Hi-index | 15.01 |
A new interconnection structure is proposed as a basis for distributed-memory parallel computer architectures. The network is a variation of the hypercube and preserves many of its desirable properties, including regularity and large vertex connectivity. It has the same node and link complexity, but has a diameter only about half of the hypercube's. Some of the basic properties of this topology are discussed. Efficient routing and broadcasting algorithms are presented.