Improved Round Robin CPU Scheduling Algorithm with Different Arrival Times Based on Dynamic Quantum
Modern operating systems are based on the principle of time-sharing in executing simultaneous operations. Determining the length of the time slice, and the times when processes arrive at the ready queue are problems that affect metrics such as the average waiting time (AWT), average turnaround time...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | Arabic |
| Published: |
College of Education for Pure Sciences
2022-12-01
|
| Series: | مجلة التربية والعلم |
| Subjects: | |
| Online Access: | https://edusj.mosuljournals.com/article_175959_5f01b08bee18990e09e74bac89097079.pdf |
| _version_ | 1797987314354356224 |
|---|---|
| author | ِAbdulnasir Ahmad |
| author_facet | ِAbdulnasir Ahmad |
| author_sort | ِAbdulnasir Ahmad |
| collection | DOAJ |
| description | Modern operating systems are based on the principle of time-sharing in executing simultaneous operations. Determining the length of the time slice, and the times when processes arrive at the ready queue are problems that affect metrics such as the average waiting time (AWT), average turnaround time (ATAT), response time (RT), and number of context switches (NCS) of the time-sharing round robin RR algorithms. The research aims to propose an algorithm that achieves a short waiting time while maintaining a reasonable response time, which is the most important characteristic of time-sharing algorithms. The Different Arrival-Dynamic Quantum Round Robin (DADQRR) algorithm bases its work on different parameters to adjust the time slice value dynamically. The algorithm has been compared to three other algorithms that are similar in terms of dealing with different arrival times, namely AN, MARR, and RR. The algorithm outperformed the three algorithms at a range from 6.155% to 31.409% in terms of AWT. It achieved an outperformance of 5.924% to 30.850%, considering the TAT. The ranges of outperformance values resulted from the difference in the ranges of arrival times, as well as in the ranges of burst times. |
| first_indexed | 2024-04-11T07:45:46Z |
| format | Article |
| id | doaj.art-12752d46b24c42689adae832fcd1884a |
| institution | Directory Open Access Journal |
| issn | 1812-125X 2664-2530 |
| language | Arabic |
| last_indexed | 2024-04-11T07:45:46Z |
| publishDate | 2022-12-01 |
| publisher | College of Education for Pure Sciences |
| record_format | Article |
| series | مجلة التربية والعلم |
| spelling | doaj.art-12752d46b24c42689adae832fcd1884a2022-12-22T04:36:16ZaraCollege of Education for Pure Sciencesمجلة التربية والعلم1812-125X2664-25302022-12-0131410511510.33899/edusj.2022.135082.1273175959Improved Round Robin CPU Scheduling Algorithm with Different Arrival Times Based on Dynamic QuantumِAbdulnasir Ahmad0Department of Computer Science/College of Education for Pure Science/ University of Mosul/Mosul/IraqModern operating systems are based on the principle of time-sharing in executing simultaneous operations. Determining the length of the time slice, and the times when processes arrive at the ready queue are problems that affect metrics such as the average waiting time (AWT), average turnaround time (ATAT), response time (RT), and number of context switches (NCS) of the time-sharing round robin RR algorithms. The research aims to propose an algorithm that achieves a short waiting time while maintaining a reasonable response time, which is the most important characteristic of time-sharing algorithms. The Different Arrival-Dynamic Quantum Round Robin (DADQRR) algorithm bases its work on different parameters to adjust the time slice value dynamically. The algorithm has been compared to three other algorithms that are similar in terms of dealing with different arrival times, namely AN, MARR, and RR. The algorithm outperformed the three algorithms at a range from 6.155% to 31.409% in terms of AWT. It achieved an outperformance of 5.924% to 30.850%, considering the TAT. The ranges of outperformance values resulted from the difference in the ranges of arrival times, as well as in the ranges of burst times.https://edusj.mosuljournals.com/article_175959_5f01b08bee18990e09e74bac89097079.pdfdynamic quantum,,,،,؛varying arrival times,,,،,؛round robin,,,،,؛turnaround time,,,،,؛waiting time |
| spellingShingle | ِAbdulnasir Ahmad Improved Round Robin CPU Scheduling Algorithm with Different Arrival Times Based on Dynamic Quantum مجلة التربية والعلم dynamic quantum,, ,،,؛varying arrival times,, ,،,؛round robin,, ,،,؛turnaround time,, ,،,؛waiting time |
| title | Improved Round Robin CPU Scheduling Algorithm with Different Arrival Times Based on Dynamic Quantum |
| title_full | Improved Round Robin CPU Scheduling Algorithm with Different Arrival Times Based on Dynamic Quantum |
| title_fullStr | Improved Round Robin CPU Scheduling Algorithm with Different Arrival Times Based on Dynamic Quantum |
| title_full_unstemmed | Improved Round Robin CPU Scheduling Algorithm with Different Arrival Times Based on Dynamic Quantum |
| title_short | Improved Round Robin CPU Scheduling Algorithm with Different Arrival Times Based on Dynamic Quantum |
| title_sort | improved round robin cpu scheduling algorithm with different arrival times based on dynamic quantum |
| topic | dynamic quantum,, ,،,؛varying arrival times,, ,،,؛round robin,, ,،,؛turnaround time,, ,،,؛waiting time |
| url | https://edusj.mosuljournals.com/article_175959_5f01b08bee18990e09e74bac89097079.pdf |
| work_keys_str_mv | AT abdulnasirahmad improvedroundrobincpuschedulingalgorithmwithdifferentarrivaltimesbasedondynamicquantum |