A hybrid algorithm based on Gossip architecture using SVM for task scheduling in cloud computing

Document Type : Original Article

Authors

1 Department of Computer Engineering, Islamic Azad University, Ardabil Branch, Ardabil, Iran.

2 Young and Elite Researchers Club, Islamic Azad University, Ardabil Branch, Ardabil, Iran.

Abstract

Nowadays, Cloud computing is very important due to its widespread use. The considerable extensiveness and flexibility of cloud computing as well as other advantages led to new challenges such as reliability. Such challenges have more importance among researchers because of existing high number of cloud users. To solve the challenge of reliability, a variety of fault tolerance algorithms were provided in recent years to deal with and fix faults in cloud computing. Despite many efforts, there still exist some problems. This paper aims to present an efficient and new hybrid algorithm where SVM features, and Gossip protocol are used. SVM is used to analyze and categorize virtual machine data based on behavioral patterns. Moreover, Gossip is used to gather data monitoring categories. In the proposed model, processing time, load amount, and reliability are evaluated for better service quality. The simulation results through the CloudSim tools show that proposed method is able to increase the processing speed around 0.65 and decrease makespan to 7.22 seconds.

Keywords

References

[1] Buyya R., Yeo C. S., Venugopal S., Broberg J., and Brandic I., “Cloud computing and emerging IT platforms: Vision, hype, and reality for delivering computing as the 5th utility,” Future Generation Computer Systems 25(6): 599-616, 2009.
[2] Chawla Y. and Bhonsle M., “A Study on Scheduling Methods in Cloud Computing,” International Journal of Emerging Trends & Technology in Computer Science (IJETTCS), pp. 12-17, 2012. 
[3] Awada A. I., El-Hefnawya N. A., Abdel_kader H. M., “Enhanced Particle Swarm Optimization For Task Scheduling In Cloud Computing Environments,” Procedia Computer Science, 65: 920-929, 2015. 
[4] Suma V. and Chintureena T., “Improving Reliability in Cloud Computing Systems,” Advanced Computing and Communication Techniques for High Performance Applications (ICACCTHPA), pp. 10-13, 2014. 
[5] Tang X., Li K., Qiu M., and Sha E. H.-M., “A hierarchical reliability-driven scheduling algorithm in grid systems,” J. Parallel Distrib. Comput., 72(4): 525-535, 2012. 
[6] اسداللهی ا.، اصغری س.ا.، «پیش‌بینی تعداد مناسب ماشین‌های مجازی بر اساس سری زمانی و روش‌های هوشمند مبتنی بر خوشه‌بندی ماشین‌های مجازی»، مجله محاسبات نرم، جلد 6، شماره 1، ص 66-77، 1396.
[7] قبائی‌ارانی م.، مهدی‌بابایی ف.، «رویکرد تخصیص منبع کارا برای پردازش داده‌های حوزه سلامت در محیط رایانش ابری»، مجله محاسبات نرم، جلد 8، شماره 2، ص 80-101، 1398.
[8] خراسانی فردوانی م.، رمضان پور م.، خورسند ر.، «ارائه یک الگوریتم مسیریابی چند مسیره انرژی کارا در سیستم‌های اینترنت اشیاء»، مجله محاسبات نرم، جلد 7، شماره 1، ص 34-49، 1397.
[9] Kumar P. and Vibha K., “Gossip Protocols Applicability in Grid & Cloud Computing,” IJSRD - International Journal for Scientific Research & Development, 2(2): 884-886, 2014. 
[10] Chatterjee M., Mitra A., Setua S. K., and Roy S., “Gossip-based fault-tolerant load balancing algorithm with low communication overhead,” Computers and Electrical Engineering, 81: 106517, 2019. 
[11] Junaid M., Sohail A., Ahmed A., Baz A., Khan I. A., and Alhakami H., “A Hybrid Model for Load Balancing in Cloud Using File Type Formatting,” IEEE ACCESS, 8:118135-118155, 2020. 
[12] Babu L. D. D. and Krishna P. V., “Honey bee behavior inspired load balancing of tasks in cloud computing environments,” Applied Soft Computing, 13(5):2292-2303, 2013. 
[13] Baumann H., Fraigniaud P., Harutyunyan H. A., and de Verclos R. J., “The worst case behavior of randomized gossip protocols,” Theoretical Computer Science, 560: 108-120, 2014.
[14] S. R. Gunn, “Support Vector Machines for Classification and Regression,” University of Southampton Institutional Repository, U.K., 1998.

Files

History

  • Receive Date: 20 October 2020
  • Revise Date: 30 May 2021
  • Accept Date: 11 September 2021

Share

How to cite

Statistics