Cube-connected-cubes network
✍ Scribed by Jie Wu; MariáM. Larrondo-Petrie
- Publisher
- Elsevier Science
- Year
- 1992
- Weight
- 817 KB
- Volume
- 33
- Category
- Article
- ISSN
- 0165-6074
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
We consider the simulation of large cube-connected cycles (CCC ) and large butterfly networks ( BFN) on smaller ones, a problem that arises when algorithms designed for an architecture of an ideal size are to be executed on an existing architecture of a fixed size. We show that large CCCs and BFNs c
In 2000, Li et al. introduced dual-cube networks, denoted by DC n for n P 1, using the hypercube family Q n and showed the vertex symmetry and some fault-tolerant hamiltonian properties of DC n . In this article, we introduce a new family of interconnection networks called dual-cube extensive networ
It was speculated that the connectivity of the n-dimensional crossed cube is n. In this paper we prove that the result is true. @ 1997 Elsevier Science B.V.
This paper presents a new approach to tolerating edge faults and node faults in (CCC) networks of Cube-Connected Cycles in a worst-case scenario. Our constructions of fault-tolerant CCC networks are obtained by adding extra edges to the CCC. The main objective is to reduce the cost of the fault-tole