A Synthesized Heuristic Task Scheduling Algorithm

Algorithm 1

The HCPPEFT algorithm.

(1) Compute rank upward, rank downward, predecessors and OCT table for all tasks

(2) Compute for each task in the graph.

      If , where is the entry task, is the set of tasks on the critical path.

(3) Sort the tasks in scheduling queue by critical task, decreasing order of rank value and increasing order of predecessors.

(4)  While there are unscheduled tasks in the queue do

(5)  Select the first task from the queue for scheduling

(6)  for each resource in the resource set () do

(7)      Sort immediate parents of task by decreasing order of data arrival time

(8)      while the duplication condition is satisfied do

(9)       if the duplication of can reduce its start execution time then

(10)      Duplicate and update the earliest start time of and free time slots.

(11)     end

(12)      end

(13)      Compute the earliest finish time by (5).

(14)      

(15)  end

(16)  Assign task to the resource with minimize of task .

(17)  end