This paper presents several multiscattering algorithms on the Cube-Connected Cycles (CCC). We first implement a network-independent greedy algorithm. Then we propose two specialized algorithms for multiscattering on the CCC: the first approach uses only one hypercube link of each cycle, but the seco
The diameter of the cube-connected cycles
✍ Scribed by Ivan Friš; Ivan Havel; Petr Liebl
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 302 KB
- Volume
- 61
- Category
- Article
- ISSN
- 0020-0190
No coin nor oath required. For personal study only.
✦ Synopsis
Cube-connected cycles, or CCC, are graphs with properties which make them possible candidates for switching patterns of multiprocessor computers.
📜 SIMILAR VOLUMES
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
The recently introduced interconnection network, the Möbius cube, is an important variant of the hypercube. This network has several attractive properties compared with the hypercube. In this paper, we show that the n-dimensional Möbius cube M n is Hamilton-connected when n 3. Then, by using the Ham
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.