IMPROVED RESOURCE AWARE HYBRID META-HEURISTIC ALGORITHM FOR TASK SCHEDULING IN CLOUD ENVIRONMENT
DOI:
https://doi.org/10.26438/ijcse/v6i10.705711Keywords:
ACO, PSO, VM, Data Centre, Cloud Computing, Cloud, Meta-Heuristic, NIC, Makespan, Response time,, Transfer costAbstract
Popularity of services over cloud can be estimated from the fact that all major mobile and computer system manufacturers are providing free cloud services to their client on purchase of their product. Easy and fast access to internet services have resulted in increased usage of cloud infrastructure. Also, the amount of data being generated and shared over cloud has increased multi-folds. With ever increasing users, resource provider is aware that they cannot afford wastage or misutilization of its resources. Hence, selection of right resource for fulfilling the request of the customer is vital. Scheduling of tasks over cloud is a key research area. Meta-Heuristic algorithms provide efficient solution to this problem. But, each metaHeuristic algorithm individually suffers from inherent draw backs. So, there is a need to design a scheduling algorithm that does not suffer from the inherent draw backs of any individual meta-heuristic algorithm and is aware of the current utilization of resources in the cloud. In this paper, an improved resource aware hybrid meta-heuristic scheduling algorithm has been designed which reduces the overall Makespan time, Transfer cost and Response time. It also takes into consideration the current utilization of resources in the cloud.
References
[1] M. Kalra, S. Singh, “A review of metaheuristic scheduling technique in cloud computing”, Cairo University, Egyptian Informatics Journal, Vol. 16, issue 3, pp 275-295, 2015.
[2] Karger D, Stein C, Wein J, “Scheduling Algorithms. Algorithms and Theory of Computation Handbook”. Chapman & Hall/CRC, p 20, 2010.
[3] Talbi E. G., “Metaheuristics: From Design to Implementation”, Wiley, Canada, p 593, 2009.
[4] V. Behal, A. Kumar, “Comparative Study of Load Balancing Algorithms in Cloud Environment using Cloud Analyst”, International Journal of Computer Applications (0975 – 8887) Volume 97– No.1, July 2014.
[5] G. Singh, A. Kaur, “Bio Inspired Algorithms: An Efficient Approach for Resource Scheduling in Cloud Computing”, International Journal of Computer Applications (0975–8887) Volume 116, No. 10, April 2015.
[6] S. Selvaraj, J. Jaquline, “Ant Colony Optimization Algorithm for Scheduling Cloud Tasks”, International Journal of Computer Technology & Applications, Vol 7(3), pp 491-494, May-June 2016.
[7] A. Singh, D. Juneja, M. Malhotra, “Autonomous Agent Based Load Balancing Algorithm in Cloud Computing”, In the proceedings of 2015 ELSEVIER Procedia Computer Science International Conference on Advanced Computing Technologies and Applications (ICACTA- 2015), At Mumbai, India, Vol. 45, pp 832-841, 2015.
[8] J. Thaman, M. Singh, “Current Perspective in Task Scheduling Techniques in cloud Computing: A Review”, International Journal in Foundations of Computer Science & Technology (IJFCST) Vol. 6, No. 1, January 2016.
[9] M. Tawfeek, A. El-Sisi, A. Keshk, F. Torkey, “Cloud Task Scheduling Based on Ant Colony Optimization” , The International Arab Journal of Information Technology, Vol. 12, No. 2, March 2015.
[10] N. Siddique, H. Adeli, “Nature Inspired Computing: An Overview and Some Future Directions”, Cognitive Computing, Vol. 7, Issue 6, pp 706-714, 2015.
[11] D. Gupta, H.J.S. Sidhu, "Hybrid Task Scheduling Algorithm Based on ANT Colony Optimization and Particle Swarm Optimization for Cloud Environment", International Journal of Computer Sciences and Engineering (2347-2693), Vol. 6, Issue. 2, pp. 324-328, 2018.
[12] J. Kennedy, R. Eberhart, “Particle swarm optimization” In proceedings of IEEE International Conference on Neural Networks, vol. 4, pages 1942–1948, 1995.
[13] Guo L, Zhao S, Shen S, Jiang C, “Task scheduling optimization in cloud computing based on heuristic Algorithm”. Journal of Networks, Vol 7, pp. 547–553, 2012
[14] Dorigo M. and Stützle T., “Ant colony optimization”. MIT Press; 319 p, 2014.
Downloads
Published
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors contributing to this journal agree to publish their articles under the Creative Commons Attribution 4.0 International License, allowing third parties to share their work (copy, distribute, transmit) and to adapt it, under the condition that the authors are given credit and that in the event of reuse or distribution, the terms of this license are made clear.
