• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Transactions on Parallel and Distributed Systems >Improved methods for divisible load distribution on k-dimensional meshes using pipelined communications
【24h】

Improved methods for divisible load distribution on k-dimensional meshes using pipelined communications

机译：使用流水线通信的k维网格上可分负荷分布的改进方法

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

摘要

We give the closed form solutions to the parallel time and speedup of the classic method for processing divisible loads on linear arrays as functions of N, the network size. We propose two methods which employ pipelined communications to distribute divisible loads on linear arrays. We derive the closed form solutions to the parallel time and speedup for both methods and show that the asymptotic speedup of both methods is /spl beta/+1, where /spl beta/ is the ratio of the time for computing a unit toad to the time for communicating a unit load. Such performance is even better than that of the known methods on k-dimensional meshes with k<1. The two new algorithms which use pipelined communications are generalized to distribute divisible loads on k-dimensional meshes, and we show that the asymptotic speedup of both algorithms is k/spl beta/+1, where k/spl ges/1. We also prove that, on k-dimensional meshes where k/spl ges/1, as the network size becomes large, the asymptotic speedup of 2k/spl beta/+1 can be achieved for processing divisible loads by using interior initial processors.
机译：对于并行时间和经典方法的加速问题，我们给出了封闭形式的解决方案，该经典方法用于处理线性数组上的可分负载作为网络大小N的函数。我们提出了两种使用流水线通信在线性阵列上分配可分割负载的方法。我们推导了这两种方法的并行时间和加速比的封闭形式解，并表明这两种方法的渐近加速比为/ spl beta / + 1，其中/ spl beta /是计算单位蟾蜍与目标蟾蜍的时间之比。传达单位负载的时间。这样的性能甚至比k <1的k维网格上的已知方法更好。概括了使用流水线通信的两种新算法，以在k维网格上分布可分负荷，我们证明这两种算法的渐近加速为k / spl beta / + 1，其中k / spl ges / 1。我们还证明，在k / spl ges / 1的k维网格上，随着网络规模变大，可以通过使用内部初始处理器来处理2k / spl beta / + 1的渐近加速。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号