• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Transactions on Parallel and Distributed Systems >Scheduling divisible loads on star and tree networks: results and open problems
【24h】

Scheduling divisible loads on star and tree networks: results and open problems

机译：计划星形和树形网络上的可分负载：结果和未解决的问题

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

摘要

Many applications in scientific and engineering domains are structured as large numbers of independent tasks with low granularity. These applications are thus amenable to straightforward parallelization, typically in master-worker fashion, provided that efficient scheduling strategies are available. Such applications have been called divisible-loads because a scheduler may divide the computation among worker processes arbitrarily, both in terms of number of tasks and of task sizes. Divisible load scheduling has been an active area of research for the last 15 years. A vast literature offers results and scheduling algorithms for various models of the underlying distributed computing platform. Broad surveys are available that report on, accomplishments in the field. By contrast, We propose a unified theoretical perspective that synthesizes previously published results, several novel results, and open questions, in a view to foster hover divisible load scheduling research. Specifically, we discuss both one-round and multiround algorithms, and we restrict our scope to the popular star and tree network topologies, which we study with both linear and affine cost models for communication and computation.
机译：科学和工程领域中的许多应用程序被构造为大量的低粒度的独立任务。因此，只要有有效的调度策略可用，这些应用程序通常就可以以简单的并行方式进行简单并行化。这样的应用程序被称为可分割负载，因为调度程序可以根据任务数量和任务大小在工作进程之间任意划分计算。在过去的15年中，可分负荷调度一直是研究的活跃领域。大量文献为底层分布式计算平台的各种模型提供了结果和调度算法。可以进行广泛的调查，以报告该领域的成就。相比之下，我们提出了一个统一的理论观点，该观点综合了以前发表的结果，一些新颖的结果和未解决的问题，以期促进悬停可分负荷计划研究。具体来说，我们讨论了单轮和多轮算法，并且将范围限制在流行的星形和树形网络拓扑中，我们使用线性和仿射成本模型进行研究，以进行通信和计算。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号