Skip to main content

Enhanced Flower Pollination Algorithm for Task Scheduling in Cloud Computing Environment

  • Conference paper
  • First Online:
Machine Learning for Predictive Analysis

Part of the book series: Lecture Notes in Networks and Systems ((LNNS,volume 141))

Abstract

Cloud computing technology refers to on-demand access to services, applications, and infrastructure that runs on a distributed network utilizing virtualized resources. In the cloud model, an efficient task scheduling algorithm plays an important role in order to achieve better functioning in general and resource utilization of the cloud. The end-users submit tasks, and the scheduling algorithm needs to allocate them to the available resources on time. Task scheduling issue is considered as NP-hard problems, and metaheuristics algorithms demonstrate high efficiency in solving such problems, thus, in this work, we propose enhanced flower pollination algorithm for the task scheduling. The major focus of this study is to reduce the makespan. We compared the results of the proposed method to other similar approaches, such as PBACO, ACO, Min-Min, and FCFS allocation strategies. The obtained results from the experiment show that the proposed EEFPA scheduler has the potential to allocate submitted tasks by the user to the available resources on the cloud.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 259.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 329.99
Price excludes VAT (USA)
  • Durable hardcover 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

Similar content being viewed by others

References

  1. M. Tuba, N. Bacanin, Improved seeker optimization algorithm hybridized with firefly algorithm for constrained optimization problems. Neurocomputing 143, 197–207 (2014)

    Google Scholar 

  2. M. Tuba, N. Bacanin, Artificial bee colony algorithm hybridized with firefly metaheuristic for cardinality constrained mean-variance portfolio problem. Appl. Math. Inf. Sci. 8, 2831–2844 (2014). November

    MathSciNet  Google Scholar 

  3. I. Strumberger, E. Tuba, N. Bacanin, R. Jovanovic, M. Tuba, Convolutional neural network architecture design by the tree growth algorithm framework, in 2019 International Joint Conference on Neural Networks (IJCNN) (2019 July), pp. 1–8

    Google Scholar 

  4. J. Senthilnath, S. Omkar, V. Mani, Clustering using firefly algorithm: performance study. Swarm Evol. Comput. 1(3), 164–171 (2011)

    Google Scholar 

  5. M. Sayadi, R. Ramezanian, N. Ghaffari-Nasab, A discrete firefly meta-heuristic with local search for makespan minimization in permutation flow shop scheduling problems. Int. J. Ind. Eng. Comput. 1(1), 1–10 (2010)

    Google Scholar 

  6. I. Strumberger, E. Tuba, N. Bacanin, M. Beko, M. Tuba, Wireless sensor network localization problem by hybridized moth search algorithm, in 2018 14th International Wireless Communications Mobile Computing Conference (IWCMC) (2018 June), pp. 316–321

    Google Scholar 

  7. I. Strumberger, M. Minovic, M. Tuba, N. Bacanin, Performance of elephant herding optimization and tree growth algorithm adapted for node localization in wireless sensor networks. Sensors 19(11), 2515 (2019)

    Google Scholar 

  8. N. Bacanin, M. Tuba, R. Jovanovic, Hierarchical multiobjective rfid network planning using firefly algorithm, in 2015 International Conference on Information and Communication Technology Research (ICTRC) (2015 May), pp. 282–285

    Google Scholar 

  9. I. Strumberger, N. Bacanin, M. Tuba, E. Tuba, Resource scheduling in cloud computing based on a hybridized whale optimization algorithm. Appl. Sci. 9(22), 4893 (2019)

    Google Scholar 

  10. N. Bacanin, E. Tuba, T. Bezdan, I. Strumberger, M. Tuba, Artificial flora optimization algorithm for task scheduling in cloud computing environment, in Intelligent Data Engineering and Automated Learning–IDEAL 2019, ed. by H. Yin, D. Camacho, P. Tino, A.J. Tallón-Ballesteros, R. Menezes, R. Allmendinger (Springer International Publishing, Cham, 2019), pp. 437–445

    Google Scholar 

  11. N. Bacanin, T. Bezdan, E. Tuba, I. Strumberger, M. Tuba, M. Zivkovic, Task scheduling in cloud computing environment by grey wolf optimizer, in 2019 27th Telecommunications Forum (TELFOR) (2019), pp. 1–4

    Google Scholar 

  12. X.-S. Yang, Flower pollination algorithm for global optimization, in International Conference on Unconventional Computing and Natural Computation (Springer, 2012), pp. 240–249

    Google Scholar 

  13. I. Gupta, A. Kaswan, P.K. Jana, A flower pollination algorithm based task scheduling in cloud computing, in Computational Intelligence, Communications, and Business Analytics, ed. by J.K. Mandal, P. Dutta, S. Mukhopadhyay (Springer Singapore, Singapore, 2017), pp. 97–107

    Google Scholar 

  14. J. Kennedy, R. Eberhart, Particle swarm optimization, in Proceedings of ICNN’95—International Conference on Neural Networks, vol. 4 (1995), pp. 1942–1948

    Google Scholar 

  15. D.E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, 1st edn. (Addison-Wesley Longman Publishing Co., Inc, Boston, MA, USA, 1989)

    MATH  Google Scholar 

  16. I. Pavlyukevich, Lévy flights, non-local search and simulated annealing. J. Comput. Phys. 226, 1830–1844 (2007)

    MathSciNet  MATH  Google Scholar 

  17. L. Zuo, L. Shu, S. Dong, C. Zhu, T. Hara, A multi-objective optimization scheduling method based on the ant colony algorithm in cloud computing. IEEE Access 3, 2687–2699 (2015)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Timea Bezdan .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Bezdan, T., Zivkovic, M., Antonijevic, M., Zivkovic, T., Bacanin, N. (2021). Enhanced Flower Pollination Algorithm for Task Scheduling in Cloud Computing Environment. In: Joshi, A., Khosravy, M., Gupta, N. (eds) Machine Learning for Predictive Analysis. Lecture Notes in Networks and Systems, vol 141. Springer, Singapore. https://doi.org/10.1007/978-981-15-7106-0_16

Download citation

Publish with us

Policies and ethics