Adaptive routing in k-ary n-cube multicomputers

C. S. Yang, Y. M. Tsai, Y. L. Tsai

研究成果: Paper同行評審

4 引文 斯高帕斯(Scopus)

摘要

Wormhole routing makes the communication latency insensitive of the network diameter and reduces the buffer size of each router. It has been widely adopted in many new generation Distributed memory multiprocessor systems (DMMPs). The concept of virtual system is invented for deadlock-free routing design. Using a great deal of virtual channels is quite expensive to be implemented in practice and is not limitless. In this paper, experimental results are given to evaluate the tradeoff between network congestion delay and throughput. Some results show that the congestion delay does not reduce visibly when the number of virtual channels is great than that of internal channels by 2. A reasonable number of virtual channels can be derived from the results. A virtual networks system using only four virtual networks, two virtual channels in each direction, is presented. It shows that the minimum number of virtual networks to support a partially adaptive, minimal and deadlock free routing in k-ary n-cubes is just four. It uses only four virtual networks but can get a high degree of adaptiveness and high traffic capacity. Simulation results are presented to verify the performance.

原文English
頁面404-411
頁數8
出版狀態Published - 1996
事件Proceedings of the 1996 International Conference on Parallel and Distributed Systems (ICPADS'96) - Tokyo, Jpn
持續時間: 1996 六月 31996 六月 6

Other

OtherProceedings of the 1996 International Conference on Parallel and Distributed Systems (ICPADS'96)
城市Tokyo, Jpn
期間96-06-0396-06-06

All Science Journal Classification (ASJC) codes

  • Hardware and Architecture

指紋 深入研究「Adaptive routing in k-ary n-cube multicomputers」主題。共同形成了獨特的指紋。

引用此