Modified Median Round Robin Algorithm (MMRRA)

• Published in: 2017 13th International Conference on Electronics, Computer and Computation (ICECCO) pp. 1 - 7
• Main Authors: Mora, Hafsatu, Abdullahi, Saleh E., Junaidu, Sahalu B.
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.11.2017
• Subjects: Central Processing Unit; Context switching; CPU scheduling; Dynamic scheduling; Heuristic algorithms; Response time; Round robin; Round Robin CPU scheduling algorithm; Time factors; Turnaround time; Waiting time
• DOI: 10.1109/ICECCO.2017.8333325
• ISBN: 1538624990; 9781538624999

CPU scheduling involves a careful examination of pending processes to determine the most efficient way to service the requests. This research works in the field of Round Robin (RR) CPU scheduling by carefully studying various popular RR scheduling algorithms to propose an option, Modified Median Round Robin Algorithm (MMRRA), to compete alongside others. A lot of research papers on dynamic RR have been published and they provide better solution to the Classical RR. Some major challenges to most of these dynamic RR scheduling are: They do not include Average Response Time (ART) as a criteria for comparison, they do not bother much on preempting processes with negligible left over of burst time which will lead to an increase on the number of context switching (NCS). Using MMRRA, variable quantum time is used to eliminate these shortcomings. A simulator program has been designed and tested against five selected algorithms, which in turns proved to perform better in most of the criteria.