Advertisement

Dynamic Task Scheduling in Cloud Computing Based on Greedy Strategy

  • Liang Ma
  • Yueming Lu
  • Fangwei Zhang
  • Songlin Sun
Part of the Communications in Computer and Information Science book series (CCIS, volume 320)

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.

Keywords

cloud computing dynamic task scheduling greedy strategy load balance completion time 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. 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
  3. 3.
    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)CrossRefGoogle Scholar
  4. 4.
    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)CrossRefGoogle Scholar
  5. 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
  6. 6.
    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)CrossRefGoogle Scholar
  7. 7.
    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)CrossRefGoogle Scholar
  8. 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
  9. 9.
    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)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Liang Ma
    • 1
    • 2
  • Yueming Lu
    • 1
    • 2
  • Fangwei Zhang
    • 3
  • Songlin Sun
    • 1
    • 2
  1. 1.School of Information and Communication EngineeringBeijing University of Posts and TelecommunicationsBeijingChina
  2. 2.Key Laboratory of Trustworthy Distributed Computing and Service (BUPT)Ministry of EducationBeijingChina
  3. 3.School of HumanitiesBeijing University of Posts and TelecommunicationsBeijingChina

Personalised recommendations