.png){kind=icon}
.png){kind=icon}
Return
Job scheduling algorithm based on Berger model in cloud environment
.png){kind=icon}
PRE
AI
DOI：10.1016/j.advengsoft.2011.03.007.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Considered the commercialization and the virtualization characteristics of cloud computing, the paper proposed for the first time an algorithm of job scheduling based on Berger model. In the job scheduling process, the algorithm establishes dual fairness constraint. The first constraint is to classify user tasks by QoS preferences, and establish the general expectation function in accordance with the classification of tasks to restrain the fairness of the resources in selection process. The second constraint is to define resource fairness justice function to judge the fairness of the resources allocation. We have expanded simulation platform CloudSim, and have implemented the job scheduling algorithm proposed in this paper. The experimental results show that the algorithm can effectively execute the user tasks and manifests better fairness. (C) 2011 Elsevier Ltd. All rights reserved.
Keywords:
Cloud computing
Berger model
Job scheduling
QoS
Fairness constrain
Resources allocation Economic
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
5.7
Papers:
3.3K
Citations:
1.2W
View more organizations