Operating System Design/Scheduling Processes/SRT

From Wikibooks, open books for an open world
< Operating System Design
Jump to: navigation, search

The Shortest Remaining Time (SRT) scheduling system is a more intelligent version of SPN that allows shorter processes to skip ahead as they appear, instead of only processing the shortest process at the time that CPU time becomes available.

This method also falls prey to the halting problem, and is also susceptible to live lock.

There is no way to determine which process is going to run in the least amount of time unless you allow all processes to run and record their execution times or take input from the user.

Analogy[edit]

The individual with the least amount of items is allowed to skip to the front of the line regardless of how long everyone else has been waiting..

Implementation[edit]

Advantages and Disadvantages[edit]

SRT tends to be the most optimal scheduling system if we are hoping to run as many processes as possible in a given time, but requires exact knowledge of how long a process will take. This is usually input by the user or calculated from previous runs of the process.