eldorado.tu-dortmund.de/server/api/core/bitstreams/add7edb9-da6b-4ff7-86d3-f5c588d32f0e/content
Parallel Path Progression DAG Scheduling
from the powerset P(Ψ(G)) is for instance given by ψ := {π2, π3}. Subsequently, Vs(ψ) = π2 ∪ π3 = {v1, v4, v5, v6, v9} and V cs (ψ) := {v2, v3, v7, v8}. If for in- stance all subjobs vi ∈ Vs(ψ) are assigned [...] illustrated in Fig. 1 consists of six paths {π1, π2, . . . , π6}, namely; π1 := 〈v1, v2, v3〉, π2 := 〈v1, v4, v5, v9〉, π3 := 〈v1, v4, v5, v6〉, π4 := 〈v1, v7, v5, v9〉, π5 := 〈v1, v7, v5, v6〉, and π6 := 〈v1, v7 [...] = (1, 2, 3) due to (v1, v4) ∈ E and update π4 = 〈v1, v4, v5, v9〉. Since v1 is a source vertex, the procedure is terminated. Repeating the procedure yields the four simple paths π1 = 〈v1, v2, v3〉, π2 = 〈v1 …
