Earticle

초록

영어

Because the task scheduling problem is np-complete problem, it is hard to find a deterministic algorithm to solve the problem of task scheduling in the cloud computing platform. Therefore this paper presents a task scheduling mechanism based on simulated annealing algorithm. The algorithm is a modern heuristic algorithm and overcome the shortcoming of the local optimum search method. The algorithm uses a greedy algorithm to generate the initial value, and heat to a sufficiently high temperature and according to certain rules to generate a new value. If the new value is better than the original value or at a certain probability can be accepted, then replace the original value with the new value until cool. Experiments proved the feasibility and effectiveness of the algorithm. Compared with traditional algorithms, this task scheduling mechanism not only meets the needs of users and improves the performance of the system.

목차

Abstract
 1. Introduction
 2. Related Work
 3. Virtual Machine Selection Strategy Based on Simulated Annealing Algorithm
  3.1. Simulated Annealing Algorithm Description
  3.2. Simulated Annealing Algorithm Framework
 4. Algorithm Implementation and System Test
 5. Conclusions
 Acknowledgements
 References

키워드

저자

• Xi Liu [ College of Information Science and Engineering, Yunnan University, Kunming Yunnan China ]
• Jun Liu [ College of Mathematics and Information Science, Qujing Normal University, Qujing Yunnan China ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Hybrid Information Technology

• 간기

  격월간

• pISSN

  1738-9968

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605