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

Mansoor Iqbal, Zahid Ullah, Izaz Ahmad Khan, Sheraz Aslam (), Haris Shaheer, Mujtaba Humayon, Muhammad Asjad Salahuddin and Adeel Mehmood
Additional contact information
Mansoor Iqbal: Department of Computer Science, FAST National University, Peshawar Campus, Peshawar 44000, Pakistan
Zahid Ullah: Department of Electrical Engineering, University of Management and Technology Lahore, Sialkot Campus, Sialkot 51310, Pakistan
Izaz Ahmad Khan: Department of Computer Science, Bacha Khan University, Charsadda (BKUC), Charsadda 24420, Pakistan
Sheraz Aslam: Department of Electrical Engineering, Computer Engineering, and Informatics, Cyprus University of Technology, Limassol 3036, Cyprus
Haris Shaheer: Department of Information Technology, University of the Cumberlands, Williamsburg, KY 40769, USA
Mujtaba Humayon: Department of Computer Science, University of Alabama at Birmingham, Birmingham, AL 35294, USA
Muhammad Asjad Salahuddin: Department of Computer Science, University of Alabama at Birmingham, Birmingham, AL 35294, USA
Adeel Mehmood: Department of Computer Science, University of Alabama at Birmingham, Birmingham, AL 35294, USA

Future Internet, 2023, vol. 15, issue 3, 1-14

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.

Keywords: operating system; scheduling; round robin; dynamic time quantum; priorities (search for similar items in EconPapers)
JEL-codes: O3 (search for similar items in EconPapers)
Date: 2023
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/1999-5903/15/3/104/pdf (application/pdf)
https://www.mdpi.com/1999-5903/15/3/104/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jftint:v:15:y:2023:i:3:p:104-:d:1091167

Access Statistics for this article

Future Internet is currently edited by Ms. Grace You

More articles in Future Internet from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().