Infinite cube-connected cycles
β Scribed by Friedhelm Meyer auf der Heide
- Book ID
- 113162514
- Publisher
- Elsevier Science
- Year
- 1983
- Tongue
- English
- Weight
- 145 KB
- Volume
- 16
- Category
- Article
- ISSN
- 0020-0190
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
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
Cube-connected cycles, or CCC, are graphs with properties which make them possible candidates for switching patterns of multiprocessor computers.
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