A deadlock-free non-minimal fully adaptive routing using virtual cut-through switching

Yuri Nishikawa; Michihiro Koibuchi; Hiroki Matsutani; Hideharu Amano

doi:10.1109/NAS.2010.50

A deadlock-free non-minimal fully adaptive routing using virtual cut-through switching

Yuri Nishikawa, Michihiro Koibuchi, Hiroki Matsutani, Hideharu Amano

情報工学科

研究成果: Conference contribution

1 被引用数 (Scopus)

抄録

System area networks (SANs), which usually employ virtual cut-through switching, have been used to connect hosts in modern PC clusters and massively parallel computers. In this paper, we propose a non-minimal fully adaptive deadlock-free routing mechanism for virtual-cut-through networks called "Semi-deflection". Semi-deflection routing guarantees deadlock-free packet transfer without use of virtual channels by allowing non-blocking transfer between specific pairs of routers. As the result of throughput evaluation, Semideflection routing improved throughput by up to 26 percent compared with that of north-last turn model, which is a typical adaptive routing, and also reduced latency.

本文言語	English
ホスト出版物のタイトル	Proceedings - 2010 IEEE International Conference on Networking, Architecture and Storage, NAS 2010
ページ	431-438
ページ数	8
DOI	https://doi.org/10.1109/NAS.2010.50
出版ステータス	Published - 2010 10月 27
イベント	5th IEEE International Conference on Networking, Architecture and Storage, NAS 2010 - Macau, China 継続期間: 2010 7月 15 → 2010 7月 17

出版物シリーズ

名前	Proceedings - 2010 IEEE International Conference on Networking, Architecture and Storage, NAS 2010

Other

Other	5th IEEE International Conference on Networking, Architecture and Storage, NAS 2010
国/地域	China
City	Macau
Period	10/7/15 → 10/7/17

ASJC Scopus subject areas

ハードウェアとアーキテクチャ
電子工学および電気工学

文献へのアクセス

10.1109/NAS.2010.50

他のファイルとリンク

引用スタイル

Nishikawa, Y., Koibuchi, M., Matsutani, H., & Amano, H. (2010). A deadlock-free non-minimal fully adaptive routing using virtual cut-through switching. In Proceedings - 2010 IEEE International Conference on Networking, Architecture and Storage, NAS 2010 (pp. 431-438). 記事 5575700 (Proceedings - 2010 IEEE International Conference on Networking, Architecture and Storage, NAS 2010). https://doi.org/10.1109/NAS.2010.50

A deadlock-free non-minimal fully adaptive routing using virtual cut-through switching. / Nishikawa, Yuri; Koibuchi, Michihiro; Matsutani, Hiroki その他.
Proceedings - 2010 IEEE International Conference on Networking, Architecture and Storage, NAS 2010. 2010. p. 431-438 5575700 (Proceedings - 2010 IEEE International Conference on Networking, Architecture and Storage, NAS 2010).

研究成果: Conference contribution

Nishikawa, Y, Koibuchi, M, Matsutani, H & Amano, H 2010, A deadlock-free non-minimal fully adaptive routing using virtual cut-through switching. in Proceedings - 2010 IEEE International Conference on Networking, Architecture and Storage, NAS 2010., 5575700, Proceedings - 2010 IEEE International Conference on Networking, Architecture and Storage, NAS 2010, pp. 431-438, 5th IEEE International Conference on Networking, Architecture and Storage, NAS 2010, Macau, China, 10/7/15. https://doi.org/10.1109/NAS.2010.50

Nishikawa Y, Koibuchi M, Matsutani H , Amano H. A deadlock-free non-minimal fully adaptive routing using virtual cut-through switching. In Proceedings - 2010 IEEE International Conference on Networking, Architecture and Storage, NAS 2010. 2010. p. 431-438. 5575700. (Proceedings - 2010 IEEE International Conference on Networking, Architecture and Storage, NAS 2010). doi: 10.1109/NAS.2010.50

Nishikawa, Yuri ; Koibuchi, Michihiro ; Matsutani, Hiroki その他. / A deadlock-free non-minimal fully adaptive routing using virtual cut-through switching. Proceedings - 2010 IEEE International Conference on Networking, Architecture and Storage, NAS 2010. 2010. pp. 431-438 (Proceedings - 2010 IEEE International Conference on Networking, Architecture and Storage, NAS 2010).

@inproceedings{5ba7cee132a24d0e886f9e630d98ae06,

title = "A deadlock-free non-minimal fully adaptive routing using virtual cut-through switching",

abstract = "System area networks (SANs), which usually employ virtual cut-through switching, have been used to connect hosts in modern PC clusters and massively parallel computers. In this paper, we propose a non-minimal fully adaptive deadlock-free routing mechanism for virtual-cut-through networks called {"}Semi-deflection{"}. Semi-deflection routing guarantees deadlock-free packet transfer without use of virtual channels by allowing non-blocking transfer between specific pairs of routers. As the result of throughput evaluation, Semideflection routing improved throughput by up to 26 percent compared with that of north-last turn model, which is a typical adaptive routing, and also reduced latency.",

keywords = "Deadlock-free routing, NoC, Non-minimal fully adaptive routing, SAN, Turn-model, Virtual cut-through",

author = "Yuri Nishikawa and Michihiro Koibuchi and Hiroki Matsutani and Hideharu Amano",

year = "2010",

month = oct,

day = "27",

doi = "10.1109/NAS.2010.50",

language = "English",

isbn = "9780769541341",

series = "Proceedings - 2010 IEEE International Conference on Networking, Architecture and Storage, NAS 2010",

pages = "431--438",

booktitle = "Proceedings - 2010 IEEE International Conference on Networking, Architecture and Storage, NAS 2010",

note = "5th IEEE International Conference on Networking, Architecture and Storage, NAS 2010 ; Conference date: 15-07-2010 Through 17-07-2010",

}

TY - GEN

T1 - A deadlock-free non-minimal fully adaptive routing using virtual cut-through switching

AU - Nishikawa, Yuri

AU - Koibuchi, Michihiro

AU - Matsutani, Hiroki

AU - Amano, Hideharu

PY - 2010/10/27

Y1 - 2010/10/27

N2 - System area networks (SANs), which usually employ virtual cut-through switching, have been used to connect hosts in modern PC clusters and massively parallel computers. In this paper, we propose a non-minimal fully adaptive deadlock-free routing mechanism for virtual-cut-through networks called "Semi-deflection". Semi-deflection routing guarantees deadlock-free packet transfer without use of virtual channels by allowing non-blocking transfer between specific pairs of routers. As the result of throughput evaluation, Semideflection routing improved throughput by up to 26 percent compared with that of north-last turn model, which is a typical adaptive routing, and also reduced latency.

AB - System area networks (SANs), which usually employ virtual cut-through switching, have been used to connect hosts in modern PC clusters and massively parallel computers. In this paper, we propose a non-minimal fully adaptive deadlock-free routing mechanism for virtual-cut-through networks called "Semi-deflection". Semi-deflection routing guarantees deadlock-free packet transfer without use of virtual channels by allowing non-blocking transfer between specific pairs of routers. As the result of throughput evaluation, Semideflection routing improved throughput by up to 26 percent compared with that of north-last turn model, which is a typical adaptive routing, and also reduced latency.

KW - Deadlock-free routing

KW - NoC

KW - Non-minimal fully adaptive routing

KW - SAN

KW - Turn-model

KW - Virtual cut-through

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

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

U2 - 10.1109/NAS.2010.50

DO - 10.1109/NAS.2010.50

M3 - Conference contribution

AN - SCOPUS:77958113890

SN - 9780769541341

T3 - Proceedings - 2010 IEEE International Conference on Networking, Architecture and Storage, NAS 2010

SP - 431

EP - 438

BT - Proceedings - 2010 IEEE International Conference on Networking, Architecture and Storage, NAS 2010

T2 - 5th IEEE International Conference on Networking, Architecture and Storage, NAS 2010

Y2 - 15 July 2010 through 17 July 2010

ER -

A deadlock-free non-minimal fully adaptive routing using virtual cut-through switching

抄録

出版物シリーズ

Other

ASJC Scopus subject areas

文献へのアクセス

他のファイルとリンク

フィンガープリント

引用スタイル