Fault-tolerant de Bruijn and shuffle-exchange networks
โ Scribed by J. Bruck; R. Cypher; Ching-tien Ho
- Book ID
- 126639586
- Publisher
- IEEE
- Year
- 1994
- Tongue
- English
- Weight
- 672 KB
- Volume
- 5
- Category
- Article
- ISSN
- 1045-9219
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
We show that the de Bruijn digraph B(d,D), D > 1 and the Kautz digraph K(d,D) can be embedded in (d + 1) pages with cumulative pagewidth ~dDe2(3d3 -2d2 + 4d -d(d mod 2) ~ 4) and idD-'(3d' + 4d + (d mod2)), respectively. Also we show that the shuffle-exchange graph S(D; D > 2 can be embedded in 3 pag
In this paper, we study the routing problem for the undirected binary de Bruijn interconnection network. Researchers have never proposed a shortest path routing algorithm on the undirected binary de Bruijn network. We first propose a shortest path routing algorithm, whose time complexity in the bina