원문정보
보안공학연구지원센터(IJGDC)
International Journal of Grid and Distributed Computing
Vol.8 No.6
2015.12
pp.269-280
피인용수 : 0건 (자료제공 : 네이버학술정보)
초록
영어
Based on the study of traditional min-min scheduling algorithm, the paper proposed a min-min task scheduling algorithm based on QOS constraints in cloud computing. According to the vector which is generated by QOS parameters, the algorithm processes the matching of resources and tasks, and then provides users with resources which meet their requirements. Experimental results show that the min-min task scheduling algorithm for cloud computing has better performance in such aspects as task execution time, rate of discarding task and QOS satisfaction compared with traditional min-min scheduling algorithm.
목차
Abstract
1. Introduction
2. Resource Manage Model based on QoS
2.1. Description of QoS
2.2. The Benefit Function
3. Task Scheduling Algorithm based on QoS Constraints
3.1. Min-Min Algorithm
3.2. Mul-QoS-Min-Min Algorithm
4. Results and Discussion
5. Conclusions
References
1. Introduction
2. Resource Manage Model based on QoS
2.1. Description of QoS
2.2. The Benefit Function
3. Task Scheduling Algorithm based on QoS Constraints
3.1. Min-Min Algorithm
3.2. Mul-QoS-Min-Min Algorithm
4. Results and Discussion
5. Conclusions
References
저자정보
참고문헌
자료제공 : 네이버학술정보