Skip to main content

A PSO Algorithm-Based Task Scheduling in Cloud Computing

  • Conference paper
  • First Online:
Soft Computing: Theories and Applications

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 742))

Abstract

Cloud computing is one of the most acceptable emerging technologies, which involves the allocation and de-allocation of the computing resources using the Internet as the core technology to compute the tasks or jobs submitted by the users. Task scheduling is one of the fundamental issues in cloud computing and lots of efforts have been made to solve this problem. For the success of any cloud-based computing model, efficient task scheduling mechanism is always needed which, in turn, is responsible for the allocation of tasks to the available processing machines in such a manner that no machine is over- or under-utilized while executing them. Scheduling of tasks belongs to the category of NP-Hard problem. Through this paper, we are proposing the particle swarm optimization (PSO)-based task scheduling mechanism for the efficient distribution of the task among the virtual machines (VMs) in order to keep the overall response time minimum. The proposed algorithm is compared using the CloudSim simulator with the existing greedy and genetic algorithm-based task scheduling mechanism and results clearly shows that the PSO-based task scheduling mechanism clearly outperforms the others techniques which are taken into consideration.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Sadiku, M.N., Musa, S.M., Momoh, O.D.: Cloud computing: opportunities and challenges. IEEE Potentials 33(1), 34–36 (2014)

    Article  Google Scholar 

  2. Alhamazani, K., Ranjan, R., Mitra, K., Rabhi, F., Jayaraman, P.P., Khan, S.U., Bhatnagar, V.: An overview of the commercial cloud monitoring tools: research dimensions, design issues, and state-of-the-art. Computing 97(4), 357–377 (2015)

    Article  MathSciNet  Google Scholar 

  3. Duan, Q., Yan, Y., Vasilakos, A.V.: A survey on service-oriented network virtualization toward convergence of networking and cloud computing. IEEE Trans. Netw. Serv. Manage. 9(4), 373–392 (2012)

    Article  Google Scholar 

  4. Shi, Y., Eberhart, R.C.: Parameter selection in particle swarm optimization. In: International Conference on Evolutionary Programming, pp. 591–600. Springer, Berlin, Heidelberg (1998)

    Google Scholar 

  5. Zomaya, A.Y., Teh, Y.H.: Observations on using genetic algorithms for dynamic load-balancing. IEEE Trans. Parallel Distrib. Syst. 12(9), 899–911 (2001)

    Article  Google Scholar 

  6. Michael, R.G., David, S.J.: Computers and Intractability: A Guide to the Theory of NP-Completeness, pp. 90–91. WH Free. Co., San Fr (1979)

    Google Scholar 

  7. Brent, R.P.: Efficient implementation of the first-fit strategy for dynamic storage allocation. ACM Trans. Programm. Lang. Syst. (TOPLAS) 11(3), 388–403 (1989)

    Article  Google Scholar 

  8. Nurmi, D., Wolski, R., Grzegorczyk, C., Obertelli, G., Soman, S., Youseff, L., Zagorodnov, D.: The eucalyptus open-source cloud-computing system. In: Proceedings of the 2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid, pp. 124–131, May, 2009. IEEE Computer Society

    Google Scholar 

  9. Kennedy, J., Eberhart, R.: Particle swarm optimization. In: IEEE International Conference on Neural Networks, pp. 1942–1948 (1995)

    Google Scholar 

  10. Mondal, B., Dasgupta, K., Dutta, P.: Load balancing in cloud computing using stochastic hill climbing-a soft computing approach. Procedia Technol. 4, 783–789 (2012)

    Article  Google Scholar 

  11. Hsu, Y.C., Liu, P., Wu, J.J.: Job sequence scheduling for cloud computing. In: 2011 International Conference on Cloud and Service Computing (CSC), pp. 212–219. IEEE (2011)

    Google Scholar 

  12. Agarwal, M., Srivastava, G.M.S.: A cuckoo search algorithm-based task scheduling in cloud computing. In: Advances in Computer and Computational Sciences, pp. 293–299. Springer, Singapore (2018)

    Google Scholar 

  13. Shi, Y., Eberhart, R.C.: Empirical study of particle swarm optimization. In: Proceedings of the 1999 Congress on Evolutionary Computation, 1999. CEC 99, vol. 3, pp. 1945–1950. IEEE (1999)

    Google Scholar 

  14. Agarwal, M., Srivastava, G.M.S.: A genetic algorithm inspired task scheduling in cloud computing. In: The Proceedings of 2nd IEEE Conference on Computing, Communication and Automation 2016 (2016)

    Google Scholar 

  15. Calheiros, R.N., Ranjan, R., Beloglazov, A., De Rose, C.A., Buyya, R.: CloudSim: a toolkit for modeling and simulation of cloud computing environments and evaluation of resource provisioning algorithms. Softw. Pract. Exp. 41(1), 23–50 (2011)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Mohit Agarwal .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Agarwal, M., Srivastava, G.M.S. (2019). A PSO Algorithm-Based Task Scheduling in Cloud Computing. In: Ray, K., Sharma, T., Rawat, S., Saini, R., Bandyopadhyay, A. (eds) Soft Computing: Theories and Applications. Advances in Intelligent Systems and Computing, vol 742. Springer, Singapore. https://doi.org/10.1007/978-981-13-0589-4_27

Download citation

Publish with us

Policies and ethics