Scheduling task graph in Fig 3 using the traditional level priority (right) and the predecessor-task layer priority strategy (left).

<p>Scheduling task graph in <a href="http://www.plosone.org/article/info:doi/10.1371/journal.pone.0159932#pone.0159932.g003" target="_blank">Fig 3</a> using the traditional level priority (right) and the predecessor-task layer priority strategy (left).</p

Average SLR and average Speedup with respect to server number.

<p>Average SLR and average Speedup with respect to server number.</p

Scheduling of the DAG graph in Fig 6 using CEFT algorithm.

<p>Scheduling of the DAG graph in <a href="http://www.plosone.org/article/info:doi/10.1371/journal.pone.0159932#pone.0159932.g006" target="_blank">Fig 6</a> using CEFT algorithm.</p

Scheduling of the DAG graph in Fig 6 using HEFT-Lookahead algorithm.

<p>Scheduling of the DAG graph in <a href="http://www.plosone.org/article/info:doi/10.1371/journal.pone.0159932#pone.0159932.g006" target="_blank">Fig 6</a> using HEFT-Lookahead algorithm.</p

Example illustrating the procedure of the dynamic essential long path strategy.

<p>Example illustrating the procedure of the dynamic essential long path strategy.</p

Average SLR and average Speedup with different DAG graph structures.

<p>Average SLR and average Speedup with different DAG graph structures.</p

DAG Graph and the computation cost of each task node on all servers.

<p>DAG Graph and the computation cost of each task node on all servers.</p

Cloud Computing Model.

<p>Cloud Computing Model.</p

Different type DAG Graph: A: an out-tree task graph, B: an in-tree task graph, C: a mean value analysis task graph, D: an LU-decomposition task graph.

<p>Different type DAG Graph: A: an out-tree task graph, B: an in-tree task graph, C: a mean value analysis task graph, D: an LU-decomposition task graph.</p

Priority value of task node with different type DAG graphs.

<p>Priority value of task node with different type DAG graphs.</p