• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Transactions on Parallel and Distributed Systems >Multiple multicast with minimized node contention on wormhole k-ary n-cube networks
【24h】

Multiple multicast with minimized node contention on wormhole k-ary n-cube networks

机译：虫洞k元n立方网络上具有最小节点争用的多播

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

This paper presents a new approach to minimize node contention while performing multiple multicast/broadcast on wormhole k-ary n-cube networks with overlapped destination sets. The existing multicast algorithms in the literature deliver poor performance under multiple multicast because these algorithms have been designed with only single multicast in mind. The new algorithms introduced in this paper do not use any global knowledge about the respective destination sets of the concurrent multicasts. Instead, only local information and a source-specific partitioning approach are used. For systems supporting unicast message-passing, a new SPUmesh (Source-Partitioned Umesh) algorithm is proposed and is shown to be superior than the conventional Umesh algorithm for multiple multicast. Two different algorithms, SQHL (Source-Quadrant Hierarchical Leader) and SCHL (Source-Centered Hierarchical Leader), are proposed for systems with multidestination message-passing and shown to be superior than the HL scheme. All of these algorithms perform 1) 5-10 times faster than the existing algorithms under multiple multicast and 2) as fast as existing algorithms under single multicast. Furthermore, the SCHL scheme demonstrates that the latency of multiple multicast can, in fact, be reduced as the degree of multicast increases beyond a certain number. Thus, these algorithms demonstrate significant potential to be used for designing fast and scalable collective communication libraries on current and future generation wormhole systems.
机译：本文提出了一种在具有重叠目标集的蠕虫k元n立方网络上执行多个多播/广播时，最小化节点争用的新方法。文献中现有的组播算法在多重组播下的性能较差，因为这些算法在设计时仅考虑了单个组播。本文介绍的新算法不使用有关并发多播各自目标集的任何全局知识。而是仅使用本地信息和特定于源的分区方法。对于支持单播消息传递的系统，提出了一种新的SPUmesh（源分区的Umesh）算法，该算法显示出优于传统的Umesh算法进行多播。对于具有多目标消息传递的系统，提出了两种不同的算法SQHL（源象限分层领导者）和SCHL（以源为中心分层领导者），并且显示出比HL方案更好的算法。所有这些算法的执行速度为：1）比多播下的现有算法快5-10倍，2）快于单播下的现有算法。此外，SCHL方案表明，实际上，随着多播程度增加到超过一定数量，可以减少多个多播的延迟。因此，这些算法显示出巨大的潜力，可用于在当前和未来的虫洞系统上设计快速且可扩展的集体通信库。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号