• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Transactions on Parallel and Distributed Systems >Fast compaction in hypercubes
【24h】

Fast compaction in hypercubes

机译：超立方体中的快速压实

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

摘要

Compaction relocates active subcubes in a fragmented hypercube so as to produce a contiguous free region and eliminate the adverse impact of fragmentation on performance. The overhead of compaction is often contributed primarily by task migration, which makes use of disjoint paths for transmitting migrated data. Since task migration usually involves transmitting a large amount of data, the time required for migration with single paths is long, making compaction an undesirably lengthy process. This paper considers fast compaction through the use of all disjoint paths in existence for migration simultaneously from a source subcube to its target subcube, effectively reducing the size of data transmitted over a path and shortening the migration time. This approach leads to considerable savings in the compaction time for hypercubes which support circuit switching or wormhole routing, when compared with that using single migration paths.
机译：压缩将活动的子立方体重新放置在碎片化的超立方体中，以便产生连续的自由区域并消除碎片化对性能的不利影响。压缩的开销通常主要由任务迁移贡献，任务迁移利用不相交的路径来传输迁移的数据。由于任务迁移通常涉及传输大量数据，因此使用单路径迁移所需的时间很长，从而使压缩成为不希望的冗长的过程。本文考虑通过使用所有不相交的路径进行快速压缩，以同时从源子多维数据集迁移到目标子多维数据集，从而有效地减少了通过路径传输的数据大小并缩短了迁移时间。与使用单个迁移路径的超立方体相比，此方法可大大节省支持电路交换或虫孔路由的超立方体的压缩时间。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号