Research on the Cloud Computing Load Balance Degree of Priority Scheduling Algorithm based on Convex Optimization Theory

DOI

10.2991/iemb-15.2015.31How to use a DOI?

Keywords

Cloud Computing; Load Balance; Convex Optimization; Priority Scheduling.

Abstract

In this research paper, we research on the cloud computing load balance degree of priority scheduling algorithm based on convex optimization theory. Clustering is an important problem is the load balancing in the system. Load balancing cluster system goal is according to the performance of the processor to allocate commensurate with the task. Cloud services in one of the core technology of virtualization technology can make a variety of computing resources dynamically organize, computer hardware architecture and software system will separate. The theoretical and numerical analysis show the effectiveness and feasibility of our propose method. The detailed discussion will be conducted in the following subsections with examples and mathematical inductions.

Copyright

© 2015, 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  - Wang Rong
AU  - Rao Bin
PY  - 2015/09
DA  - 2015/09
TI  - Research on the Cloud Computing Load Balance Degree of Priority Scheduling Algorithm based on Convex Optimization Theory
BT  - Proceedings of the 2015 Conference on Informatization in Education, Management and Business
PB  - Atlantis Press
SP  - 156
EP  - 160
SN  - 2352-5398
UR  - https://doi.org/10.2991/iemb-15.2015.31
DO  - 10.2991/iemb-15.2015.31
ID  - Rong2015/09
ER  -