Abstract: CPU scheduling is one of the important concept of operating system. It is a method used to schedule jobs for execution. Shortest job next (SJN), also known as Shortest Job First (SJF) or Shortest Process Next (SPN), is a scheduling policy that selects the waiting process with the smallest execution time to execute next. Starvation is the main disadvantage of SJN. Round-robin (RR) is one of the algorithms employed by process and network schedulers in computing. As the term is generally used, time slices are assigned to each process in equal portions and in circular order, handling all processes without priority (also known as cyclic executive). More context switching, large response time, large waiting time, large turnaround time and less throughput are the main disadvantages. Approached Algorithm removes the disadvantage of shortest job next algorithm (Starvation) and Round robin algorithm (Context Switching). It reduces the average waiting time, response time and increase throughput.
Keywords: CPU scheduling, Starvation , Context switching, Gantt chart, Shortest job first scheduling algorithm, Round Robin CPU scheduling algorithm, Turnaround time, Waiting time.
Title: Revised Round Robin Scheduling Algorithm
Author: Aakash Gupta, Isha Nagpal
International Journal of Computer Science and Information Technology Research
ISSN 2348-1196 (print), ISSN 2348-120X (online)
Research Publish Journals
