A task scheduling algorithm based on Qos

DOI

10.2991/icmemtc-16.2016.87How to use a DOI?

Keywords

Cloud computing; Task scheduling; Qos; User Satisfaction; Load balance.

Abstract

The key problem of task scheduling is to give optimal matching schemes for tasks and resources. In the scheduling process, users pursue high quality and service providers favor high yields, so the high efficiency must be considered in the process of task scheduling. The author puts forward a task scheduling algorithm on the premise of fully considering the system load-balancing, improving user satisfaction. By taking the simulation experiments of Cloudsim, The author proves that the algorithm is better than the algorithm of Min-Min based on Qos and the traditional algorithm of FCFS(First Come First Service).

Copyright

© 2016, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Junwei Ge
AU  - Qingling Wang
AU  - Yiqiu Fang
PY  - 2016/04
DA  - 2016/04
TI  - A task scheduling algorithm based on Qos
BT  - Proceedings of the 2016 3rd International Conference on Materials Engineering, Manufacturing Technology and Control
PB  - Atlantis Press
SP  - 451
EP  - 454
SN  - 2352-5401
UR  - https://doi.org/10.2991/icmemtc-16.2016.87
DO  - 10.2991/icmemtc-16.2016.87
ID  - Ge2016/04
ER  -