Agent-Based Adaptive Dynamic Round Robin (AADRR) Scheduling Algorithm
Scheduling techniques are essential to increase resource utilization and task execution within modern computing environments. Round Robin Scheduling (RR) ensures a fair distribution of processes needing attention but often leads to inefficiencies in systems with heterogeneous tasks or different prio...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2025-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/10852303/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832576776826519552 |
|---|---|
| author | Zafar Iqbal Khan Muzafar Khan Syed Nasir Mehmood Shah |
| author_facet | Zafar Iqbal Khan Muzafar Khan Syed Nasir Mehmood Shah |
| author_sort | Zafar Iqbal Khan |
| collection | DOAJ |
| description | Scheduling techniques are essential to increase resource utilization and task execution within modern computing environments. Round Robin Scheduling (RR) ensures a fair distribution of processes needing attention but often leads to inefficiencies in systems with heterogeneous tasks or different priorities due to large latency or resource usage differences. To address such problems, this paper introduces the Agent-based Adaptive Dynamic Round Robin (AADRR) process scheduling technique, which enhances process scheduling by continuously adjusting the time quantum and criteria, combining CPU burst time and priority. In the proposed AADRR, all processes are ranked dynamically by a software agent based on user preferences and current system load. This agent operates independently by keeping an eye on system parameters and making the required adjustments in real-time without requiring human intervention. We place processes in the queue according to their order of importance. A dynamic time quantum policy is suitable whenever it meets the mean duration of each process in the queue. Every round has the time quantum adjusted based on this method average burst time. AADRR highlights that the short processes are managed properly and the long processes are completed within a few rounds to fairly complete and maintain all the processes in the system. The proposed AADRR is more suitable for periodic tasks that employ a dynamic scheduling system and adapt time quantum according to the system state and job features. Additionally, AADRR efficiently manages preemptable tasks, using dynamic scheduling policies to accommodate variations in process priority and CPU burst times, ensuring fair scheduling, efficient resource utilization, and dynamic adaptability. To validate the effectiveness of the AADRR algorithm, we performed a comparative performance analysis with twelve other algorithms, including five traditional CPU scheduling algorithms and seven advanced job scheduling techniques, demonstrating optimal performance results. In our experiments, synthetic workload traces were generated using the Monte Carlo probability distribution method, which is scientifically recommended for creating diverse workload traces. Small, medium, and large datasets were used, with the small workload traces obtained from published studies and the large traces produced by the Monte Carlo simulation. AADRR efficiently reduces average turnaround times and average waiting times for each workload and performs better in response time. AADRR may not always provide the most favorable measures in all scenarios. Still, it performs better than other scheduling techniques in system performance, while being more efficient and flexible for different workloads. |
| format | Article |
| id | doaj-art-abd60e92d4a94dedb8b8c824660f57a3 |
| institution | Kabale University |
| issn | 2169-3536 |
| language | English |
| publishDate | 2025-01-01 |
| publisher | IEEE |
| record_format | Article |
| series | IEEE Access |
| spelling | doaj-art-abd60e92d4a94dedb8b8c824660f57a32025-01-31T00:01:03ZengIEEEIEEE Access2169-35362025-01-0113183081832410.1109/ACCESS.2025.353403110852303Agent-Based Adaptive Dynamic Round Robin (AADRR) Scheduling AlgorithmZafar Iqbal Khan0https://orcid.org/0009-0005-9173-0643Muzafar Khan1https://orcid.org/0000-0001-6846-3739Syed Nasir Mehmood Shah2https://orcid.org/0000-0002-5623-1815Department of Software Engineering, National University of Modern Languages, Islamabad, PakistanDepartment of Software Engineering, National University of Modern Languages, Islamabad, PakistanDepartment of Computer Science, Institute of Space Technology, KICSIT Kahuta Campus, Islamabad, PakistanScheduling techniques are essential to increase resource utilization and task execution within modern computing environments. Round Robin Scheduling (RR) ensures a fair distribution of processes needing attention but often leads to inefficiencies in systems with heterogeneous tasks or different priorities due to large latency or resource usage differences. To address such problems, this paper introduces the Agent-based Adaptive Dynamic Round Robin (AADRR) process scheduling technique, which enhances process scheduling by continuously adjusting the time quantum and criteria, combining CPU burst time and priority. In the proposed AADRR, all processes are ranked dynamically by a software agent based on user preferences and current system load. This agent operates independently by keeping an eye on system parameters and making the required adjustments in real-time without requiring human intervention. We place processes in the queue according to their order of importance. A dynamic time quantum policy is suitable whenever it meets the mean duration of each process in the queue. Every round has the time quantum adjusted based on this method average burst time. AADRR highlights that the short processes are managed properly and the long processes are completed within a few rounds to fairly complete and maintain all the processes in the system. The proposed AADRR is more suitable for periodic tasks that employ a dynamic scheduling system and adapt time quantum according to the system state and job features. Additionally, AADRR efficiently manages preemptable tasks, using dynamic scheduling policies to accommodate variations in process priority and CPU burst times, ensuring fair scheduling, efficient resource utilization, and dynamic adaptability. To validate the effectiveness of the AADRR algorithm, we performed a comparative performance analysis with twelve other algorithms, including five traditional CPU scheduling algorithms and seven advanced job scheduling techniques, demonstrating optimal performance results. In our experiments, synthetic workload traces were generated using the Monte Carlo probability distribution method, which is scientifically recommended for creating diverse workload traces. Small, medium, and large datasets were used, with the small workload traces obtained from published studies and the large traces produced by the Monte Carlo simulation. AADRR efficiently reduces average turnaround times and average waiting times for each workload and performs better in response time. AADRR may not always provide the most favorable measures in all scenarios. Still, it performs better than other scheduling techniques in system performance, while being more efficient and flexible for different workloads.https://ieeexplore.ieee.org/document/10852303/CPU scheduling algorithmsround robin (RR)context switching (NCS)dynamic time quantum (DTQ)Monte Carlo probability distribution |
| spellingShingle | Zafar Iqbal Khan Muzafar Khan Syed Nasir Mehmood Shah Agent-Based Adaptive Dynamic Round Robin (AADRR) Scheduling Algorithm IEEE Access CPU scheduling algorithms round robin (RR) context switching (NCS) dynamic time quantum (DTQ) Monte Carlo probability distribution |
| title | Agent-Based Adaptive Dynamic Round Robin (AADRR) Scheduling Algorithm |
| title_full | Agent-Based Adaptive Dynamic Round Robin (AADRR) Scheduling Algorithm |
| title_fullStr | Agent-Based Adaptive Dynamic Round Robin (AADRR) Scheduling Algorithm |
| title_full_unstemmed | Agent-Based Adaptive Dynamic Round Robin (AADRR) Scheduling Algorithm |
| title_short | Agent-Based Adaptive Dynamic Round Robin (AADRR) Scheduling Algorithm |
| title_sort | agent based adaptive dynamic round robin aadrr scheduling algorithm |
| topic | CPU scheduling algorithms round robin (RR) context switching (NCS) dynamic time quantum (DTQ) Monte Carlo probability distribution |
| url | https://ieeexplore.ieee.org/document/10852303/ |
| work_keys_str_mv | AT zafariqbalkhan agentbasedadaptivedynamicroundrobinaadrrschedulingalgorithm AT muzafarkhan agentbasedadaptivedynamicroundrobinaadrrschedulingalgorithm AT syednasirmehmoodshah agentbasedadaptivedynamicroundrobinaadrrschedulingalgorithm |