Multijob Associated Task Scheduling for Cloud Computing Based on Task Duplication and Insertion

Algorithm 1

Algorithm DILS.

Input: Server set , job set with each job’s DAG, and execution time matrices

Output: Makespan of the jobs

1: for each job do

2:  Calculate the predicted remaining time of each task via Eq. (6) and create the Prediction of Remaining Time (PRT) table;

3:   Create an empty ready task list and add the ingress task to the list;

4:    while ready task list is not empty do

5:     for each task in ready task list do

6:      Compute the average path length of task via Eq. (8);

7:     end for

8:      Select the task with the maximum average path length with Eq. (9);

9:      Assign the server leading to the minimum estimated path length via Eq.(10) to the task;

10:      Task duplication and task insertion;

11:      Update the ready task list;

12:    end while

13: end for

14: return the completion time of the last scheduled task.