Earticle

초록

영어

Efficient task scheduling mechanism in cloud computing can improve the resource utilization and enhance the overall performance of the cloud computing environment. However, the existing strategies based on static task requirements are difficult to guarantee the stability of the system, while dynamic mechanisms have higher complexity. In this paper, a new task scheduling algorithm based on potential game is proposed. We prove that the potential game will reach Nash equilibrium quickly. Also, the system load balancing level is adaptive with the number of users’ task changing. The experimental results show the priority of the proposed algorithm.

목차

Abstract
 1. Introduction
 2. Related Work
 3. Preliminaries
  3.1 Task Scheduling in Cloud Computing
  3.2 Potential Games
  3.3 Introduction of the Cloud Computing
 4. The Potential Game Model of Task Scheduling in Cloud Computing Environment
  4.1 The Task Scheduling Game Model
  4.2 The Task Scheduling Game is a Potential Game
  4.3 The Nash Equilibrium of Task Scheduling Game is Consistent with the Minimum Value of the Potential Game
 5. Algorithm Design
 6. Experimental Analysis
  6.1 The Comparison of Total Tasks Run-time
  6.2 Tasks Load Distribution
 7. Algorithm Extended
 8. Conclusion
 Acknowledgements
 References

키워드

저자

• Ming-chun Zheng [ College of Management Science and Engineering, Shandong Normal University, Jinan, China ]
• Xiao Li [ State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing, China ] Corresponding author.

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Future Generation Communication and Networking

• 간기

  격월간

• pISSN

  2233-7857

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605