Paper Details: Downloads: 3231
Serial Number: P1111744588
Title: Round Robin based Scheduling Algorithms, A Comparative Study
Authors: Kamal ElDahshan and Afaf Abd Elkader and Nermeen Ghazy
Abstract: Scheduling is the process of allocating processes to the CPU in order to optimize some objective function. There are many algorithms used to schedule processes. The Round Robin (RR) CPU scheduling algorithm is one of these algorithms which is effective in time sharing and real time operating systems. It gives reasonable response time. But it suffers from several disadvantages such as high turnaround time, high waiting time and many context switches. There are large numbers of algorithms proposed to enhance the standard Round Robin algorithm. In this paper we present a survey with results analysis that conclude recommendations for an Enriched Round Robin algorithm that ameliorates the performance of average waiting time and average turnaround time.
Keywords: Round Robin scheduling algorithm (RR), Adaptive Round Robin Scheduling algorithm, Time Quantum (TQ), Dynamic TQ, Round Robin Remaining time algorithm (RRRT), (IRR) improved Round Robin CPU Scheduling Algorithm, (AAAIRR) an improvement on the improved Round Robin CPU scheduling algorithm, (ERR) An Enhanced Round Robin CPU Scheduling Algorithm, (MMRR) Min-Max Dispersion Measure, (IRRVQ) The improved Round Robin CPU scheduling algorithm with varying time quantum, (AMRR) Average Max Round Robin Scheduling Algorithm, Average waiting time, Average turnaround time.
Journal/Conference: International Journal of Automatic Control and System Engineering
Volume: 17
Issue: 2
Submission Date: 10/30/2017 12:00:00 AM
Review Date: 12/9/2017 12:00:00 AM
Publishing Date: 1/9/2018 12:00:00 AM
Article Downloads: 3231
Download:

Facebook