首页> 外文会议>IEEE International Conference on Signal Processing and Communications >HYPERCUBE VERSUS TORUS UNDER PIN-OUT CONSTRAINT AND FINITE BUFFERS
【24h】

HYPERCUBE VERSUS TORUS UNDER PIN-OUT CONSTRAINT AND FINITE BUFFERS

机译:HyperCube与in in in-out约束和有限缓冲区下的torus

获取原文
获取外文期刊封面目录资料

摘要

Previous studies have shown that when the network is subject to the pin-out constraint, the network topology exhibiting the best performance depends on the network size. These studies have assumed single flit buffers. Deploying finite size buffers, however, may add extra complexity to the router design and hence will influence the cost and the performance of the network. This paper reinvestigates analytically the relative performance merits of different k-ary n-cube topologies combining wormhole switching, adaptive routing, multiple virtual channels and finite size buffers. The results reveal new insights demonstrating the sensitivity of these studies to the level of detail and realism incorporated in the analysis.
机译:以前的研究表明,当网络受到引脚约束时,呈现最佳性能的网络拓扑取决于网络尺寸。这些研究假定了单次絮凝缓冲液。但是,部署有限尺寸缓冲区可以为路由器设计增加额外的复杂性,因此将影响网络的成本和性能。本文在分析中加​​入了不同k-ary n立方体拓扑的相对性能优点,将虫洞切换,自适应路由,多个虚拟通道和有限尺寸缓冲区组合。结果揭示了新见解,证明这些研究对分析中的细节和现实主义水平的敏感性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号