• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Transactions on Parallel and Distributed Systems >Routing permutations with link-disjoint and node-disjoint paths in a class of self-routable interconnects
【24h】

Routing permutations with link-disjoint and node-disjoint paths in a class of self-routable interconnects

机译：一类自路由互连中具有链路不相交和节点不相交路径的路由置换

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

摘要

We consider efficiently routing permutations in a class of switch-based interconnects. Permutation is an important communication pattern in parallel and distributed computing systems. We present a generic approach to realizing arbitrary permutations in a class of unique-path, self-routable interconnects. It is well-known that this type of interconnect has low hardware cost, but can realize only a small portion of all possible permutations between its inputs and outputs in a single pass. We consider routing arbitrary permutations with link-disjoint paths and node-disjoint paths in such interconnects in a minimum number of passes. In particular, routing with node-disjoint paths has important applications in emerging optical interconnects. We employ and further expand the Latin square technique used in all-to-all personalized exchange algorithms for this class of interconnects for general permutation routing. Our implementation of permutation routing is optimal in terms of the number of passes that messages are transmitted through the network, and it is near-optimal in network transmission time for sufficiently long messages. The possibility of adopting a single-stage interconnect is also discussed.
机译：我们考虑在一类基于交换机的互连中有效地路由排列。排列是并行和分布式计算系统中的重要通信模式。我们提出一种通用方法来实现一类唯一路径，可自行路由的互连中的任意排列。众所周知，这种类型的互连具有较低的硬件成本，但是一次只能实现其输入和输出之间所有可能排列的一小部分。我们考虑以最少的通过次数在此类互连中路由具有链接不相交路径和节点不相交路径的任意排列。特别地，具有节点不相交路径的路由在新兴的光学互连中具有重要的应用。我们采用并进一步扩展了在用于所有置换路由的此类互连的所有到所有个性化交换算法中使用的拉丁方技术。就消息通过网络传输的通过次数而言，我们的置换路由实现是最佳的，对于足够长的消息，它在网络传输时间上几乎是最佳的。还讨论了采用单级互连的可能性。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号