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
β¦ LIBER β¦
On the Pagenumber of the Cube-Connected Cycles
β Scribed by Yuuki Tanaka; Yukio Shibata
- Book ID
- 107508888
- Publisher
- Springer-Verlag
- Year
- 2009
- Tongue
- English
- Weight
- 280 KB
- Volume
- 3
- Category
- Article
- ISSN
- 1661-8270
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Multiscattering on the cube-connected cy
β
Jian-jin Li
π
Article
π
1994
π
Elsevier Science
π
English
β 589 KB
The diameter of the cube-connected cycle
β
Ivan FriΕ‘; Ivan Havel; Petr Liebl
π
Article
π
1997
π
Elsevier Science
π
English
β 302 KB
Cube-connected cycles, or CCC, are graphs with properties which make them possible candidates for switching patterns of multiprocessor computers.
On the Construction of Fault-Tolerant Cu
β
J. Bruck; R. Cypher; C.T. Ho
π
Article
π
1995
π
Elsevier Science
π
English
β 772 KB
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
On crossing numbers of hypercubes and cu
β
Ondrej SΓ½kora; Imrich VrΕ₯o
π
Article
π
1993
π
Springer Netherlands
π
English
β 323 KB
Efficient realization of frequently used
β
Zhiyong Liu; Qun Liu; Xiang Zhang
π
Article
π
1995
π
Springer
π
English
β 598 KB
Interconnection Networks Based on a Gene
β
Carlsson, G.E.; Cruthirds, J.E.; Sexton, H.B.; Wright, C.G.
π
Article
π
1985
π
IEEE
π
English
β 977 KB