Optimizing Task Execution: The Impact of Dynamic Time Quantum and Priorities on Round Robin Scheduling
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 propose...
Main Authors: | , , , , , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2023-03-01
|
Series: | Future Internet |
Subjects: | |
Online Access: | https://www.mdpi.com/1999-5903/15/3/104 |
_version_ | 1797611612752838656 |
---|---|
author | Mansoor Iqbal Zahid Ullah Izaz Ahmad Khan Sheraz Aslam Haris Shaheer Mujtaba Humayon Muhammad Asjad Salahuddin Adeel Mehmood |
author_facet | Mansoor Iqbal Zahid Ullah Izaz Ahmad Khan Sheraz Aslam Haris Shaheer Mujtaba Humayon Muhammad Asjad Salahuddin Adeel Mehmood |
author_sort | Mansoor Iqbal |
collection | DOAJ |
description | 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. |
first_indexed | 2024-03-11T06:31:11Z |
format | Article |
id | doaj.art-8d879a03796543c39221a4f346e87a90 |
institution | Directory Open Access Journal |
issn | 1999-5903 |
language | English |
last_indexed | 2024-03-11T06:31:11Z |
publishDate | 2023-03-01 |
publisher | MDPI AG |
record_format | Article |
series | Future Internet |
spelling | doaj.art-8d879a03796543c39221a4f346e87a902023-11-17T11:13:10ZengMDPI AGFuture Internet1999-59032023-03-0115310410.3390/fi15030104Optimizing Task Execution: The Impact of Dynamic Time Quantum and Priorities on Round Robin SchedulingMansoor Iqbal0Zahid Ullah1Izaz Ahmad Khan2Sheraz Aslam3Haris Shaheer4Mujtaba Humayon5Muhammad Asjad Salahuddin6Adeel Mehmood7Department of Computer Science, FAST National University, Peshawar Campus, Peshawar 44000, PakistanDepartment of Electrical Engineering, University of Management and Technology Lahore, Sialkot Campus, Sialkot 51310, PakistanDepartment of Computer Science, Bacha Khan University, Charsadda (BKUC), Charsadda 24420, PakistanDepartment of Electrical Engineering, Computer Engineering, and Informatics, Cyprus University of Technology, Limassol 3036, CyprusDepartment of Information Technology, University of the Cumberlands, Williamsburg, KY 40769, USADepartment of Computer Science, University of Alabama at Birmingham, Birmingham, AL 35294, USADepartment of Computer Science, University of Alabama at Birmingham, Birmingham, AL 35294, USADepartment of Computer Science, University of Alabama at Birmingham, Birmingham, AL 35294, USATask 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.https://www.mdpi.com/1999-5903/15/3/104operating systemschedulinground robindynamic time quantumpriorities |
spellingShingle | Mansoor Iqbal Zahid Ullah Izaz Ahmad Khan Sheraz Aslam Haris Shaheer Mujtaba Humayon Muhammad Asjad Salahuddin Adeel Mehmood Optimizing Task Execution: The Impact of Dynamic Time Quantum and Priorities on Round Robin Scheduling Future Internet operating system scheduling round robin dynamic time quantum priorities |
title | Optimizing Task Execution: The Impact of Dynamic Time Quantum and Priorities on Round Robin Scheduling |
title_full | Optimizing Task Execution: The Impact of Dynamic Time Quantum and Priorities on Round Robin Scheduling |
title_fullStr | Optimizing Task Execution: The Impact of Dynamic Time Quantum and Priorities on Round Robin Scheduling |
title_full_unstemmed | Optimizing Task Execution: The Impact of Dynamic Time Quantum and Priorities on Round Robin Scheduling |
title_short | Optimizing Task Execution: The Impact of Dynamic Time Quantum and Priorities on Round Robin Scheduling |
title_sort | optimizing task execution the impact of dynamic time quantum and priorities on round robin scheduling |
topic | operating system scheduling round robin dynamic time quantum priorities |
url | https://www.mdpi.com/1999-5903/15/3/104 |
work_keys_str_mv | AT mansooriqbal optimizingtaskexecutiontheimpactofdynamictimequantumandprioritiesonroundrobinscheduling AT zahidullah optimizingtaskexecutiontheimpactofdynamictimequantumandprioritiesonroundrobinscheduling AT izazahmadkhan optimizingtaskexecutiontheimpactofdynamictimequantumandprioritiesonroundrobinscheduling AT sherazaslam optimizingtaskexecutiontheimpactofdynamictimequantumandprioritiesonroundrobinscheduling AT harisshaheer optimizingtaskexecutiontheimpactofdynamictimequantumandprioritiesonroundrobinscheduling AT mujtabahumayon optimizingtaskexecutiontheimpactofdynamictimequantumandprioritiesonroundrobinscheduling AT muhammadasjadsalahuddin optimizingtaskexecutiontheimpactofdynamictimequantumandprioritiesonroundrobinscheduling AT adeelmehmood optimizingtaskexecutiontheimpactofdynamictimequantumandprioritiesonroundrobinscheduling |