begin |
The current iteration number t = 0, and the maximumiteration number is set to M |
Initialize the offload decision matrix An(t) |
Find the optimal solution matrix Pn(t) by observing the state ofAn(t) through the make subroutine |
Correction of Pn(t) by reparation subroutine |
Evaluate the total energy consumption of the system and find theoptimal solution B(t) |
while(t<M)do |
begin |
Number of current iterations t plus 1 |
An(t-1) is observed by the make subalgorithm to determine thePn(t) |
Evaluate Pn(t) for the minimum total system energy consumption |
Updating An(t) through the update subroutine |
Find the optimal solution in Pn(t) and B(t-1) to b |
if(Current number of iterations meets migration conditions)then Migration b to B(t) |
end if |
end |
end |