DocumentCode :
1582331
Title :
A task scheduling algorithm based on qos and complexity-aware optimization in cloud computing
Author :
Wang Ning ; Yang Yang ; Meng Kun ; Chen Yu ; Ding Hao
Author_Institution :
Sch. of Comput. & Commun. Eng., Univ. of Sci. & Technol. Beijing, Beijing, China
fYear :
2013
Firstpage :
1
Lastpage :
8
Abstract :
Currently, in cloud computing, the issue about how to get the higher QoS (quality of service) by the lower service cost is increasingly attracting the attention. In this paper, we study the system service cost and the task scheduling algorithms of the optimizing resource. Meanwhile, we consider the affecting factors, including the cloud service cost, node´s load rate, bandwidth utilization, network delay, and task computation complexity. Besides, the mathematical model of the dynamic service-quality cost (DSC) which can real-time synthetically measure service cost and node´s service performance in cloud computing is proposed. Furthermore, we present the task scheduling algorithm of complexity-aware optimization based on the discussion. Finally, our experimental results demonstrate the reasonability and effectiveness of our algorithm. It can achieve not only the lower service cost but also the higher service quality by more reasonably assigning the tasks to the nodes for calculation in cloud computing. And the results are consistent with the theoretical analysis.
Keywords :
cloud computing; computational complexity; optimisation; scheduling; QOS; cloud computing; complexity-aware optimization; computation complexity; dynamic service-quality cost; higher service quality; task scheduling algorithm; Cloud Computing; Network Coordinate System; QoS; Service Cost; Task Computation Complexity;
fLanguage :
English
Publisher :
iet
Conference_Titel :
Information and Communications Technology 2013, National Doctoral Academic Forum on
Conference_Location :
Beijing
Electronic_ISBN :
978-1-84919-819-6
Type :
conf
DOI :
10.1049/ic.2013.0202
Filename :
6767285
Link To Document :
بازگشت