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 performance of time-sharing systems depends largely on the length of the time slice in the round-robin algorithms. The time slic...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:al-Tarbiyah wa-al-ʻilm lil-ʻulūm al-insānīyah : majallah ʻilmīyah muḥakkamah taṣduru ʻan Kullīyat al-Tarbiyah lil-ʻUlūm al-Insānīyah fī Jāmiʻat al-Mawṣil Ročník 32; číslo 2; s. 20 - 29
Hlavní autor: Ahmad, Abdulnasir Younis
Médium: Journal Article
Jazyk:angličtina
Vydáno: Mosul, Iraq جامعة الموصل - كلية التربية 2023
University of Mosul, College of Education for Pure Science
Témata:
تقسيم الوقت
خوارزميات الجدولة
نظم التشغيل
ISSN:1812-125X, 2664-2530
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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 performance of time-sharing systems depends largely on the length of the time slice in the round-robin algorithms. The time slice length affects the measuring criteria of the performance of the algorithms. Researchers suggested and are continuing to suggest algorithms 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; a 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 (RRDTQ), 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 absolute, permanent, and fixed in value and that resorting to statistical measures is the best way to clarify the degree of performance of the algorithms.
ISSN:1812-125X
2664-2530
DOI:10.33899/edusj.2023.137735.1317