知识卡片
贪心调度尽量不让可用核心空闲
贪心调度每步分配尽可能多的就绪计算串:就绪数不少于P则占满P核,不足P则全部运行;
它无需预知未来派生任务。
这张卡片看不懂?
这张卡片的反馈已满 10 条,暂时无法继续提交。
已有反馈 · 0 / 10 条
还没有人提交反馈。
在整书笔记中的位置
原书出处 · 1 处
- 第26章 并行算法 · 查看原书依据
greedy schedulers, which assign as many strands to processors as possible in each time step, never leaving a processor idle if there is work that can be done. We’ll classify each step of a greedy scheduler as follows:
参考来源
- 位置:《算法导论(第4版)》第26章《并行算法》(OEBPS/chapter026.xhtml,文本字符[25000,30000))。
- 结论依据:原文定义贪心调度及完整/不完整步骤。
- 原始内容:greedy schedulers , which assign as many strands to processors as possible in each time step, never leaving a processor idle if there is work that can be done. We’ll classify each step of a greedy scheduler as follows: