Abstract
Cloud computing has gained a lot of attention to be used as a computing model for a variety of application domains. Task scheduling is the fundamental issue in this environment. To utilize cloud efficiently, a good task scheduling algorithm is needed to assign tasks to resources in cloud. Cloud task can be divided into two categories such as on-line mode service and the batch mode service. In this paper, online cloud task scheduling based on virtual machine adaptive fault tolerance and load balancing using ant colony algorithm is proposed. The main contribution of this work is that load balancing factor is added and the system tolerates the faults by tacking the decision on the basis of reliability of the virtual machines in scheduling process. The proposed scheduling strategy was simulated using the Cloudsim toolkit package. Experimental results show that the proposed algorithm achieved the better load balance than Join-shortest-queue (JSQ) and Modified Ant Colony Optimization (MACO) algorithms.
Cite
CITATION STYLE
Keshk, A. E. (2014). Cloud Computing Online Scheduling. IOSR Journal of Engineering, 4(3), 07–17. https://doi.org/10.9790/3021-04360717
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.