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

摘要

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.