An Attempt to Set Standards for Studying and Comparing the Efficiency of Round Robin Algorithms
With the advent of the need for interactive systems, the urgent need for time-sharing systems has emerged. Round-robin algorithms have emerged to achieve time-sharing. The degree of performance of time-sharing systems depends largely on the length of the time slice in the round-robin algorithms. The...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | Arabic |
| Published: |
College of Education for Pure Sciences
2023-06-01
|
| Series: | مجلة التربية والعلم |
| Subjects: | |
| Online Access: | https://edusj.mosuljournals.com/article_177511_8cae03eba4b335aa89e3ea7d8d2a256a.pdf |
| _version_ | 1797816294220759040 |
|---|---|
| author | Abdulnasir Y. Ahmad |
| author_facet | Abdulnasir Y. Ahmad |
| author_sort | Abdulnasir Y. Ahmad |
| collection | DOAJ |
| description | With the advent of the need for interactive systems, the urgent need for time-sharing systems has emerged. Round-robin algorithms have emerged to achieve time-sharing. The degree of performance of time-sharing systems depends largely on the length of the time slice in the round-robin algorithms. The length of the time slice affects the measuring criteria of the performance of the algorithms. Researchers suggested and are continuing suggesting algorithms in order to obtain the best values for the time slice. Adopting one algorithm over another in a system and for a class of applications requires choosing the best performing algorithm. This research is an attempt to develop an objective approach for accurate comparison between algorithms. For the sake of objectivity in comparison, five algorithms similar in their general characteristics were chosen; Modified Median Round Robin Algorithm(MMRRA), A New Median-Average Round Robin Scheduling Algorithm(NMARR), An Improved Round Robin Scheduling Algorithm with Varying Time Quantum (IRRVQ), A Modified Round Robin CPU Scheduling Algorithm with Dynamic Time Quantum (RRDT), Improved Round Robin Algorithm with Progressive Dynamic Quantum (IRRPDQ). The results showed that the outperformance of an algorithm over a group of algorithms according to a specific criterion is not permanent and fixed in value, and that resorting to statistical measures is the best way to clarify the degree of performance of the algorithms. |
| first_indexed | 2024-03-13T08:36:38Z |
| format | Article |
| id | doaj.art-fd89b3d6baa64927958e0414b8e9fb2d |
| institution | Directory Open Access Journal |
| issn | 1812-125X 2664-2530 |
| language | Arabic |
| last_indexed | 2024-03-13T08:36:38Z |
| publishDate | 2023-06-01 |
| publisher | College of Education for Pure Sciences |
| record_format | Article |
| series | مجلة التربية والعلم |
| spelling | doaj.art-fd89b3d6baa64927958e0414b8e9fb2d2023-05-30T23:24:19ZaraCollege of Education for Pure Sciencesمجلة التربية والعلم1812-125X2664-25302023-06-01322202910.33899/edusj.2023.137735.1317177511An Attempt to Set Standards for Studying and Comparing the Efficiency of Round Robin AlgorithmsAbdulnasir Y. Ahmad0Computer Department, Education Collage for Pure Science, University of Mosul, Mosul, Iraq.With the advent of the need for interactive systems, the urgent need for time-sharing systems has emerged. Round-robin algorithms have emerged to achieve time-sharing. The degree of performance of time-sharing systems depends largely on the length of the time slice in the round-robin algorithms. The length of the time slice affects the measuring criteria of the performance of the algorithms. Researchers suggested and are continuing suggesting algorithms in order to obtain the best values for the time slice. Adopting one algorithm over another in a system and for a class of applications requires choosing the best performing algorithm. This research is an attempt to develop an objective approach for accurate comparison between algorithms. For the sake of objectivity in comparison, five algorithms similar in their general characteristics were chosen; Modified Median Round Robin Algorithm(MMRRA), A New Median-Average Round Robin Scheduling Algorithm(NMARR), An Improved Round Robin Scheduling Algorithm with Varying Time Quantum (IRRVQ), A Modified Round Robin CPU Scheduling Algorithm with Dynamic Time Quantum (RRDT), Improved Round Robin Algorithm with Progressive Dynamic Quantum (IRRPDQ). The results showed that the outperformance of an algorithm over a group of algorithms according to a specific criterion is not permanent and fixed in value, and that resorting to statistical measures is the best way to clarify the degree of performance of the algorithms.https://edusj.mosuljournals.com/article_177511_8cae03eba4b335aa89e3ea7d8d2a256a.pdfdynamic time quantum,,,،,؛performance comparison,,,،,؛scheduling criteria,,,،,؛round robin,,,،,؛waiting time |
| spellingShingle | Abdulnasir Y. Ahmad An Attempt to Set Standards for Studying and Comparing the Efficiency of Round Robin Algorithms مجلة التربية والعلم dynamic time quantum,, ,،,؛performance comparison,, ,،,؛scheduling criteria,, ,،,؛round robin,, ,،,؛waiting time |
| title | An Attempt to Set Standards for Studying and Comparing the Efficiency of Round Robin Algorithms |
| title_full | An Attempt to Set Standards for Studying and Comparing the Efficiency of Round Robin Algorithms |
| title_fullStr | An Attempt to Set Standards for Studying and Comparing the Efficiency of Round Robin Algorithms |
| title_full_unstemmed | An Attempt to Set Standards for Studying and Comparing the Efficiency of Round Robin Algorithms |
| title_short | An Attempt to Set Standards for Studying and Comparing the Efficiency of Round Robin Algorithms |
| title_sort | attempt to set standards for studying and comparing the efficiency of round robin algorithms |
| topic | dynamic time quantum,, ,،,؛performance comparison,, ,،,؛scheduling criteria,, ,،,؛round robin,, ,،,؛waiting time |
| url | https://edusj.mosuljournals.com/article_177511_8cae03eba4b335aa89e3ea7d8d2a256a.pdf |
| work_keys_str_mv | AT abdulnasiryahmad anattempttosetstandardsforstudyingandcomparingtheefficiencyofroundrobinalgorithms AT abdulnasiryahmad attempttosetstandardsforstudyingandcomparingtheefficiencyofroundrobinalgorithms |