Research Article
Location-Constrained Virtual Machine Placement (LCVP) Algorithm
| input : Original candidate PM sets, PM set , VM set | | output: Preprocessed candidate PM sets | (1) | ; | //check the candidate PM set for each VM and remove the PMs with insufficient capacity. | (2) | for each do | (3) | for each do | (4) | if then | (5) | remove from ; | (6) | endif | (7) | endfor | (8) | endfor | | //for each PM, find out all VMs that consider the PM as a candidate and save the VMs in . | (9) | for each do | (10) | for each do | (11) | ; | (12) | endfor | (13) | endfor | | //for each PM whose, only reserve it as the candidate for the VM whose candidate PM set | //has the smallest size and remove it from other candidate sets. | (14) | for each do | (15) | if > 1 then | (16) | ; | (17) | ; | (18) | for each do | (19) | ; | (20) | endfor | (21) | endif | (22) | endfor |
|