Research Article
Application Scheduling in Mobile Cloud Computing with Load Balancing
Algorithm 1
The HACAS algorithm.
(1) Initialize , , , , , number | of cycles , , , tabu_list = , | best_solution = 0, application_provider, , , | (2) for (: ; t++) | (3) for (; ; 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 |
|