Adaptive routing in k-ary n-cube multicomputers

Chu-Sing 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 一月 1
事件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

指紋

Distributed power generation
Routers
Throughput
Data storage equipment
Communication

All Science Journal Classification (ASJC) codes

  • Hardware and Architecture

引用此文

Yang, C-S., Tsai, Y. M., & Tsai, Y. L. (1996). Adaptive routing in k-ary n-cube multicomputers. 404-411. 論文發表於 Proceedings of the 1996 International Conference on Parallel and Distributed Systems (ICPADS'96), Tokyo, Jpn, .
Yang, Chu-Sing ; Tsai, Y. M. ; Tsai, Y. L. / Adaptive routing in k-ary n-cube multicomputers. 論文發表於 Proceedings of the 1996 International Conference on Parallel and Distributed Systems (ICPADS'96), Tokyo, Jpn, .8 p.
@conference{7ca52d6263e745d895c8c53d32774356,
title = "Adaptive routing in k-ary n-cube multicomputers",
abstract = "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.",
author = "Chu-Sing Yang and Tsai, {Y. M.} and Tsai, {Y. L.}",
year = "1996",
month = "1",
day = "1",
language = "English",
pages = "404--411",
note = "Proceedings of the 1996 International Conference on Parallel and Distributed Systems (ICPADS'96) ; Conference date: 03-06-1996 Through 06-06-1996",

}

Yang, C-S, Tsai, YM & Tsai, YL 1996, 'Adaptive routing in k-ary n-cube multicomputers', 論文發表於 Proceedings of the 1996 International Conference on Parallel and Distributed Systems (ICPADS'96), Tokyo, Jpn, 96-06-03 - 96-06-06 頁 404-411.

Adaptive routing in k-ary n-cube multicomputers. / Yang, Chu-Sing; Tsai, Y. M.; Tsai, Y. L.

1996. 404-411 論文發表於 Proceedings of the 1996 International Conference on Parallel and Distributed Systems (ICPADS'96), Tokyo, Jpn, .

研究成果: Paper

TY - CONF

T1 - Adaptive routing in k-ary n-cube multicomputers

AU - Yang, Chu-Sing

AU - Tsai, Y. M.

AU - Tsai, Y. L.

PY - 1996/1/1

Y1 - 1996/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0029698386&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0029698386&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:0029698386

SP - 404

EP - 411

ER -

Yang C-S, Tsai YM, Tsai YL. Adaptive routing in k-ary n-cube multicomputers. 1996. 論文發表於 Proceedings of the 1996 International Conference on Parallel and Distributed Systems (ICPADS'96), Tokyo, Jpn, .