The connection machine
A Group-Theoretic Model for Symmetric Interconnection Networks
IEEE Transactions on Computers
Issues in the architecture of direct interconnection schemes for multiprocessors
Issues in the architecture of direct interconnection schemes for multiprocessors
The Twisted N-Cube with Application to Multiprocessing
IEEE Transactions on Computers
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
Proceedings of the Parallel Architectures and Languages Europe, Volume I: Parallel Architectures PARLE
The Connection Machine
The ''Mobius Cube'': An Interconnection Network for Parallel Computation
The ''Mobius Cube'': An Interconnection Network for Parallel Computation
Diagnosability of the Möbius Cubes
IEEE Transactions on Parallel and Distributed Systems
Hamilton-connectivity and cycle-embedding of the Möbius cubes
Information Processing Letters
Super-connectivity and super-edge-connectivity for some interconnection networks
Applied Mathematics and Computation
A fast pessimistic one-step diagnosis algorithm for hypercube multicomputer systems
Journal of Parallel and Distributed Computing
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
(t,k)-Diagnosis for Matching Composition Networks
IEEE Transactions on Computers
Edge-pancyclicity of Möbius cubes
Information Processing Letters
Minimum neighborhood in a generalized cube
Information Processing Letters
Paths in Möbius cubes and crossed cubes
Information Processing Letters
Hamiltonian Path Embedding and Pancyclicity on the Möbius Cube with Faulty Nodes and Faulty Edges
IEEE Transactions on Computers
(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
A fast diagnosis algorithm for locally twisted cube multiprocessor systems under the MM* model
Computers & Mathematics with Applications
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
Edge-pancyclicity and path-embeddability of bijective connection graphs
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
The two-equal-disjoint path cover problem of Matching Composition Network
Information Processing Letters
Embedding of meshes in Möbius cubes
Theoretical Computer Science
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
A note about some properties of BC graphs
Information Processing Letters
Embedding a family of 2D meshes into Möbius cubes
WSEAS Transactions on Mathematics
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
Edge-pancyclicity of Möbius cubes
Information Processing Letters
Minimum neighborhood in a generalized cube
Information Processing Letters
Paths in Möbius cubes and crossed cubes
Information Processing Letters
On embedding cycles into faulty twisted cubes
Information Sciences: an International Journal
Conditional diagnosability of matching composition networks under the PMC model
IEEE Transactions on Circuits and Systems II: Express Briefs
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
A class of hierarchical graphs as topologies for interconnection networks
Theoretical Computer Science
Information Sciences: an International Journal
A family of Hamiltonian and Hamiltonian connected graphs with fault tolerance
The Journal of Supercomputing
One-to-one communication in twisted cubes under restricted connectivity
Frontiers of Computer Science in China
A survey of comparison-based system-level diagnosis
ACM Computing Surveys (CSUR)
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
Hamiltonian properties of twisted hypercube-like networks with more faulty elements
Theoretical Computer Science
The spined cube: A new hypercube variant with smaller diameter
Information Processing Letters
Theoretical Computer Science
A kind of conditional vertex connectivity of Cayley graphs generated by 2-trees
Information Sciences: an International Journal
Note: Embedding two edge-disjoint Hamiltonian cycles into locally twisted cubes
Theoretical Computer Science
Wirelength of 1-fault hamiltonian graphs into wheels and fans
Information Processing Letters
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
Möbius-deBruijn: The product of Möbius cube and deBruijn digraph
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
{2,3}-Extraconnectivities of hypercube-like networks
Journal of Computer and System Sciences
Conditional diagnosability of matching composition networks under the MM* model
Information Sciences: an International Journal
KMcube: the compound of Kautz digraph and Möbius cube
Frontiers of Computer Science: Selected Publications from Chinese Universities
Parallel construction of independent spanning trees and an application in diagnosis on Möbius cubes
The Journal of Supercomputing
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 | 15.04 |
The Möbius cubes are hypercube variants that give better performance with the same number of links and processors. We show that the diameter of the Möbius cubes is about one half the diameter of the equivalent hypercube, and that the average number of steps between processors for a Möbius cube is about two-thirds of the average for a hypercube. We give an efficient routing algorithm for the Möbius cubes. This routing algorithm finds a shortest path and operates in time proportional to the dimension of the cube. We also give efficient broadcast algorithms for the Möbius cubes. We show that the Möbius cubes contain ring networks and other networks. We report results of simulation studies on the dynamic message-passing performance of the hypercube, the Twisted Cube of Hilbers et al. [11], and the Möbius cubes. Our results are in agreement with Abraham [2], showing that the Twisted Cube has worse dynamic performance than the hypercube, but our results show that the 1-Möbius cube has dynamic performance superior to that of the hypercube. This contradicts current literature, which implies that twisted cube variants will have worse dynamic performance.