Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
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)
Baomin, X., Chunyan, Z., Enzhao, H., Bin, H.: Job scheduling algorithm based on Berger model in cloud environment. J. Advances in Engineering Software (2011)
Xiangzhen, K., Chuang, L., Yixin, J., Wei, Y., Xiaowen, C.: Efficient dynamic task scheduling in virtualized data centers with fuzzy prediction. Journal of Network and Computer Applications 34(4), 1068–1077 (2011)
Chauhan, S.S., Joshi, R.C.: A Weighted Mean Time Min-Min Max-Min Selective Scheduling Strategy for Independent Tasks on Grid. In: 2010 IEEE 2nd International Advance Computing Conference on (IACC), pp. 4–9. IEEE Press, Patiala (2010)
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)
Abdulal, W., Ramachandram, S.: Reliability-Aware Genetic Scheduling Algorithm in Grid Environment. In: 2011 International Conference on Communication Systems and Network Technologies (CSNT), pp. 673–677. IEEE Press, Katra (2011)
Warneke, D., Kao, O.: Exploiting Dynamic Resource Allocation for Efficient Parallel Data Processing in the Cloud. IEEE Transactions on Parallel and Distributed Systems 22(6), 985–997 (2011)
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)
Weiwei, L., James, Z.W., Chen, L., Deyu, Q.: A Threshold-based Dynamic Resource Allocation Scheme for Cloud Computing. J. Procedia Engineering 23, 695–703 (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ma, L., Lu, Y., Zhang, F., Sun, S. (2013). Dynamic Task Scheduling in Cloud Computing Based on Greedy Strategy. In: Yuan, Y., Wu, X., Lu, Y. (eds) Trustworthy Computing and Services. ISCTCS 2012. Communications in Computer and Information Science, vol 320. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35795-4_20
Download citation
DOI: https://doi.org/10.1007/978-3-642-35795-4_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-35794-7
Online ISBN: 978-3-642-35795-4
eBook Packages: Computer ScienceComputer Science (R0)