• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Transactions on Parallel and Distributed Systems >A recursion-based broadcast paradigm in wormhole routed networks
【24h】

A recursion-based broadcast paradigm in wormhole routed networks

机译：虫洞路由网络中基于递归的广播范式

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

摘要

A novel broadcast technique for wormhole-routed parallel computers based on recursion is presented in this paper. It works by partitioning the interconnection graph into a number of higher-level subgraphs. Then, we identify the transmission subgraph (TSG) in each subgraph. Both the higher-level subgraphs and the TSGs are recursively defined, i.e., we split each level i subgraph into several level i+1 subgraphs and identify-level i+1 TSGs accordingly. We first split and scatter the source message into the TSG of the original graph. Next, in each recursive round message transmissions are from lower-level TSGs to higher-level TSGs and all transmissions at the same level happen concurrently. The algorithm proceeds recursively from lower-level subgraphs to higher level subgraphs until each highest-level subgraph (a single node) gets the complete message. We have applied this general paradigm to a number of topologies including two or higher dimension mesh/torus and hypercube. Our results show considerable improvements over all other algorithms for a wide range of message sizes under both one-port and all-port models.
机译：本文提出了一种基于递归的蠕虫路由并行计算机广播技术。它通过将互连图划分为多个更高级别的子图来工作。然后，我们在每个子图中确定传输子图（TSG）。递归地定义了较高级别的子图和TSG，即我们将每个级别的i子图划分为几个级别的i + 1子图，并相应地标识级别i + 1的TSG。我们首先将源消息拆分并分散到原始图形的TSG中。接下来，在每个递归回合中，消息传输是从较低级别的TSG到较高级别的TSG，并且同一级别的所有传输都同时发生。该算法递归地从较低级别的子图进行到较高级别的子图，直到每个最高级别的子图（单个节点）获得完整的消息。我们已将此通用范例应用于许多拓扑，包括二维或更高维的网格/曲面和超立方体。我们的结果表明，在单端口和全端口模型下，对于各种消息大小，所有其他算法均取得了显着改进。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号