首页> 外文会议>Job scheduling strategies for parallel processing >Contention-Aware Scheduling with Task Duplication
【24h】

Contention-Aware Scheduling with Task Duplication

机译:具有任务复制的竞争感知调度

获取原文
获取原文并翻译 | 示例

摘要

Scheduling a task graph onto several processors is a trade-off between maximising concurrency and minimising interprocessor communication. A technique to reduce or avoid interprocessor communication is task duplication. Certain tasks are duplicated on several processors to produce the data locally and avoid the communication among processors. Most algorithms using task duplication are for the classic model, which allows concurrent communication and ignores contention for communication resources. The recently proposed, more realistic contention model introduces contention awareness into task scheduling by assigning the edges of the task graph to the links of the communication network. It is intuitive that scheduling under such a model benefits even more from task duplication. This paper proposes a contention-aware task duplication scheduling algorithm, after investigating how to use task duplication in the contention model. An extensive experimental evaluation demonstrates the significant improvements to the speedup of the produced schedules.
机译:将任务图调度到多个处理器上是在最大化并发性和最小化处理器间通信之间的权衡。减少或避免处理器间通信的技术是任务重复。某些任务在多个处理器上重复执行,以在本地生成数据并避免处理器之间的通信。大多数使用任务复制的算法都是针对经典模型的,该模型允许并发通信,并且忽略对通信资源的争用。最近提出的更现实的竞争模型通过将任务图的边缘分配给通信网络的链路,将竞争意识引入到任务调度中。直观的说,在这种模型下进行调度从任务复制中受益更大。在研究如何在竞争模型中使用任务复制后,本文提出了一种竞争感知任务复制调度算法。广泛的实验评估表明,可以显着改善生产进度。

著录项

  • 来源
  • 会议地点 Rome(IT);Rome(IT)
  • 作者单位

    Department of Electrical and Computer Engineering, University of Auckland Private Bag 92019, Auckland 1142, New Zealand;

    Department of Electrical and Computer Engineering, University of Auckland Private Bag 92019, Auckland 1142, New Zealand;

    Department of Electrical and Computer Engineering, University of Auckland Private Bag 92019, Auckland 1142, New Zealand;

  • 会议组织
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类 在其他方面的应用;
  • 关键词

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号