• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Transactions on Parallel and Distributed Systems >Collection-aware optimum sequencing of operations and closed-form solutions for the distribution of a divisible load on arbitrary processor trees
【24h】

Collection-aware optimum sequencing of operations and closed-form solutions for the distribution of a divisible load on arbitrary processor trees

机译：集合感知的最佳操作顺序和封闭形式的解决方案，可在任意处理器树上分配可分割的负载

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

摘要

The problem of optimally distributing a divisible load to the nodes of an arbitrary processor tree is tackled in this paper. The rigorous mathematical foundation presented allows the derivation of the sequence of operations that is necessary to obtain the minimum processing time, along with closed-form expressions that yield the solution in time O(NP), where P is the number of tree nodes and N their maximum degree. The main contributions of this work are: (1) both load distribution and result collection overheads are considered, thus providing better resource utilization, and (2) arbitrary processor trees are examined in contrast with previous approaches that examined either complete homogeneous trees, or single level trees. Additionally, approximate algorithms for solving the problem of specifying the optimum subset of active processors for a given load, are presented and evaluated.
机译：本文解决了将可分负载最佳地分配给任意处理器树的节点的问题。提出的严格数学基础允许推导获得最短处理时间所必需的操作序列，以及产生时间为O（NP）的解的闭式表达式，其中P是树节点的数量，N他们的最高学位。这项工作的主要贡献是：（1）同时考虑了负载分配和结果收集开销，从而提供了更好的资源利用率；（2）与以前的检查完全同质树或单个树的方法相比，检查了任意处理器树等级树。另外，提出并评估了用于解决为给定负载指定活动处理器的最佳子集的问题的近似算法。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号