원문정보
보안공학연구지원센터(IJFGCN)
International Journal of Future Generation Communication and Networking
Vol.8 No.1
2015.02
pp.247-260
피인용수 : 0건 (자료제공 : 네이버학술정보)
초록
영어
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
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
저자정보
참고문헌
자료제공 : 네이버학술정보