Application Scheduling in Mobile Cloud Computing with Load Balancing

Algorithm 1

The HACAS algorithm.

(1)  Initialize 𝑟_𝑖𝑗, 𝑐_𝑖, 𝑝_𝑗, 1≤𝑖≤𝑚,1≤𝑗≤𝑛, 𝑞=𝑛, number

   of cycles 𝐶, 𝜏_𝑗(0)=1/𝑞, 1≤𝑗≤𝑞, tabu_list = [],

   best_solution = 0, application_provider, 𝛼=𝛽=1, 𝜌=0.3, 𝑄=1

(2)  for (𝑡=1: 𝑡<=𝐶; t++)

(3)  for (𝑗=1; 𝑗<𝑞; j++)

(4)  random_first = 0

(5)  while  𝑎𝑙𝑙𝑜𝑤𝑒𝑑_𝑗(𝑡)≠∅

(6)   if  random_first == 0

(7)    Select the first scheduled application randomly

(8)    random_first = 1

(9)   else

(10)  Select the scheduled application ℎ according to (12)

(11)   end if

(12)  Calculate the expected loads of all feasible providers according to (14)

(13)  Rank the feasible providers according to their expected loads in an increasing order

(14)  The provider with the lowest expected load is selected for ℎ

(15)  Add ℎ to 𝑆_𝑗(𝑡) and the tabu_list

(16) end while

(17)  Calculate 𝑓(𝑆_𝑗(𝑡)), which is the object function of the generated solution of ant 𝑗

(18) if  𝑓(𝑆_𝑗(𝑡)) > best_solution

(19)  best_solution = 𝑓(𝑆_𝑗(𝑡))

(20)  Save ant j’s solution in application_provider

(21) end if

(22)  end for

(23)  Calculate the incremental pheromone on each application according to (5)

(24)  Clear the tabu_list for each ant

(25) end for

(26) print  best_solution

(27) print  application_provider