A Review Study on the CPU Scheduling Algorithms

Abstract: In operating system, Scheduling plays a vital role in their designing. Different authors proposed various Scheduling algorithms and performance of their algorithms. In this paper, studying the review of those different scheduling algorithms are performed with different parameters, such as turnaround time, burst time, response time, waiting time, throughput, fairness and CPU utilization. In this paper, different reviews are collected and integrated various researches done in the field of CPU scheduling and its performance, so that this effort can be helpful for new researches to find out the future aspects in this field.

Keywords: Scheduling, Scheduler, Response time, Time quantum, burst time, context switch, AWT, ATAT, FCFS, SJF, STCF, Priority, RR, MLQ, MLFQ , GBTQ, EPSADTQ, PSMTQ, DWRR, Markov chain model, VHRRN, FUZZ, deadlock-waiting index, simulation, SL, GLS, State Probability, lottery scheduling, PPS-LS, SRS-LS, SJRR, mean-deviation, LRRTIME QUANTUM, integer programming, SRBRR, SARR, Deterministic, ARR, STS, TPBCS, CPU-intensive, I/O-intensive, Balanced factor, PSMTIME QUANTUM, AMRR, RRHRRN, ERR, NMLFQ, PSSDTQ, non-linear programming, integer programming, MDTQRR, NMLFQ, EDRR, SRBRR, ISRBRR, EDRR.