Energy-aware task scheduling in cloud compting based on discrete pathfinder algorithm

Document Type : Original Article

Authors

Department of Computer Science, Shahid Bahonar University of kerman, Kerman, Iran

Abstract

Task scheduling is one of the fundamental issues that attract the attention of lots of researchers to enhance cloud performance and consumer satisfaction. Task scheduling is an NP–hard problem that is challenging due to the several conflicting objectives of users and service providers. Therefore, meta-heuristic algorithms are the more preferred option for solving scheduling problems in a reasonable time. Although many task scheduling algorithms are proposed, existing strategies mainly focus on minimizing makespan or energy consumption while ignoring other performance factors. In this paper, we propose a new task scheduling algorithm based on the Discrete Pathfinder Algorithm (DPFA) that is inspired by the collective movement of the animal group and mimics the guidance hierarchy of swarms to find hunt. The proposed scheduler considers five objectives (i.e., makespan, energy consumption, throughput, tardiness, and resource utilization) as cost functions. Finally, different algorithms such as Firefly Algorithm (FA), Particle Swarm Optimization (PSO), Grasshopper Optimization Algorithm (GOA), and Bat Algorithm (BA), are used for comparison. The experimental results indicate that the proposed scheduling algorithm can improve up to 9.16%, 38.44%, 3.59%, and 3.44% the makespan in comparison with FA, BA, PSO, and GOA, respectively. Moreover, the results show dramatic improvements in terms of resource utilization, throughput, and energy consumption.

Keywords

References

  1. P, Hao. Y, Toshev. R, and Boldosova. V, “Cloud manufacturing ecosystem analysis and design”, Robotics and Computer Integrated Manufacturing, (2021), doi:10.1016/j.rcim.2020.102050.
  2. Mohammad Hasani zade. B, Mansouri. N, and Javidi. MM, “Multi-objective scheduling technique based on hybrid hitchcock bird algorithm and fuzzy signature in cloud computing”, Engineering Applications of Artificial Intelligence, 104, (2021), doi: 10.1016/j.engappai.2021.104372.
  3. N, “An effective weighted data replication strategy for data Grid”, Australian Journal of Basic and Applied Sciences, Vol. 6, No. 10, (2012), 336-346.
  4. B, Wang. Ch , Huang. W, Song. Y, and Qin. X, “Security-aware task scheduling with deadline constraints on heterogeneous hybrid clouds”, Journal of Parallel and Distributed Computing, Vol. 153, (2021), 15-28, doi: 10.1016/j.jpdc.2021.03.003.
  5. XS, “Firefly algorithms for multimodal optimization”, Stochastic Algorithms: Foundations and Applications, (2009), 169-178, doi: 10.1007/978-3-642-04944-6_14.
  6. J, and Eberhart. RC, “Particle swarm optimization”, IEEE International Conference on Neural Networks (Perth, Australia), Piscataway, Vol. 5, (1995), 1942-1948, doi: 10.1007/s11721-007-0002-0.
  7. XS, “A new metaheuristic bat-inspired algorithm”, Studies in Computational Intelligence, Vol. 284, (2010), 65-74. https://doi.org/10.1007/978-3-642-12538-6_6.
  8. S, Mirjalili. S, and Lewis. A, “Grasshopper optimisation algorithm: theory and application”, Advances in Engineering Software, Vol. 105, (2017), 30-47, doi: 10.1016/j.advengsoft.2017.01.004.
  9. Nicolas. A, Rafael. R, David. F, and Raul. P, “A discrete firefly algorithm for solving the flexible job-shop scheduling problem in a make-to-order manufacturing system”, Central European Journal of Operations Research, (2020), doi: 10.1007/s10100-020-00701-w.
  10. M, and Sharma. SC, “PSO-based novel resource scheduling technique to improve QoS parameters in cloud computing”, Neural Computing and Applications, Vol. 32, (2020), 12103-12126, doi: 10.1007%2Fs00521-019-04266-x.
  11. N, Ghafari. R, and Mohammad Hasani Zade B, “Cloud computing simulators: A comprehensive review”, Simulation Modelling Practice and Theory, Vol. 104, (2020), doi: 10.1016/j.simpat.2020.102144.
  12. MB, Bargh. SH, Hosseinabadi. AAR, and Slowik. A, “An improved bat optimization algorithm to solve the tasks scheduling problem in open shop”, Neural Computing and Applications, Vol. 33, (2021), 1559-1573, doi: 10.1007/s00521-020-05055-7.
  13. M, and Srivastava. GMS, “A PSO algorithm-based task scheduling in cloud computing”, International Journal of Applied Metaheuristic Computing (IJAMC), Vol. 10, (2019), doi: 10.4018/IJAMC.2019100101.
  14. Raju. YHP,  and Devarakonda. N, “Greedy-based PSO with clustering technique for cloud task scheduling”, Proceedings of International Conference on Computational Intelligence and Data Engineering, (2021), 133-141, doi: 10.1007/978-981-15-8767-2_12.
  15. SMS, Krishnamoorthy. P, Soubraylu. S, Venugopal. And JK, Marimuthu. K, “An efficient task scheduling using GWO-PSO algorithm in a cloud computing environment”, Proceedings of International Conference on Intelligent Computing, Information and Control Systems, (2021), 751-761, doi: 10.1007/978-981-15-8443-5_64.
  16. H, Rafsanjani. MK, Balas VE., “Multi-task scheduling algorithm based on self-adaptive hybrid ICA–PSO algorithm in cloud environment”, Soft Computing Applications, (2021), 422-431, doi: 10.1007/978-3-030-52190-5_30.
  17. KK, Shyamala. L, Vaidehi. V, “Cost-effective workflow scheduling approach on cloud under deadline constraint using firefly algorithm”, Applied Intelligence, Vol. 51, (2021), 1629-1644, doi: 10.1007/s10489-020-01875-1.
  18. I, and Mann. PS, “A hybrid cost-effective genetic and firefly algorithm for workflow scheduling in cloud”, International Conference on Innovative Computing and Communications, (2021), doi: 10.1007/978-981-15-5148-2_4.
  19. Rajagopalan A, Modale. DR, and Senthilkumar. R, “Optimal scheduling of tasks in cloud computing using hybrid firefly-genetic algorithm”, Advances in Decision Sciences, Image Processing, Security and Computer Vision, (2020), 678-687, doi: 10.1007/978-3-030-24318-0_77.
  20. A, Nor. SM, Abdullah. AH, and Bashir. MB, “A discrete firefly algorithm for scheduling jobs on computational grid”, Studies in Computational Intelligence, (2014), 271-290, doi: 10.1007/978-3-319-02141-6_13.
  21. T , Zivkovic. M , Tuba. E , Strumberger. I , Bacanin. N, and Tuba. M, “Multi-objective task scheduling in cloud computing environment by hybridized bat algorithm”, Advances in Intelligent Systems and Computing, (2021), 718-725, doi: 10.1007/978-3-030-51156-2_83.
  22. Zhou Zh, Li. F, Zhu. H, and Xie. H, Abawajy. JH, Chowdhury M U., “An improved genetic algorithm using greedy strategy toward task scheduling optimization in cloud environments”, Neural Computing and Applications, V32, (2020), 1531-1541, doi: 10.1007/s00521-019-04119-7.
  23. M, and Kamisli. OZ, “Multi-objective Solution Approaches for Employee Shift Scheduling Problems in Service Sectors”, International Journal of Engineering, Trnsactions C: Aspects, Vol. 32, (2019), 1312-1319, doi: 10.5829/ije.2019.32.09c.12.
  24. Y, and Budati C, “Energy-aware workflow scheduling and optimization in clouds using bat algorithm”, Future Generation Computer Systems, Vol. 113, (2020), 106-112, doi: 10.1016/j.future.2020.06.031.
  25. M, Amgoth. T, and Srirama. SN, “Multi-objective scheduling strategy for scientific workflows in cloud environment a firefly-based approach,” Applied Soft Computing Journal, Vol. 93, (2020), doi: 10.1016/j.asoc.2020.106411.
  26. SuS, and Yu. H, “Minimizing tardiness in data aggregation scheduling with due date consideration for single-hop wireless sensor networks”, Wireless Networks, Vol. 21, (2015), 1259-1273, doi: 10.1007/s11276-014-0853-4.
  27. DE, and Bayhan. GM, “Multi-machine earliness and tardiness scheduling problem: an interconnected neural network approach”, The International Journal of Advanced Manufacturing Technology , Vol. 37, (2008), 576-588, doi: 10.1007/s00170-007-0993-0.
  28. M, and Sharma. SC, “PSO-COGENT: Cost and energy efficient scheduling in cloud environment with deadline constraint”, Sustainable Computing: Informatics and Systems, Vol. 19, (2018), 147-164, doi: 10.1016/j.suscom.2018.06.002.
  29. H, and Cetinkaya. N, “A new meta-heuristic optimizer: pathfinder algorithm”, Applied Soft Computing Journal, Vol. 78, (2019), 545-568, doi: 10.1016/j.asoc.2019.03.012.
  30. MA, and Attiya. I, “An improved henry gas solubility optimization algorithm for task scheduling in cloud computing”, Artificial Intelligence Review, (2020), doi: 10.1007/s10462-020-09933-3.
  31. MR, Panda. S, Priyadarshini. R, and Das. P, “Mobile robot path-planning using oppositional-based improved firefly algorithm under cluttered environment”, Advances in Intelligent Computing and Communication, (2020), doi: 10.1007/978-981-15-2774-6_18.
  32. Y, Ren. X, Du. F, and Shi. J, “Application of improved PSO algorithm in hydraulic pressing system identification”, Journal of Iron and Steel Research, International, Vol. 19, (2012), 29-35, doi: 10.1016/S1006-706X(13)60005-9.
  33. X, Zhou. L, Deng. X, Wang. B, Qiu. C, Lu. M, and Li. C, “A resource allocation scheme based on improved bat algorithm for D2D communication system”, International Conference in Communications, Signal Processing, and Systems CSPS 2018: Communications, Signal Processing, and Systems, Vol. 515, (2019), 852-861, doi: 10.1007/978-981-13-6264-4_100.
  34. B, Wang. Z, and Zou. L, “An improved PSO algorithm for smooth path planning of mobile robots using continuous high-degree bezier curve”, Applied Soft Computing Journal, Vol. 100, (2021), doi: 10.1016/j.asoc.2020.106960.
  35. J, Chen. H, Zhang. Q, Xu. Y, Huang. H, and Zhao. X, “An improved grasshopper optimization algorithm with application to financial stress prediction”, Applied Mathematical Modelling, Vol. 64, (2018), 654-668, doi: 10.1016/j.apm.2018.07.044.
International Journal of Engineering
Volume 34, Issue 9
TRANSACTIONS C: Aspects
September 2021
Pages 2124-2136

Files

Cited by

Share

How to cite

Statistics