Job scheduling algorithm based on Berger model in cloud environment

Authors:
Baomin Xu;Chunyan Zhao;Enzhao Hu;Bin Hu
Affiliations:
School of Computer and Information Technology, Beijing Jiaotong University, Beijing 100044, China;National Meteorological Information Center, China Meteorological Administration, Beijing 100081, China;School of Computer and Information Technology, Beijing Jiaotong University, Beijing 100044, China;Department of Computing, Birmingham City University, Galton Building, Perry Barr, Birmingham B42 2SU, UK and School of Information Science and Engineering, Lanzhou University, No. 222 Tianshui Sou ...
Venue:
Advances in Engineering Software
Year:
2011

Citing 4
Cited 3

The POPCORN market—an online market for computational resources

Proceedings of the first international conference on Information and computation economies
A futures market in computer time

Communications of the ACM
A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems

Journal of Parallel and Distributed Computing
Market-Oriented Cloud Computing: Vision, Hype, and Reality for Delivering IT Services as Computing Utilities

HPCC '08 Proceedings of the 2008 10th IEEE International Conference on High Performance Computing and Communications

Modelling and evaluating a high serviceability fault tolerance strategy in cloud computing environments

International Journal of Security and Networks
Analysing and evaluating malicious trust in cloud computing environments from a statistical perspective

International Journal of Wireless and Mobile Computing
Analyzing, modeling and evaluating dynamic adaptive fault tolerance strategies in cloud computing environments

The Journal of Supercomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.