Task scheduling algorithm based-on QoS constrains in cloud computing

8Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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.

Cite

CITATION STYLE

APA

Zhang, Y., & Xu, B. (2015). Task scheduling algorithm based-on QoS constrains in cloud computing. International Journal of Grid and Distributed Computing, 8(6), 269–280. https://doi.org/10.14257/ijgdc.2015.8.6.26

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free