DocumentCode :
2575407
Title :
Job scheduling based on ant colony optimization in cloud computing
Author :
Song, Xiangqian ; Gao, Lin ; Wang, Jieping
Author_Institution :
Sch. of Comput. & Control, Guilin Univ. of Electron. Technol., Guilin, China
fYear :
2011
fDate :
27-29 June 2011
Firstpage :
3309
Lastpage :
3312
Abstract :
Effective job scheduling is critical in achieving on-demand resources allocation in dynamic cloud computing paradigm. In this paper, we proposed an Ant Colony Optimization based job scheduling algorithm, which adapts to dynamic characteristics of cloud computing and integrates specific advantages of Ant Colony Optimization in NP-hard problems. It aims to minimize job completion time based on pheromone. Experimental results obtained showed that it is a promising Ant Colony Optimization algorithm for job scheduling in cloud computing environment.
Keywords :
cloud computing; optimisation; resource allocation; scheduling; NP-hard problems; ant colony optimization; cloud computing; job scheduling; resources allocation; Ant colony optimization; Cloud computing; Job shop scheduling; Scheduling algorithm; Traveling salesman problems; Ant Colony Optimization; Cloud Computing; Job Scheduling;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer Science and Service System (CSSS), 2011 International Conference on
Conference_Location :
Nanjing
Print_ISBN :
978-1-4244-9762-1
Type :
conf
DOI :
10.1109/CSSS.2011.5972226
Filename :
5972226
Link To Document :
بازگشت