本文介绍了有向无环图（DAG）的概念，并详细阐述了拓扑排序在任务依赖执行中的应用。接着讨论了最小和最小子顶点的定义。在任务调度部分，解释了如何在DAG中识别链和最大元素，定义了反链（antichain），并提出了平行任务调度的策略，包括最大元素、块划分和所需处理器数量的概念。最后提到了Dilworth's Lemma，该定理指出每个DAG要么包含长链，要么存在大反链。
1 DAG
Definition: A directed acyclic graph (DAG) is a directed graph with no cycles.
2 Scheduling
2.1 Topological Sort
- A topological sort of a finite DAG is a list of all the vertices such that each vertex v appears earlier in the list than every other vertex reachable from v.
- For task dependencies, topological sorting provides a way to execute tasks one after another while respecting those dependencies.
2.2 minimal and minimum
An vertex v of a DAG, D, is minimum iff every other vertex is reachable from v. A vertex v is minimal iff v is not reachable from any other vertex.
- These words come from the perspective that a vertex is “smaller” than any other vertex it connects to.
- Every finite DAG has a topological sort.
最低0.47元/天 解锁文章
扫一扫
1022
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
