Abstract
This article focuses on clustering tasks, normalization of multiple parameters under consideration and applying normalized adaptive league championship algorithm (NALCA) for minimization of makespan of tasks. Minimization of processing time and optimum resource utilization are fundamental requirements of any computing service provider. Scheduling performs crucial role in managing processing capabilities and resource utilization. Clustering is applied so that tasks are divided into various clusters and then scheduling is applied. In order to make comparative analysis of clustering, three clustering algorithms are implemented to have statistical details after applying each clustering algorithm. After experimentation it has been found out that hierarchical clustering with equal opportunity model with normalization LCA has gained outstanding performance enhancements.
Similar content being viewed by others
REFERENCES
A. Bhole, B. Adinarayana, and S. Shenoy, “Log analytics on cloud using pattern recognition a practical perspective to cloud based approach,” in Int. Conf. on Green Computing and Internet of Things (ICGCIoT), Greater Noida, India, 2015 (IEEE, 2015), pp. 699–703. https://doi.org/10.1109/ICGCIoT.2015.7380553
R. P. Bunker and F. Thabtah, “A machine learning framework for sport result prediction,” Appl. Comput. Inf. 15, 27–33 (2019). https://doi.org/10.1016/j.aci.2017.09.005
Z. G. Chen, K. J. Du, Z. H. Zhan, and J. Zhang, “Deadline constrained cloud computing resources scheduling for cost optimization based on dynamic objective genetic algorithm,” in IEEE Congress on Evolutionary Computation (CEC), Sendai, Japan, 2015 (IEEE, 2015), pp. 708–714. https://doi.org/10.1109/CEC.2015.7256960
T. Davig and A. S. Hall, “Recession forecasting using Bayesian classification,” Int. J. Forecast. 35, 848–867 (2019). https://doi.org/10.1016/j.ijforecast.2018.08.005
K. G. Dhal, A. Das, J. Gálvez, S. Ray, and S. Das, “An overview on nature-inspired optimization algorithms and their possible application in image processing domain,” Pattern Recognit. Image Anal. 30, 614–631 (2020). https://doi.org/10.1134/S1054661820040100
K.G. Dhal and S. Das, “Cuckoo search with search strategies and proper objective function for brightness preserving image enhancement,” Pattern Recognit. Image Anal. 27, 695–712 (2017). https://doi.org/10.1134/S1054661817040046
P. Dhamija, R. Nandal, and H. Sehrawat, “A review paper on prediction analysis: predicting student result on the basis of past result,” Int. J. Eng. Technol. 9, 1204–1207 (2017). https://doi.org/10.21817/ijet/2017/v9i2/170902226
A. Gade, M.N. Bhat, and N. Thakare, “Adaptive league championship algorithm (ALCA) for independent task scheduling in cloud computing,” Ing. Syst. Inf. 24, 353–359 (2019). https://doi.org/10.18280/isi.240316
J. Ga̧sior and F. Seredyński, “Multi-objective parallel machines scheduling for fault-tolerant cloud systems,” in Algorithms and Architectures for Parallel Processing. ICA3PP 2013, Ed. by J. Kołodziej, B. Di Martino, D. Talia, and K. Xiong, Lecture Notes in Computer Science, vol. 8285 (Springer, Cham, 2013), pp. 247–256. https://doi.org/10.1007/978-3-319-03859-9_21
A. Graefe, “Accuracy of German federal election forecasts, 2013 & 2017,” Int. J. of Forecast. 35, 868–877 (2019). https://doi.org/10.1016/j.ijforecast.2019.01.004
M. Krátký, R. Bača, D. Bednář, J. Walder, J. Dvorský, and P. Chovanec, “Index-based n-gram extraction from large document collections,” in Sixth Int. Conf. on Digital Information Management (ICDIM), Melbourne, 2011 (IEEE, 2011), pp. 73–78. https://doi.org/10.1109/ICDIM.2011.6093324
K. Li, G. Xu, G. Zhao, Y. Dong, and D. Wang, “Cloud task scheduling based on load balancing ant colony optimization,” in Sixth Ann. Chinagrid Conf., Dalian, China, 2011 (IEEE, 2011), pp. 3–9. https://doi.org/10.1109/ChinaGrid.2011.17
X.-F. Liu, Z.-H. Zhan, K.-J. Du, and W.-N. Chen, “Energy aware virtual machine placement scheduling in cloud computing based on ant colony optimization approach,” in Proc. 2014 Ann. Conf. on Genetic and Evolutionary Computation, Vancouver, Canada, 2014, Ed. by C. Igel (Assoc. for Computing Machinery, New York, 2014), pp. 41–48. https://doi.org/10.1145/2576768.2598265
K. S. Qaddoum, N. N. El Emam, and M. A. Abualhaj, “Elastic neural network method for load prediction in cloud computing grid,” Int. J. Electr. Comput. Eng. 9, 1201–1208. https://doi.org/10.11591/ijece.v9i2.pp1201-1208
M. A. Shafi’i, M. S. Abd Latiff, G. A. Salaam, and S. H. H. Madni, “Secure scientific applications scheduling technique for cloud computing environment using global league championship algorithm,” PLoS ONE 11, e0158102 (2016). https://doi.org/10.1371/journal.pone.0158102
V. Sharma and P. Sharma, “Pattern recognition based scheduling in cloud computing,” 2, Int. J. Technol. Comput. pp. 397–401.
B. Song, Y. Yu, Y. Zou, Z. Wang, and S. Du, “Host load prediction with long short-term memory in cloud computing,” J. Supercomput. 74, 6554–6568 (2017). https://doi.org/10.1007/s11227-017-2044-4
The NASA Ames iPSC/860 log by CS Huji labs parallel workload.
W. Zhong, Y. Zhuang, J. Sun, and J. Gu, “A load prediction model for cloud computing using PSO-based weighted wavelet support vector machine,” Appl. Intell. 48, 4072–4083 (2018). https://doi.org/10.1007/s10489-018-1194-2
ACKNOWLEDGMENTS
The authors would like to express thanks to both the research supervisors Dr. M. Nirupama Bhat and Dr. Neeta Thakre for their time to guidance and motivation. Also, they express their gratitude towards Head of Computer Science and Engineering Department (VFSTR) Prof. Dr. Venkatesulu Dondeti for his support and cooperation.
Author information
Authors and Affiliations
Corresponding authors
Ethics declarations
COMPLIANCE WITH ETHICAL STANDARDS
This article is a completely original work of its authors; it has not been published before and will not be sent to other publications until the PRIA Editorial Board decides not to accept it for publication.
Conflict of Interest
The process of writing and the content of the article do not give grounds for raising the issue of a conflict of interest.
Additional information
Anup Gade is a research scholar in the Department of Computer Science and Engineering in Vignan’s Foundation for Science, Technology and Research (Deemed to be University), Vadlamudi, AP, India. He has completed his Master of Engineering (M.E.) in Computer Science (2014) from RGPV, Bhopal. His area of research is cloud computing and to mentioned precisely task scheduling in cloud computing. He is working from past 12 years in as an Assistant Professor. He has published more than 10 articles in the various journals.
M. Nirupama Bhat Mundukur is working as Professor in the Department of Computer Science and Engineering in Vignan’s Foundation for Science, Technology and Research (Deemed to be University), Vadlamudi, AP, India. She completed her PhD in Computer Science (2015) from Sri Padmavati Mahila ViswaVidyalayam, Tirupati, India. She has more than 20 years of academic experience and over 10 years of research. She published over 25 research papers in various National and International Journals and Conferences. Currently, she is working in the areas of cryptography, cloud computing, and data analytics.
Neeta Thakare is working as an Associate Professor at Piryadarshani College of Engineering, Nagpur, MS, India. She has completed her PhD in Computer Science and Engineering from Sant Gadge Baba Amravati University, Amravati. She has 24 years of experience in the field of academics. She has published more than 15 research articles in journal of national and international repute. She has authored 1 book titled as Step by Step: Object Oriented Programming using C++. Her book on data structure: An Algorithmic Approach and Implementation Using Python is in process of publication.
Rights and permissions
About this article
Cite this article
Anup Gade, Bhat, M.N. & Thakare, N. Task Pattern Identification and Scheduling Using Equal Opportunity Model for Minimization of Makespan and Task Diversity in Cloud Computing. Pattern Recognit. Image Anal. 32, 67–77 (2022). https://doi.org/10.1134/S1054661821040088
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S1054661821040088