Genetic-Based Task Scheduling Algorithm with Dynamic Virtual Machine Generation in Cloud Computing
Keywords:task scheduling, makespan, virtualization, virtual machine, dynamic creation
Recently, cloud computing has become the most common platform in the computing world. scheduling is one of the most important mechanism for managing cloud resources. Scheduling mechanism is a mechanism for scheduling user tasks among datacenters, host and virtual machines (VMs) and is an NP completeness problem. Most of existing mechanisms are heuristic and meta-heuristic methods, developed to address a part of scheduling problem and did not consider the dynamic creation of VMs by taking into account the required resources for a user task and the capabilities of a set of available hosts. To deal with this dynamic behavior, this paper introduces a new mechanism that uses a genetic algorithm (GA) for establishing a flexible scheduling mechanism that can adapt the dynamic number of VMs based on the required resources by user tasks and the available resources of hosts. Simulation results show that the proposed algorithm can distribute any number of user tasks on the available resources and it achieves better performance than existing algorithms in terms of response time, makespan, FlowTime, throughput, and resource utilization.
W. T. Tsai, X. Sun, and J. Balasooriya, “Service oriented cloud computing architecture,” Proceedings of the Seventh International Conference on Information Technology: New Generations, Las Vegas, NV, USA, April 12-14, 2010, pp. 684-689, https://doi.org/10.1109/ITNG.2010.214.
B. Furht, A. Escalante, Handbook of cloud computing, Springer, 2010, 655 p. https://doi.org/10.1007/978-1-4419-6524-0.
D. Sullivan, “The definitive guide to cloud computing,” Real Time Nexus, pp. 4-11, 2010.
G. Soni and M. Kalra, “A novel approach for load balancing in cloud data center,” Proceedings of the International Advance Computing Conference (IACC), Gurgaon, India, Feb 21-22, 2014, pp. 807-812, https://doi.org/10.1109/IAdCC.2014.6779427.
Y. Jadeja and K. Modi. “Cloud computing – concepts, architecture and challenges,” Proceedings of the International Conference on Computing, Electronics and Electrical Technologies (ICCEET), Kumaracoil, India, March 21-22, 2012, pp. 877-880, https://doi.org/10.1109/ICCEET.2012.6203873.
S. H. H. Madni, M. S. Abd Latiff, Y. Coulibaly, and S. M. Abdulhamid, “Resource scheduling for infrastructure as a service (IAAS) in cloud computing: Challenges and opportunities,” Journal of Network and Computer Applications, vol. 68, pp. 173-200, 2016, https://doi.org/10.1016/j.jnca.2016.04.016.
B. A. Hridita, M. Irfan, and M. S. Islam, “Task allocation for mobile cloud computing: State-of-the art and open challenges,” Proceedings of the 5th International Conference on Informatics, Electronics and Vision (ICIEV), Dhaka, Bangladesh, May 13-14, 2016, pp. 752–757, https://doi.org/10.1109/ICIEV.2016.7760102.
H. Shoja, H. Nahid, and R. Azizi, “A comparative survey on load balancing algorithms in cloud computing,” Proceedings of the Fifth International Conference on Computing, Communications and Networking Technologies (ICCCNT), Hefei, China, July1-13, 2014, pp. 1–5, https://doi.org/10.1109/ICCCNT.2014.6963138.
S. Sindhu and S. Mukherjee, “Efficient task scheduling algorithms for cloud computing environment,” Proceedings of the International Conference on High Performance Architecture and Grid Computing, Chandigarh, India, July 19-20, 2011, pp. 79–83, https://doi.org/10.1007/978-3-642-22577-2_11.
C. Zhao, S. Zhang, Q. Liu, J. Xie, and J. Hu, “Independent tasks scheduling based on genetic algorithm in cloud computing,” Proceedings of the 5th International Conference on Wireless Communications, Networking and Mobile Computing, Beijing, China, September 24-26, 2009, pp.1–4, https://doi.org/10.1109/WICOM.2009.5301850.
M. Kalra and S. Singh, “A review of metaheuristic scheduling techniques in cloud computing,” Egyptian Informatics Journal, vol. 16, issue 3, pp. 275–295, 2015, https://doi.org/10.1016/j.eij.2015.07.001.
R.K. Jena, “Multi objective task scheduling in cloud environment using nested PSO framework,” Proceedings of the 3rd International Conference on Recent Trends in Computing 2015 (ICRTC-2015), 2015, pp. 1219–1227, https://doi.org/10.1016/j.procs.2015.07.419.
M. A. Tawfeek, A. El-Sisi, A. E. Keshk, and F. A. Torkey, “Cloud task scheduling based on ant colony optimization,” Proceedings of the 8th International Conference on Computer Engineering Systems (ICCES), Cairo, Egypt, November 26-28, 2013, pp. 64–69, https://doi.org/10.1109/ICCES.2013.6707172.
V. M. Arul Xavier and S. Annadurai, “Chaotic social spider algorithm for load balance aware task scheduling in cloud computing,” Cluster Computing, vol. 22, issue 1, pp. 287-297, 2018, https://doi.org/10.1007/s10586-018-1823-x.
K. Naik, G. Meera Gandhi, S. H. Patil, “Multiobjective virtual machine selection for task scheduling in cloud computing,” in: N. K. Verma, A. K. Ghosh (Eds), Computational Intelligence: Theories, Applications and Future Directions, Springer Singapore, Singapore, 2019, pp. 319-331, https://doi.org/10.1007/978-981-13-1132-1_25.
M. A. Alworafi, A. Dhari, S. A. ElBooz, A. A. Nasr, A. Arpitha, S. Mallappa, “An enhanced task scheduling in cloud computing based on hybrid approach,” in: P. Nagabhushan, D. S. Guru, B. H. Shekar, Y. H. Sharath Kumar (Eds), Data Analytics and Learning, Springer Singapore, Singapore, 2019, pp. 11–25, https://doi.org/10.1007/978-981-13-2514-4_2.
J. Gu, J. Hu, T. Zhao, G. Sun, “A new resource scheduling strategy based on genetic algorithm in cloud computing environment,” Journal of Computers, vol. 7, issue 1, pp. 42–52, 2012, https://doi.org/10.4304/jcp.7.1.42-52.
M. A. Tawfeek, A. B. El-Sisi, A. E. Keshk, and F. A. Torkey, “Virtual machine placement based on ant colony optimization for minimizing resource wastage,” Proceedings of the International Conference on Advanced Machine Learning Technologies and Applications, Cairo, Egypt, March 28-30, 2014, pp. 153–164, https://doi.org/10.1007/978-3-319-13461-1_16.
S. K. Sonkar and M. U. Kharat, “A review on resource allocation and vm scheduling techniques and a model for efficient resource management in cloud computing environment,” Proceedings of the International Conference on ICT in Business Industry Government (ICTBIG), Indore, India, November 18-19, 2016, pp. 1–7, https://doi.org/10.1109/ICTBIG.2016.7892646.
B. Pavithra and R. Ranjana, “A comparative study on performance of energy efficient load balancing techniques in cloud,” Proceedings of the International Conference on Wireless Communications, Signal Processing and Networking (WiSPNET), Chennai, India, March 23-25, 2016, pp. 1192-1196, https://doi.org/10.1109/WiSPNET.2016.7566325.
Y. Fang, F. Wang, and J. Ge, “A task scheduling algorithm based on load balancing in cloud computing,” in: F.-L. Wang, Z. Gong, X. Luo, and J. Lei (Eds), Web Information Systems and Mining, Springer Berlin Heidelberg, 2010, pp. 271–277, https://doi.org/10.1007/978-3-642-16515-3_34.
A. A. Nasr, N. A. El-Bahnasawy, G. Attiya, A. El-Sayed, “Using the tsp solution strategy for cloudlet scheduling in cloud computing,” Journal of Network and Systems Management, vol. 27, issue 2, pp. 366–387, 2019, https://doi.org/10.1007/s10922-018-9469-9.
A. Beloglazov, C. A. F. De Rose, R. Buyya, R. N. Calheiros, R. Ranjan, “Cloudsim: a toolkit for modeling and simulation of cloud computing environments and evaluation of resource provisioning algorithms,” Software: Practice and Experience, vol. 41, issue 1, pp. 23–50, 2011, https://doi.org/10.1002/spe.995.
How to Cite
LicenseInternational Journal of Computing is an open access journal. Authors who publish with this journal agree to the following terms:
• Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
• Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
• Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.