User Demand Aware Grid Scheduling Model with Hierarchical Load Balancing

Algorithm 1

Scheduling algorithm.

Begin

  While there are jobs in unassigned list

  do

    Select job 𝑖 which has minimum user deadline from unassigned list

    For all resources 𝑗 in the resource list

    do

      EET𝑖,𝑗 = Length_𝑖Capacity_𝑗

      𝑆_𝑖=IF_𝑖+OF_𝑖

      𝑆DT(𝑖,𝑗)=^𝑖𝐵_𝑗 where 𝐵_𝑗 is the baud rate of resource 𝑗 expressed in Mbps

      RT(𝑗)=∑^𝑛_𝑖=1EET(𝑖,𝑗) where 𝑛 is number of jobs that are already in queue

      ECT𝑖,𝑗=RT𝑗+  EET(𝑖,𝑗) +DT(𝑖,𝑗)

    End for

  Calculate difference matrix such that

    DF𝑖,𝑗= 𝐷_𝑖 −ECT𝑖,𝑗forall𝑖,𝑗 and if DF(𝑖,𝑗)<0, then assign a maximum value to DF(𝑖,𝑗)

    where 𝑖 represents the jobs and 𝑗 is resource/machine/PE

  Classify the resources/machines/PEs using Algorithms 2, 3, 4

  Sort the list of resources/machines/PEs in ascending order based on DF(𝑖,𝑗)

  Assign the job 𝑖 to the first resource/machine/PE 𝑗 in under loaded list with load ≤ 1

  Update the load at each resource/machine/PE

  Remove the job i from unassigned list

  End While

End