• 主题
高级搜索  >
历史搜索 清空历史
首页> 美国政府科技报告 >Periodic Scheduling Heuristic for Mapping Iterative Task Graphs onto DistributedMemory Multiprocessors
【24h】

Periodic Scheduling Heuristic for Mapping Iterative Task Graphs onto DistributedMemory Multiprocessors

机译：用于将迭代任务图映射到Distributedmemory多处理器的周期调度启发式算法

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

This thesis investigates the problem of statically assigning the tasks ofapplications represented by repetitive task graphs (such as sonar or radar signal processing) to the processors of a distributed memory multiprocessor system with the objective of maximizing graph instance throughput. The repetitive nature of these task graphs allows for pipelining and the overlapping of successive graph instances, suggesting a departure from classical directed acyclic graph scheduling techniques. To investigate such a claim, a version of the Mapping Heuristic (MH) ELR 90 is extended for use with iterative applications. Then a new heuristic, Periodic Scheduling (PS), is developed to capitalize on the repetitive nature of these task graphs by overlapping successive graph instances. The PS heuristic assigns tasks to processors in such a way so as to minimize the maximal utilization of the processors and the communications links between them. This maximal utilization figure dictates the interval between successive instances of the task graph. We conduct experiments in which the graph instance throughput of PS is compared to that of MH across a broad range of processor topologies, utilizing several communications/computation ratios. It is shown that, compared to MH, the PS heuristic improves the throughput performance between two and 50 percent. Particularly noteworthy improvement is noted on systems with high average inter-node communications costs. Assignment, Distributed processors, Heuristic algorithm, Mapping problem, Scheduling.

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号