.png){kind=icon}
返回
Scheduling optimization through iterative refinement
.png){kind=icon}
PRE
AI
DOI：10.1016/S1383-7621(99)00043-0.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Scheduling computations with communications is the theoretical basis for achieving efficient parallelism on distributed memory systems. We generalize Graham's task-level in a manner to incorporate the effects of computation and communication. A new scheduling is proposed by combining task priority with efficient management of processor idle time. We also propose an optimization called Iterative Refinement Scheduling (IRS) that iteratively schedules the forward and backward computation graph. The task-level used in some scheduling iteration is obtained from the schedule generated in the previous iteration. Each iteration produces a new schedule and new task-levels. This approach enables searching and optimizing solutions as the result of using more refined task-level in each scheduling iteration. Evaluation and analysis of the results are carried out for different instances of communication granularities and problem parallelism. It is shown that solutions obtained out of few iterations statistically outperforms those generated by other recently proposed scheduling. IRS allows exploring a space of solutions whose size grows with the amount of parallelism and communication granularity. IRS enables optimizing the solution specially for critical instances such as fine-grain computations and large parallelism. (C) 2000 Elsevier Science B.V. All rights reserved.
Keyword:
distributed memories
heuristics
message-passing
performance
scheduling
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.1
论文数:
3.0K
被引数:
4.2K
机构
暂无机构信息
引用论文
分享收藏Investigation of the optical properties of the Cr doped CuxO thin film deposited by thermionic vacuum arc plasma.png)
Optik
OptikIF0
PREAI
分享收藏
查看更多内容