{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T01:57:31Z","timestamp":1760147851832,"version":"build-2065373602"},"reference-count":25,"publisher":"MDPI AG","issue":"3","license":[{"start":{"date-parts":[[2023,3,8]],"date-time":"2023-03-08T00:00:00Z","timestamp":1678233600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Future Internet"],"abstract":"<jats:p>Task scheduling algorithms are crucial for optimizing the utilization of computing resources. This work proposes a unique approach for improving task execution in real-time systems using an enhanced Round Robin scheduling algorithm variant incorporating dynamic time quantum and priority. The proposed algorithm adjusts the time slice allocated to each task based on execution time and priority, resulting in more efficient resource utilization. We also prioritize higher-priority tasks and execute them as soon as they arrive in the ready queue, ensuring the timely completion of critical tasks. We evaluate the performance of our algorithm using a set of real-world tasks and compare it with traditional Round Robin scheduling. The results show that our proposed approach significantly improves task execution time and resource utilization compared to conventional Round Robin scheduling. Our approach offers a promising solution for optimizing task execution in real-time systems. The combination of dynamic time quantum and priorities adds a unique element to the existing literature in this field.<\/jats:p>","DOI":"10.3390\/fi15030104","type":"journal-article","created":{"date-parts":[[2023,3,9]],"date-time":"2023-03-09T01:35:37Z","timestamp":1678325737000},"page":"104","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Optimizing Task Execution: The Impact of Dynamic Time Quantum and Priorities on Round Robin Scheduling"],"prefix":"10.3390","volume":"15","author":[{"given":"Mansoor","family":"Iqbal","sequence":"first","affiliation":[{"name":"Department of Computer Science, FAST National University, Peshawar Campus, Peshawar 44000, Pakistan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7330-6129","authenticated-orcid":false,"given":"Zahid","family":"Ullah","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering, University of Management and Technology Lahore, Sialkot Campus, Sialkot 51310, Pakistan"},{"name":"Dipartimento di Elettronica, Informazione e Bioingegneria, Politecnico di Milano, 20133 Milano, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8172-354X","authenticated-orcid":false,"given":"Izaz Ahmad","family":"Khan","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Bacha Khan University, Charsadda (BKUC), Charsadda 24420, Pakistan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4305-0908","authenticated-orcid":false,"given":"Sheraz","family":"Aslam","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering, Computer Engineering, and Informatics, Cyprus University of Technology, Limassol 3036, Cyprus"},{"name":"Department of Computer Science, Ctl Eurocollege, Limassol 3077, Cyprus"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haris","family":"Shaheer","sequence":"additional","affiliation":[{"name":"Department of Information Technology, University of the Cumberlands, Williamsburg, KY 40769, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mujtaba","family":"Humayon","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Alabama at Birmingham, Birmingham, AL 35294, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Muhammad Asjad","family":"Salahuddin","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Alabama at Birmingham, Birmingham, AL 35294, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adeel","family":"Mehmood","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Alabama at Birmingham, Birmingham, AL 35294, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2023,3,8]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"461","DOI":"10.32604\/csse.2022.017003","article-title":"Relative time quantum-based enhancements in round robin scheduling","volume":"41","author":"Iqbal","year":"2022","journal-title":"Comput. Syst. Sci. Eng."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"4655","DOI":"10.1007\/s11227-021-04052-4","article-title":"A smart intuitionistic fuzzy-based framework for round-robin short-term scheduler","volume":"78","author":"Raheja","year":"2021","journal-title":"J. Supercomput."},{"key":"ref_3","unstructured":"Noon, A., Kalakech, A., and Kadry, S. (2011). A new round-robin based scheduling algorithm for operating systems: Dynamic quantum using the mean average. arXiv."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"10527","DOI":"10.1016\/j.aej.2022.04.006","article-title":"A new median-average round robin scheduling algorithm: An optimal approach for reducing turnaround and waiting time","volume":"61","author":"Sharma","year":"2022","journal-title":"Alex. Eng. J."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"33","DOI":"10.5815\/ijmecs.2019.10.04","article-title":"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_6","doi-asserted-by":"crossref","unstructured":"Mostafa, S.M., and Amano, H. (2020). Dynamic round robin CPU scheduling algorithm based on K-means clustering technique. Appl. Sci., 10.","DOI":"10.3390\/app10155134"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/j.procs.2020.01.037","article-title":"A modified priority preemptive algorithm for CPU scheduling","volume":"165","author":"Chandiramani","year":"2019","journal-title":"Procedia Comput. Sci."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"2742","DOI":"10.11591\/eei.v10i5.2812","article-title":"Comparative analysis of the essential CPU scheduling algorithms","volume":"10","author":"Omar","year":"2021","journal-title":"Bull. Electr. Eng. Inform."},{"key":"ref_9","first-page":"19","article-title":"A Review on the CPU Scheduling Algorithms: Comparative Study","volume":"21","author":"Ali","year":"2021","journal-title":"Int. J. Comput. Sci. Netw. Secur."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"E09510","DOI":"10.1016\/j.heliyon.2022.e09510","article-title":"Examining the developments in scheduling algorithms research: A Bibliometric approach","volume":"8","author":"Omotehinwa","year":"2022","journal-title":"Heliyon"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Vecliuc, D.-D., Leon, F., and Logof\u0103tu, D. (2022). A comparison between task distribution strategies for load balancing using a multiagent system. Computation, 10.","DOI":"10.3390\/computation10120223"},{"key":"ref_12","first-page":"3253","article-title":"An adjustable variant of round robin algorithm based on clustering technique","volume":"66","author":"Mostafa","year":"2021","journal-title":"Comput. Mater. Contin."},{"key":"ref_13","first-page":"6","article-title":"Comparative Study of Process Scheduling Algorithm","volume":"7","author":"Saini","year":"2021","journal-title":"Int. J. Data Struct."},{"key":"ref_14","unstructured":"Agrawal, P., Gupta, A.K., and Mathur, P. (2021). Proceedings of the Second International Conference on Information Management and Machine Intelligence, Springer."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"526","DOI":"10.33003\/fjs-2020-0404-513","article-title":"A survey of variants of round robin CPU scheduling algorithms","volume":"4","author":"Olofintuyi","year":"2021","journal-title":"Fudma J. Sci."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"2556","DOI":"10.29294\/IJASE.9.1.2022.2556-2566","article-title":"Queue Fundamentals, implementation and its applications in round robin scheduling","volume":"9","author":"Fernandes","year":"2022","journal-title":"Int. J. Adv. Sci. Eng."},{"key":"ref_17","first-page":"691","article-title":"A new round robin algorithm for task scheduling in real-time system","volume":"15","author":"Ghazy","year":"2022","journal-title":"Int. J. Intell. Eng. Syst."},{"key":"ref_18","first-page":"15","article-title":"A Novel Method to improve the Round Robin CPU Scheduling Quantum time using Arithmetic Mean","volume":"1","author":"Akmal","year":"2022","journal-title":"Int. J. Comput. Innov. Sci."},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Alhaidari, F., and Balharith, T.Z. (2021). Enhanced round-robin algorithm in the cloud computing environment for Optimal Task Scheduling. Computers, 10.","DOI":"10.3390\/computers10050063"},{"key":"ref_20","first-page":"2309","article-title":"A review on job scheduling technique in cloud computing and priority rule based intelligent framework","volume":"34","author":"Murad","year":"2022","journal-title":"J. King Saud Univ.-Comput. Inf. Sci."},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Li, K., Peng, Z., Cui, D., and Li, Q. (2021). Sla-DQTS: SLA Constrained Adaptive Online task scheduling based on DDQN in cloud computing. Appl. Sci., 11.","DOI":"10.3390\/app11209360"},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Stan, R.G., B\u0103jenaru, L., Negru, C., and Pop, F. (2021). Evaluation of task scheduling algorithms in heterogeneous computing environments. Sensors, 21.","DOI":"10.3390\/s21175906"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"e7376","DOI":"10.1002\/cpe.7376","article-title":"A multi-queue priority-based task scheduling algorithm in Fog computing environment","volume":"34","author":"Fahad","year":"2022","journal-title":"Concurr. Comput. Pract. Exp."},{"key":"ref_24","unstructured":"Gupta, A.K., Mathur, P., Travieso-Gonzalez, C.M., Garg, M., and Goyal, D. (2021, January 9\u201312). ORR: Optimized Round Robin CPU Scheduling Algorithm. Proceedings of the International Conference on Data Science, Machine Learning and Artificial Intelligence, Windhoek, Namibia."},{"key":"ref_25","first-page":"6271","article-title":"ATS: A novel time-sharing CPU scheduling algorithm based on features similarities","volume":"70","author":"Mostafa","year":"2022","journal-title":"Comput. Mater. Contin."}],"container-title":["Future Internet"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-5903\/15\/3\/104\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T18:50:53Z","timestamp":1760122253000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-5903\/15\/3\/104"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,8]]},"references-count":25,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2023,3]]}},"alternative-id":["fi15030104"],"URL":"https:\/\/doi.org\/10.3390\/fi15030104","relation":{},"ISSN":["1999-5903"],"issn-type":[{"type":"electronic","value":"1999-5903"}],"subject":[],"published":{"date-parts":[[2023,3,8]]}}}