|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
2010 Fifth International Conference on Networking, Architecture, and Storage
A Deadlock-Free Non-minimal Fully Adaptive Routing Using Virtual Cut-Through Switching
Macau, China
July 15-July 17
ISBN: 978-0-7695-4134-1
| ASCII Text | x | ||
| Yuri Nishikawa, Michihiro Koibuchi, Hiroki Matsutani, Hideharu Amano, "A Deadlock-Free Non-minimal Fully Adaptive Routing Using Virtual Cut-Through Switching," Networking, Architecture, and Storage, International Conference on, pp. 431-438, 2010 Fifth International Conference on Networking, Architecture, and Storage, 2010. | |||
| BibTex | x | ||
| @article{ 10.1109/NAS.2010.50, author = {Yuri Nishikawa and Michihiro Koibuchi and Hiroki Matsutani and Hideharu Amano}, title = {A Deadlock-Free Non-minimal Fully Adaptive Routing Using Virtual Cut-Through Switching}, journal ={Networking, Architecture, and Storage, International Conference on}, volume = {0}, year = {2010}, isbn = {978-0-7695-4134-1}, pages = {431-438}, doi = {http://doi.ieeecomputersociety.org/10.1109/NAS.2010.50}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - Networking, Architecture, and Storage, International Conference on TI - A Deadlock-Free Non-minimal Fully Adaptive Routing Using Virtual Cut-Through Switching SN - 978-0-7695-4134-1 SP431 EP438 A1 - Yuri Nishikawa, A1 - Michihiro Koibuchi, A1 - Hiroki Matsutani, A1 - Hideharu Amano, PY - 2010 KW - SAN KW - virtual cut-through KW - NoC KW - deadlock-free routing KW - non-minimal fully adaptive routing KW - turn-model VL - 0 JA - Networking, Architecture, and Storage, International Conference on ER - | |||
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/NAS.2010.50
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.
Index Terms:
SAN, virtual cut-through, NoC, deadlock-free routing, non-minimal fully adaptive routing, turn-model
Citation:
Yuri Nishikawa, Michihiro Koibuchi, Hiroki Matsutani, Hideharu Amano, "A Deadlock-Free Non-minimal Fully Adaptive Routing Using Virtual Cut-Through Switching," nas, pp.431-438, 2010 Fifth International Conference on Networking, Architecture, and Storage, 2010
Usage of this product signifies your acceptance of the Terms of Use.