Abstract
The Fittest Job First Dynamic Round Robin (FJFDRR) was introduced as a CPU scheduling algorithm whose performance evaluation reduces the number of context switches (CS), average waiting time (AWT), and average turnaround time (ATAT) of processes in a single CPU environment. In this paper, we explored improvements on the FJFDRR by including the process arrival time as an algorithmic factor implemented using a dual queue. We then compared the performance of the proposed algorithm called enhanced Fittest Job First Dynamic Round Robin (eFJFDRR) as with the FJFDRR algorithm together with the other CPU scheduling algorithms. Trial results showed that eFJFDRR scheduling algorithm performed better in reducing average waiting time, average turnaround time, and average response time in some cases. It was also found to balance the number of context switches of the processor during execution.
Published Version (
Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call