A Randomization Approach for Stochastic Workflow Scheduling in Clouds

Algorithm 2

The randomized HEFT heuristic.

(1)   Compute rank (as defined in (4)) for all tasks.

(2)   Sort all tasks in a list in the non-descending order of Urank.

(3)   for   to   do (where is the number of tasks)

(4)    Select the th task from the list .

(5)    for each resource   do

(6)     Compute the mean value and variance of estimated finish time of on (as defined in (7)).

(7)    endfor

(8)    Decide the winner resource of estimated finish time () for according to the random comparison policy.

(9)    Allocate to .

(10)   endfor