A Deadlock-Free Non-minimal Fully Adaptive Routing Using Virtual Cut-Through Switching
A Deadlock-Free Non-minimal Fully Adaptive Routing Using Virtual Cut-Through Switching
复制标题
DOI：
10.1109/nas.2010.50
复制
发表时间：
2010-07
期刊：
影响因子：
--
通讯作者：
Yuri Nishikawa;M. Koibuchi;Hiroki Matsutani;H. Amano
中科院分区：
文献类型：
--
作者：
Yuri Nishikawa;M. Koibuchi;Hiroki Matsutani;H. Amano
系统区域网络（SAN）通常采用虚拟直通交换，已被用于连接现代PC集群和大规模并行计算机中的主机。在本文中，我们提出了一个非最小的完全自适应无死锁路由机制的虚拟直通网络称为“半偏转”。半偏转路由通过允许特定路由器对之间的非阻塞传输来保证无死锁的数据包传输，而不使用虚拟通道。吞吐量评估结果表明，与典型的自适应路由模型north-last turn相比，半反射路由的吞吐量提高了26%，同时也降低了延迟。
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.