论文信息 - Dynamic Task Scheduling in Cloud Computing Based on Greedy Strategy

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.

[1] Randy H. Katz,et al. Above the Clouds: A Berkeley View of Cloud Computing , 2009 .

[2] Sanjay Ghemawat,et al. MapReduce: Simplified Data Processing on Large Clusters , 2004, OSDI.

[3] Wael Abdulal,et al. Reliability-Aware Genetic Scheduling Algorithm in Grid Environment , 2011, 2011 International Conference on Communication Systems and Network Technologies.

[4] Baomin Xu,et al. Job scheduling algorithm based on Berger model in cloud environment , 2011, Adv. Eng. Softw..

[5] Deyu Qi,et al. A Threshold-based Dynamic Resource Allocation Scheme for Cloud Computing , 2011 .

[6] R. C. Joshi,et al. A weighted mean time Min-Min Max-Min selective scheduling strategy for independent tasks on Grid , 2010, 2010 IEEE 2nd International Advance Computing Conference (IACC).

[7] Chuang Lin,et al. Efficient dynamic task scheduling in virtualized data centers with fuzzy prediction , 2011, J. Netw. Comput. Appl..

[8] Odej Kao,et al. Exploiting Dynamic Resource Allocation for Efficient Parallel Data Processing in the Cloud , 2011, IEEE Transactions on Parallel and Distributed Systems.

[9] Rajkumar Buyya,et al. CloudSim: A Novel Framework for Modeling and Simulation of Cloud Computing Infrastructures and Services , 2009, ArXiv.