Optimizing Task Execution: The Impact of Dynamic Time Quantum and Priorities on Round Robin Scheduling

Author:

Iqbal Mansoor1,Ullah Zahid23ORCID,Khan Izaz Ahmad4ORCID,Aslam Sheraz56ORCID,Shaheer Haris7,Humayon Mujtaba8,Salahuddin Muhammad Asjad8,Mehmood Adeel8

Affiliation:

1. Department of Computer Science, FAST National University, Peshawar Campus, Peshawar 44000, Pakistan

2. Department of Electrical Engineering, University of Management and Technology Lahore, Sialkot Campus, Sialkot 51310, Pakistan

3. Dipartimento di Elettronica, Informazione e Bioingegneria, Politecnico di Milano, 20133 Milano, Italy

4. Department of Computer Science, Bacha Khan University, Charsadda (BKUC), Charsadda 24420, Pakistan

5. Department of Electrical Engineering, Computer Engineering, and Informatics, Cyprus University of Technology, Limassol 3036, Cyprus

6. Department of Computer Science, Ctl Eurocollege, Limassol 3077, Cyprus

7. Department of Information Technology, University of the Cumberlands, Williamsburg, KY 40769, USA

8. Department of Computer Science, University of Alabama at Birmingham, Birmingham, AL 35294, USA

Abstract

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.

Publisher

MDPI AG

Subject

Computer Networks and Communications

Reference25 articles.

1. Relative time quantum-based enhancements in round robin scheduling;Iqbal;Comput. Syst. Sci. Eng.,2022

2. A smart intuitionistic fuzzy-based framework for round-robin short-term scheduler;Raheja;J. Supercomput.,2021

3. 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.

4. A new median-average round robin scheduling algorithm: An optimal approach for reducing turnaround and waiting time;Sharma;Alex. Eng. J.,2022

5. Determining proficient time quantum to improve the performance of round robin scheduling algorithm;Biswas;Int. J. Mod. Educ. Comput. Sci.,2019

Cited by 2 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3