Dynamic Task Scheduling in Cloud Computing Based on Greedy Strategy
Task scheduling is essentially an NP-completeness problem in cloud computing and the existing task scheduling strategies can’t fully meet its demands. In this paper, a feasible and flexible dynamic task scheduling scheme DGS is proposed, which dynamically allocates virtual resources to execute computing tasks and promptly completes the scheduling and execution process by using improved greedy strategy. The simulation platform CloudSim is expanded to realize the proposed scheme and the simulation results show that DGS can speed up the tasks’ completion time and improve the utilization of cloud resources to achieve load balance.
Keywordscloud computing dynamic task scheduling greedy strategy load balance completion time
Unable to display preview. Download preview PDF.
- 1.Armbrust, M., Fox, A., Griffith, R., et al.: Above the Clouds: A Berkeley View of Cloud Computing. Technical Report, No. UCB/EECS-2009-28 (2009)Google Scholar
- 2.Baomin, X., Chunyan, Z., Enzhao, H., Bin, H.: Job scheduling algorithm based on Berger model in cloud environment. J. Advances in Engineering Software (2011)Google Scholar
- 5.Dean, J., Ghemawat, S.: MapReduce: Simplified Data Processing on Large Clusters. Communications of the ACM - 50th Anniversary Issue: 1958–2008 51(1), 107–113 (2008)Google Scholar
- 8.Calheiros, R.N., Ranjan, R., Rose, C.A.F.D., Buyya, R.: CloudSim: A Novel Framework for modeling and Simulation of Cloud Computing Infrastructures and Services. Technical report (2009)Google Scholar