Research Article
An Efficient Policy-Based Scheduling and Allocation of Virtual Machines in Cloud Computing Environment
Algorithm 2
BMGSA for optimal VM allocation.
| | Input: set of PMs, PMk | | | Output: optimally selected PMs for VM | | (1) | Start | | (2) | for k = 1 to N | | (3) | for d = 1 to D | | (4) | Initialize | | (5) | Initialize velocity, | | (6) | next d | | (7) | Compute the fitness of each agent, | | (8) | next k | | (9) | end for | | (10) | for t = 1 to N | | (11) | Select the best agent and worst agent, Bt and Wt | | (12) | Update mass of each agent, mti | | (13) | Update force acting on each agent, | | (14) | Update | | (15) | Compute total force acting on an agent by Brownian Movement sequence, | | (16) | end for | | (17) | end for | | (18) | for k = 1 to N | | (19) | for d = 1 to D | | (20) | Compute acceleration, | | (21) | Update the position, | | (22) | Update the velocity, | | (23) | next | | (24) | Compute the fitness value of the next agent | | (25) | next | | (26) | next | | (27) | end for | | (28) | end for | | (29) | end |
|
