Optimal cube-connected cube multicomputers
β Scribed by Jie Wu; Xian-He Sun
- Publisher
- Elsevier Science
- Year
- 1994
- Weight
- 390 KB
- Volume
- 17
- Category
- Article
- ISSN
- 0745-7138
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
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.
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