Shortest Remaining Time Next (SRTN)

Shortest Remaining Time Next (SRTN)

• This is the pre-emptive version of shortest job first
• This permits a process that enters the ready list to pre-empt the running process, if the time for the new process is less than the remaining time for running process.

Priority Scheduling

• A priority is associated with each process, and the CPU is allocated to the process with the highest priority.
• Equal priority processes are scheduled in FCFS order.
• Is a non-pre-emptive algorithm
• Priority can be decided based on memory requirements, time requirements or any other resource requirement.

End