Research Article
A Time-Efficient Solution to the General Resource Placement Problem in Cloud
Algorithm 2
The steps of D-URP.
| input: total amount of resources ; | | demand distribution , , | | and ; . | | output: amount of resources of each type placed in each | | region . | | (1) for to do | | (2) , for . | | (3) end | | (4) for to do | | (5) . | | (6) for to do | | (7) . | | (8) . | | (9) . | | (10) end | | (11) . | | (12) . | | (13) if then break; | | (14) end | | (15) for to do | | (16) . | | (17) for to do ; | | (18) end |
|