...
首页> 外文期刊>Journal of supercomputing >Mesh-of-Torus: a new topology for server-centric data center networks
【24h】

Mesh-of-Torus: a new topology for server-centric data center networks

机译:圆环网:面向以服务器为中心的数据中心网络的新拓扑

获取原文
获取原文并翻译 | 示例
   

获取外文期刊封面封底 >>

       

摘要

Various topologies have been proposed for high-performance computing (HPC), i.e., fat-tree, Torus topology. Compared with conventional fat-tree topology, Torus performs much better when applied in HPC. Unfortunately, due to its wraparound links, Torus topology naturally has the tendency to trigger deadlock incidents inside the network. Researchers solve this problem by means of virtual channel, but this approach will also restrict the routing of message. In this paper, we propose a deadlock-free topology for HPC, called Mesh-of-Torus, which incarnates the good characteristics of Mesh and Torus topology. Comparing with mesh, Mesh-of-Torus has shorter network diameter. Furthermore, we have proposed a corresponding port assignment rules in consideration of complicated internal arbitration or scheduling mechanism incurred by the employment of virtual channel. Deadlock avoidance can be achieved when dimension-order routing algorithm and our port assignment rules are applied to Mesh-of-Torus. Finally, simulations and mathematical analysis have shown that Mesh-of-Torus outperforms Mesh in terms of average end-to-end latency and network load distribution.
机译:已经提出了用于高性能计算(HPC)的各种拓扑,即胖树,环形拓扑。与传统的胖树拓扑相比,Torus在HPC中应用时的性能要好得多。不幸的是,由于其环绕式链接,Torus拓扑自然倾向于触发网络内部的死锁事件。研究人员通过虚拟通道解决了这个问题,但是这种方法也会限制消息的路由。在本文中,我们为HPC提出了一种无死锁的拓扑结构,称为“网状环面”,它体现了网状结构和环面拓扑结构的良好特性。与网状网相比,网状网具有较短的网络直径。此外,考虑到使用虚拟通道会导致复杂的内部仲裁或调度机制,我们提出了相应的端口分配规则。将维数顺序路由算法和我们的端口分配规则应用于圆环网格可以避免死锁。最后,仿真和数学分析表明,在平均端到端延迟和网络负载分布方面,网状网优于网状网。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号