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

Yuri Nishikawa, Michihiro Koibuchi, Hiroki Matsutani, Hideharu Amano

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish
Title of host publicationProceedings - 2010 IEEE International Conference on Networking, Architecture and Storage, NAS 2010
Pages431-438
Number of pages8
DOIs
Publication statusPublished - 2010
Event5th IEEE International Conference on Networking, Architecture and Storage, NAS 2010 - Macau, China
Duration: 2010 Jul 152010 Jul 17

Other

Other5th IEEE International Conference on Networking, Architecture and Storage, NAS 2010
CountryChina
CityMacau
Period10/7/1510/7/17

Fingerprint

Throughput
Routers

Keywords

  • Deadlock-free routing
  • NoC
  • Non-minimal fully adaptive routing
  • SAN
  • Turn-model
  • Virtual cut-through

ASJC Scopus subject areas

  • Hardware and Architecture
  • Electrical and Electronic Engineering

Cite this

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] 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; Amano, Hideharu.

Proceedings - 2010 IEEE International Conference on Networking, Architecture and Storage, NAS 2010. 2010. p. 431-438 5575700.

Research output: Chapter in Book/Report/Conference proceedingConference 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, 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 https://doi.org/10.1109/NAS.2010.50
Nishikawa, Yuri ; Koibuchi, Michihiro ; Matsutani, Hiroki ; Amano, Hideharu. / 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
@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",
doi = "10.1109/NAS.2010.50",
language = "English",
isbn = "9780769541341",
pages = "431--438",
booktitle = "Proceedings - 2010 IEEE International Conference on Networking, Architecture and Storage, NAS 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

Y1 - 2010

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

SP - 431

EP - 438

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

ER -