| Summary: | 碩士 === 國立中山大學 === 應用數學系 === 85 ===
A deadlock-free wormhole routing algorithm can be developed by using the concept of virtual channel. In this thesis, we first propose two wormhole routing algorithms on the star graph. The first one is minimal, fully adaptive, and deadlock-free and it requires [3n+1/4] virtual channels for per physical link. For the second algorithm, we make some restrictions on the routing path selection. Thus, it reduces the number of virtual channels to [n+1/2]. It is still minimal and deadlock-free. However, it is only partially adaptive. Then we propose a fault-tolerant wormhole routing algorithm, which can tolerate one fault in the star graph. The length of the routing path is is at most d+2, where d is the distance between the source and the destination. And it does not need any extra virtual channel.
|
|---|
