登入
選單
返回
Google圖書搜尋
Planar-adaptive Routing
Andrew A. Chien
Jae H. Kim
University of Illinois at Urbana-Champaign. Department of Computer Science
其他書名
Low-cost Adaptive Networks for Multiprocessors
出版
Department of Computer Science, University of Illinois at Urbana-Champaign
, 1991
URL
http://books.google.com.hk/books?id=tDf7hG6eQBcC&hl=&source=gbs_api
註釋
Abstract: "Network throughput can be increased by allowing multipath, adaptive routing. Adaptive routing allows more freedom in the paths taken by messages, spreading load over physical channels more evenly. The flexibility of adaptive routing introduces new possibilities of deadlock. Previous deadlock avoidance schemes in k-ary n-cubes require an exponential number of virtual channels [1]. We describe a family of deadlock-free routing algorithms, called planar-adaptive routing algorithms which require only a constant number of virtual channels, independent of network size and dimension.