
794 CHAPTER 10 Interconnection Network Design
Channel dependence graph
Unidirectional version of 4-ary 2-array
with channels numbered
õõ
1
01
2
U2
3
03
^
2
1Ú'º£
0
º£
ÉÁ
éõ
—^
11 12 13
i7
S>K 3£ S
¿õ
-
-*-
21 22 23
'
6
k
,9
5T ¸ Ü£
JU
^
J1
-*Η
32 33
FIGURE 10.20 Channel ordering in the network graph and corresponding channel depen-
dence graph. To show that the routing algorithm is deadlock-free, it is sufficient to demonstrate that
the channel dependence graph has no cycles.
packet-switched networks deadlock-free; there is a concept of a structured buffer
pool
(in which certain buffers have specific functions) and the routing algorithm restrict ...