{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T06:23:16Z","timestamp":1776752596736,"version":"3.51.2"},"reference-count":41,"publisher":"MDPI AG","issue":"5","license":[{"start":{"date-parts":[[2021,5,9]],"date-time":"2021-05-09T00:00:00Z","timestamp":1620518400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers"],"abstract":"<jats:p>Recently, there has been significant growth in the popularity of cloud computing systems. One of the main issues in building cloud computing systems is task scheduling. It plays a critical role in achieving high-level performance and outstanding throughput by having the greatest benefit from the resources. Therefore, enhancing task scheduling algorithms will enhance the QoS, thus leading to more sustainability of cloud computing systems. This paper introduces a novel technique called the dynamic round-robin heuristic algorithm (DRRHA) by utilizing the round-robin algorithm and tuning its time quantum in a dynamic manner based on the mean of the time quantum. Moreover, we applied the remaining burst time of the task as a factor to decide the continuity of executing the task during the current round. The experimental results obtained using the CloudSim Plus tool showed that the DRRHA significantly outperformed the competition in terms of the average waiting time, turnaround time, and response time compared with several studied algorithms, including IRRVQ, dynamic time slice round-robin, improved RR, and SRDQ algorithms.<\/jats:p>","DOI":"10.3390\/computers10050063","type":"journal-article","created":{"date-parts":[[2021,5,9]],"date-time":"2021-05-09T21:32:46Z","timestamp":1620595966000},"page":"63","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":49,"title":["Enhanced Round-Robin Algorithm in the Cloud Computing Environment for Optimal Task Scheduling"],"prefix":"10.3390","volume":"10","author":[{"given":"Fahd","family":"Alhaidari","sequence":"first","affiliation":[{"name":"Networks and Communications Department, College of Computer Science and Information Technology, Imam Abdulrahman Bin Faisal University, P.O. Box 1982, Dammam 31441, Saudi Arabia"}]},{"given":"Taghreed Zayed","family":"Balharith","sequence":"additional","affiliation":[{"name":"Computer Science Department, College of Science and Humanities, Imam Abdulrahman Bin Faisal University, P.O. Box 12020, Jubail 31961, Saudi Arabia"}]}],"member":"1968","published-online":{"date-parts":[[2021,5,9]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Razaque, A., Vennapusa, N.R., Soni, N., Janapati, G.S., and Vangala, K.R. (2016, January 29). Task scheduling in Cloud computing. Proceedings of the 2016 IEEE Long Island Systems, Applications and Technology Conference (LISAT), Farmingdale, NY, USA.","DOI":"10.1109\/LISAT.2016.7494149"},{"key":"ref_2","unstructured":"Ohlman, B., Eriksson, A., and Rembarz, R. (July, January 29). What networking of information can do for cloud computing. Proceedings of the Workshop on Enabling Technologies: Infrastructure for Collaborative Enterprises, WETICE, Groningen, The Netherlands."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Taneja, B. (2015, January 15\u201316). An empirical study of most fit, max-min and priority task scheduling algorithms in cloud computing. Proceedings of the International Conference on Computing, Communication & Automation, ICCCA 2015, Greater Noida, India.","DOI":"10.1109\/CCAA.2015.7148457"},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Lynn, T., Xiong, H., Dong, D., Momani, B., Gravvanis, G.A., Filelis-Papadopoulos, C., Elster, A., Muhammad Zaki Murtaza Khan, M., Tzovaras, D., and Giannoutakis, K. (2016, January 23\u201325). CLOUDLIGHTNING: A framework for a self-organising and self-managing heterogeneous cloud. Proceedings of the CLOSER 2016, 6th International Conference on Cloud Computing and Services Science, Rome, Italy.","DOI":"10.5220\/0005921503330338"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"e6326","DOI":"10.1002\/cpe.6326","article-title":"Evaluation of self-organizing and self-managing heterogeneous high performance computing clouds through discrete-time simulation","volume":"33","author":"Giannoutakis","year":"2021","journal-title":"Concurr. Comput. Pract. Exp."},{"key":"ref_6","first-page":"16","article-title":"Heuristic Algorithms for Task Scheduling in Cloud Computing: A Survey","volume":"9","author":"Soltani","year":"2017","journal-title":"Int. J. Comput. Netw. Inf. Secur."},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Alhaidari, F., Balharith, T., and Al-Yahyan, E. (2019, January 3\u20134). Comparative analysis for task scheduling algorithms on cloud computing. Proceedings of the 2019 International Conference on Computer and Information Sciences, ICCIS 2019, Sakaka, Saudi Arabia.","DOI":"10.1109\/ICCISci.2019.8716470"},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Zu, Q., Vargas-Vera, M., and Hu, B. (2013). An improved task scheduling algorithm based on potential games in cloud computing. Pervasive Computing and the Networked World, Springer. ICPCA\/SWS; Lecture Notes in Computer Science.","DOI":"10.1007\/978-3-319-09265-2"},{"key":"ref_9","first-page":"129","article-title":"Cloud task scheduling based on ant colony optimization","volume":"12","author":"Tawfeek","year":"2015","journal-title":"Int. Arab J. Inf. Technol."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1007\/s10922-016-9385-9","article-title":"A Survey of PSO-Based Scheduling Algorithms in Cloud Computing","volume":"25","author":"Masdari","year":"2017","journal-title":"J. Netw. Syst. Manag."},{"key":"ref_11","first-page":"10","article-title":"A finest time quantum for improving shortest remaining burst round robin (srbrr) algorithm","volume":"4","author":"Varma","year":"2013","journal-title":"J. Glob. Res. Comput. Sci."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Singh, M., and Agrawal, R. (2017, January 21\u201322). Modified Round Robin algorithm (MRR). Proceedings of the 2017 IEEE International Conference on Power, Control, Signals and Instrumentation Engineering, ICPCSI 2017, Chennai, India.","DOI":"10.1109\/ICPCSI.2017.8392238"},{"key":"ref_13","first-page":"112","article-title":"Improved Round Robin Algorithm: Proposed Method to Apply {SJF} using Geometric Mean","volume":"5","author":"Dorgham","year":"2016","journal-title":"Int. J. Adv. Stud. Comput. Sci. Eng."},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Balharith, T., and Alhaidari, F. (2019, January 1\u20133). Round Robin Scheduling Algorithm in CPU and Cloud Computing: A review. Proceedings of the 2nd International Conference on Computer Applications and Information Security, ICCAIS 2019, Riyadh, Saudi Arabia.","DOI":"10.1109\/CAIS.2019.8769534"},{"key":"ref_15","first-page":"111","article-title":"Tasks scheduling optimization for the cloud computing systems","volume":"5","author":"Tayal","year":"2011","journal-title":"Int. J. Adv. Eng. Sci. Technol."},{"key":"ref_16","first-page":"1","article-title":"An Improved Round Robin CPU Scheduling Algorithm with Varying Time Quantum","volume":"4","author":"Mishra","year":"2014","journal-title":"Int. J. Comput. Sci. Eng. Appl."},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Jbara, Y.H. (2019, January 3\u20134). A new improved round robin-based scheduling algorithm-a comparative analysis. Proceedings of the 2019 International Conference on Computer and Information Sciences, ICCIS 2019, Sakaka, Saudi Arabia.","DOI":"10.1109\/ICCISci.2019.8716476"},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Srujana, R., Roopa, Y.M., and Mohan, M.D.S.K. (2019, January 23\u201325). Sorted round robin algorithm. Proceedings of the International Conference on Trends in Electronics and Informatics, ICOEI 2019, Tirunelveli, India.","DOI":"10.1109\/ICOEI.2019.8862609"},{"key":"ref_19","first-page":"639","article-title":"Improved round robin scheduling in cloud computing","volume":"10","author":"Sangwan","year":"2017","journal-title":"Adv. Comput. Sci. Technol."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"195","DOI":"10.2991\/ijndc.k.200804.001","article-title":"Improved Version of Round Robin Scheduling Algorithm Based on Analytic Model","volume":"8","author":"Fiad","year":"2020","journal-title":"Int. J. Networked Distrib. Comput."},{"key":"ref_21","first-page":"14","article-title":"A Hybrid Round Robin Scheduling Mechanism for Process Management","volume":"177","author":"Faizan","year":"2020","journal-title":"Int. J. Comput. Appl."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"33","DOI":"10.5815\/ijmecs.2019.10.04","article-title":"Samsuddoha Determining Proficient Time Quantum to Improve the Performance of Round Robin Scheduling Algorithm","volume":"11","author":"Biswas","year":"2019","journal-title":"Int. J. Mod. Educ. Comput. Sci."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1186\/s13677-017-0085-0","article-title":"A novel hybrid of Shortest job first and round Robin with dynamic variable quantum time task scheduling technique","volume":"6","author":"Elmougy","year":"2017","journal-title":"J. Cloud Comput."},{"key":"ref_24","first-page":"1360","article-title":"Task Scheduling Algorithm in Cloud Computing Based on Invasive Tumor Growth Optimization","volume":"41","author":"Zhou","year":"2018","journal-title":"Jisuanji Xuebao\/Chin. J. Comput."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"878","DOI":"10.1016\/j.procs.2016.05.278","article-title":"Modified Round Robin Algorithm for Resource Allocation in Cloud Computing","volume":"85","author":"Pradhan","year":"2016","journal-title":"Procedia Comput. Sci."},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Dave, B., Yadev, S., Mathuria, M., and Sharma, Y.M. (2017, January 7\u20138). Optimize task scheduling act by modified round robin scheme with vigorous time quantum. Proceedings of the International Conference on Intelligent Sustainable Systems, ICISS 2017, Palladam, India.","DOI":"10.1109\/ISS1.2017.8389310"},{"key":"ref_27","first-page":"64","article-title":"An improved round robin cpu scheduling algorithm","volume":"3","author":"Mishra","year":"2012","journal-title":"J. Glob. Res. Comput. Sci."},{"key":"ref_28","first-page":"21","article-title":"Efficient Dual Nature Round Robin CPU Scheduling Algorithm: A Comparative Analysis","volume":"8","author":"Fayyaz","year":"2017","journal-title":"Int. J. Multidiscip. Sci. Eng."},{"key":"ref_29","unstructured":"Filho, M.C.S., Oliveira, R.L., Monteiro, C.C., In\u00e1cio, P.R.M., and Freire, M.M. (2017, January 8\u201312). CloudSim Plus: A cloud computing simulation framework pursuing software engineering principles for improved modularity, extensibility and correctness. Proceedings of the IM 2017\u20142017 IFIP\/IEEE International Symposium on Integrated Network and Service Management, Lisbon, Portugal."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1002\/spe.995","article-title":"CloudSim: A toolkit for modeling and simulation of cloud computing environments and evaluation of resource provisioning algorithms","volume":"41","author":"Calheiros","year":"2010","journal-title":"Softw. Pract. Exp."},{"key":"ref_31","first-page":"67","article-title":"Determining the Optimum Time Quantum Value in Round Robin Process Scheduling Method","volume":"4","author":"Saeidi","year":"2012","journal-title":"Int. J. Inf. Technol. Comput. Sci."},{"key":"ref_32","first-page":"34","article-title":"Improved Round Robin Scheduling using Dynamic Time Quantum","volume":"38","author":"Nayak","year":"2012","journal-title":"Int. J. Comput. Appl."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"16","DOI":"10.17485\/ijst\/2016\/v9i8\/76368","article-title":"Dynamic Time Slice Round Robin Scheduling Algorithm with Unknown Burst Time","volume":"9","author":"Muraleedharan","year":"2016","journal-title":"Indian J. Sci. Technol."},{"key":"ref_34","doi-asserted-by":"crossref","unstructured":"Hemamalini, M., and Srinath, M.V. (2015). Memory Constrained Load Shared Minimum Execution Time Grid Task Scheduling Algorithm in a Heterogeneous Environment. Indian J. Sci. Technol., 8.","DOI":"10.17485\/ijst\/2015\/v8i15\/71373"},{"key":"ref_35","first-page":"12","article-title":"An Improved Round Robin Approach using Dynamic Time Quantum for Improving Average Waiting Time","volume":"69","author":"Negi","year":"2013","journal-title":"Int. J. Comput. Appl."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0304-405X(89)90077-9","article-title":"Dividend announcements. Cash flow signalling vs. free cash flow hypothesis?","volume":"24","author":"Lang","year":"1989","journal-title":"J. Financ. Econ."},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"2967","DOI":"10.1016\/j.jpdc.2014.06.013","article-title":"Experience with using the Parallel Workloads Archive","volume":"74","author":"Feitelson","year":"2014","journal-title":"J. Parallel Distrib. Comput."},{"key":"ref_38","unstructured":"(2019, August 14). Nasa-Workload. Available online: http:\/\/www.cs.huji.ac.il\/labs\/parallel\/workload."},{"key":"ref_39","doi-asserted-by":"crossref","unstructured":"Feitelson, D.G., and Rudolph, L. (2000). Effect of job size characteristics on job scheduling performance. Job Scheduling Strategies for Parallel Processing, Springer. Lecture Notes in Computer Science; JSSPP 2000.","DOI":"10.1007\/3-540-39997-6"},{"key":"ref_40","doi-asserted-by":"crossref","unstructured":"Alboaneen, D.A., Tianfield, H., and Zhang, Y. (2017, January 22\u201323). Glowworm swarm optimisation based task scheduling for cloud computing. Proceedings of the Second International Conference on Internet of things, Data and Cloud Computing, Cambridge, UK.","DOI":"10.1145\/3018896.3036395"},{"key":"ref_41","doi-asserted-by":"crossref","unstructured":"Feitelson, D.G., and Rudolph, L. (1996). Dynamic vs. Static quantum-based parallel processor allocation. Workshop on Job Scheduling Strategies for Parallel Processing, Springer. JSSPP 1996; Lecture Notes in Computer Science.","DOI":"10.1007\/BFb0022283"}],"container-title":["Computers"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-431X\/10\/5\/63\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T05:58:29Z","timestamp":1760162309000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-431X\/10\/5\/63"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,9]]},"references-count":41,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2021,5]]}},"alternative-id":["computers10050063"],"URL":"https:\/\/doi.org\/10.3390\/computers10050063","relation":{},"ISSN":["2073-431X"],"issn-type":[{"value":"2073-431X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,5,9]]}}}