The cube-connected cycles: a versatile network for parallel computation
Communications of the ACM
IEEE Transactions on Parallel and Distributed Systems
Sparse hypercube-like interconnection networks
SAC '93 Proceedings of the 1993 ACM/SIGAPP symposium on Applied computing: states of the art and practice
RH: A Versatile Family of Reduced Hypercube Interconnection Networks
IEEE Transactions on Parallel and Distributed Systems
Edge Congestion and Topological Properties of Crossed Cubes
IEEE Transactions on Parallel and Distributed Systems
Recursive Diagonal Torus: An Interconnection Network for Massively Parallel Computers
IEEE Transactions on Parallel and Distributed Systems
Metacube: a new interconnection network for large scale parallel systems
CRPIT '02 Proceedings of the seventh Asia-Pacific conference on Computer systems architecture
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
Algorithms and Properties of a New Two-Level Network with Folded Hypercubes as Basic Modules
IEEE Transactions on Parallel and Distributed Systems
Products of Networks with Logarithmic Diameter and Fixed Degree
IEEE Transactions on Parallel and Distributed Systems
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
Algorithms for the fixed linear crossing number problem
Discrete Applied Mathematics
Super-connectivity and super-edge-connectivity for some interconnection networks
Applied Mathematics and Computation
Fault-tolerant cycle-emebedding of crossed cubes
Information Processing Letters
Efficient Collective Communications in Dual-Cube
The Journal of Supercomputing
A fast pessimistic one-step diagnosis algorithm for hypercube multicomputer systems
Journal of Parallel and Distributed Computing
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
Many-to-Many Disjoint Path Covers in Hypercube-Like Interconnection Networks with Faulty Elements
IEEE Transactions on Parallel and Distributed Systems
Hypercube and Its Variant Networks: A Topological Evaluation
HPCASIA '05 Proceedings of the Eighth International Conference on High-Performance Computing in Asia-Pacific Region
Minimum neighborhood in a generalized cube
Information Processing Letters
Paths in Möbius cubes and crossed cubes
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
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
Efficient Fault Identification of Diagnosable Systems under the Comparison Model
IEEE Transactions on Computers
Strong Menger connectivity with conditional faults on the class of hypercube-like networks
Information Processing Letters
Embedding a family of disjoint 3D meshes into a crossed cube
Information Sciences: an International Journal
Fault-tolerant cycle embedding in dual-cube with node faults
International Journal of High Performance Computing and Networking
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
Generalized matching networks and their properties
International Journal of Parallel, Emergent and Distributed Systems
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
Fault-Tolerant Hamiltonicity of Augmented Cubes under the Conditional Fault Model
ICA3PP '09 Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing
Embedding geodesic and balanced cycles into hypercubes
WSEAS Transactions on Mathematics
Node-pancyclicity and edge-pancyclicity of crossed cubes
Information Processing Letters
Minimum neighborhood in a generalized cube
Information Processing Letters
Paths in Möbius cubes and crossed cubes
Information Processing Letters
Topological properties of twisted cube
Information Sciences: an International Journal
On embedding cycles into faulty twisted cubes
Information Sciences: an International Journal
Conditional edge-fault Hamiltonicity of augmented cubes
Information Sciences: an International Journal
Hamiltonian property on binary recursive networks
FAW'07 Proceedings of the 1st annual international conference on Frontiers in algorithmics
Hamiltonicity of matching composition networks with conditional edge faults
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
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 dynamic programming algorithm for simulation of a multi-dimensional torus in a crossed cube
Information Sciences: an International Journal
Pancyclicity of Restricted Hypercube-Like Networks under the Conditional Fault Model
SIAM Journal on Discrete Mathematics
Hamiltonian properties of twisted hypercube-like networks with more faulty elements
Theoretical Computer Science
Note: Embedding two edge-disjoint Hamiltonian cycles into locally twisted cubes
Theoretical Computer Science
Fault diagnosis for hypercube-like networks
AICT'11 Proceedings of the 2nd international conference on Applied informatics and computing theory
A fast fault-identification algorithm for bijective connection graphs using the PMC model
Information Sciences: an International Journal
Complete path embeddings in crossed cubes
Information Sciences: an International Journal
Mstar: a new two level interconnection network
ICDCIT'12 Proceedings of the 8th international conference on Distributed Computing and Internet Technology
Embedding a mesh of trees in the crossed cube
Information Processing Letters
Hamiltonicity and Pancyclicity of binary recursive networks
ISPA'07 Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications
Hamiltonian connectivity of restricted hypercube-like networks under the conditional fault model
Theoretical Computer Science
Conditional diagnosability of matching composition networks under the MM* model
Information Sciences: an International Journal
Independent spanning trees in crossed cubes
Information Sciences: an International Journal
Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes
Journal of Parallel and Distributed Computing
DVcube: A novel compound architecture of disc-ring graph and hypercube-like graph
Theoretical Computer Science
Edge-fault tolerance of hypercube-like networks
Information Processing Letters
Hi-index | 0.02 |
The construction of a crossed cube which has many of the properties of the hypercube, but has diameter only about half as large, is discussed. This network is self-routing, in the sense that there is a simple distributed routing algorithm which guarantees optimal paths between any pair of vertices. This fact, together with other properties such as regularity, symmetry, high connectivity, and a simple recursive structure, suggests that the crossed cube may be an attractive alternative to the ordinary hypercube for massively parallel architectures, SIMD algorithms, which utilize the architecture are developed, and it is shown that the CQ/sub n/ architecture can profitably emulate the ordinary hypercube. It is also shown that addition of simple switches can improve the capabilities of the system significantly. For instance, the dynamic reconfiguration capability allows hypercube algorithms to be executed on the proposed architecture. The use of these switches also improves the embedding properties of the system.