A regular interconnection network
β Scribed by C.S. Yang; W.S. Hsieh; D.C. Lou; J.S. Tzeng
- Publisher
- Elsevier Science
- Year
- 1991
- Weight
- 457 KB
- Volume
- 32
- Category
- Article
- ISSN
- 0165-6074
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
In this paper, we consider a highly recursive interconnection network known as the fully connected cubic network (FCCN). By exploiting its recursive properties, we thoroughly analyze the performance of a simple routing algorithm for the FCCN. We show that at least 800 of the routes obtained from thi
We present a novel interconnection topology, the Josephus Cube, which supports a simple routing strategy that is minimal, deadlock-and livelock-free. The topology can optimally embed linear arrays (LAs), rings, and complete binary trees of arbitrary size, as well as 2 p Γ q meshes. It is also a supe