Fittest Job First Dynamic Round Robin (FJFDRR) scheduling algorithm using dual queue and arrival time factor: a comparison

International Conference on Information Technology and Digital Applications 2018

计算机科学;无线电电子学

Manuel, Jezreel Ian C.^1 ; Baquirin, Rey Benjamin M.^1 ; Guevara, Kier Sostenes^1 ; Tandingan, Dionisio R.^1

University of the Cordilleras, Baguio City, Philippines^1

关键词: Arrival time;    Average waiting-time;    Context switch;    CPU scheduling algorithms;    Dynamic round robin;    Single CPU;   

Others  :  https://iopscience.iop.org/article/10.1088/1757-899X/482/1/012046/pdf
DOI  :  10.1088/1757-899X/482/1/012046

学科分类：计算机科学（综合）

来源: IOP

【 摘 要 】

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.