Wormhole Routing on the Star Graph Interconnection Network
碩士 === 國立中山大學 === 應用數學系 === 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 requir...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
1997
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/74847907055683477565 |