Research Article
Dynamic Scalable Stochastic Petri Net: A Novel Model for Designing and Analysis of Resource Scheduling in Cloud Computing
Algorithm 1
The improved part of fair scheduling in CFS.
() Initialize the classification of all available resources; | () Initialize the classification of tasks when they are submitted to pools; | () for each pool i whose demand its minimum share do | () for each type k do | () if then | () allocate the resources with type of ; | () ; | () else | () allocate the resources with the type of ; | () ; | () allocate resources with other types, while satisfying , ; | () end if | () end for | () end for | () for (each pool i whose demand > its minimum share) (remaining idle unallocated VMs) do | () add the similar process as described above in light of the assigning decision of each pool; | () end for |
|