Shortest remaining time, also known as shortest remaining time first (SRTF), is a scheduling method that is a preemptive version of shortest job next scheduling. In this scheduling algorithm, the process with the smallest amount of time remaining until completion is selected to execute. Since the currently executing process is the one with the shortest amount of time remaining by definition, and since that time should only reduce as execution progresses, the process will either run until it completes or get pre-empted if a new process is added that requires a smaller amount of time.
Shortest remaining time is advantageous because short processes are handled very quickly. The system also requires very little overhead since it only makes a decision when a process completes or a new process is added, and when a new process is added the algorithm only needs to compare the currently executing process with the new process, ignoring all other processes currently waiting to execute.
Like shortest job next, it has the potential for process starvation: long processes may be held off indefinitely if short processes are continually added.[1] This threat can be minimal when process times follow a heavy-tailed distribution.[2] A similar algorithm which avoids starvation at the cost of higher tracking overhead is highest response ratio next (HRRN).
^Andrew S. Tanenbaum; Herbert Bos (2015). Modern Operating Systems. Pearson. ISBN 978-0-13-359162-0.
^Harchol-Balter, Mor; Schroeder, Bianca; Bansal, Nikhil; Agrawal, Mukesh (2003). "Size-Based Scheduling to Improve Web Performance". ACM Transactions on Computer Systems. 21 (2): 207–233. CiteSeerX 10.1.1.25.1229. doi:10.1145/762483.762486. S2CID 213935.
and 15 Related for: Shortest remaining time information
Shortestremainingtime, also known as shortestremainingtime first (SRTF), is a scheduling method that is a preemptive version of shortest job next scheduling...
the smallest execution time. SJN is a non-preemptive algorithm. Shortestremainingtime is a preemptive variant of SJN. Shortest job next is advantageous...
manufacturer Stereotactic radiation therapy Superficial radiation therapy Shortestremainingtime, a scheduling algorithm Special relativity theory Sam Rayburn Tollway...
the smallest original size. Shortestremaining processing time The next job to serve is the one with the smallest remaining processing requirement. Service...
The NTP algorithms on each computer interact to construct a Bellman–Ford shortest-path spanning tree, to minimize the accumulated round-trip delay to the...
four years. Minority governments generally last for a shorter period. The shortest minority government, Arthur Meighen's second government, lasted just under...
Quality of service and priority are extensions found in literature of the same time. VOQ scheduling is often referred to as "arbitration" (resolving the concurrent...
mathematical model for the time between job arrivals to a system. The simplest such process is a Poisson process where the time between each arrival is exponentially...
distribution) of a Markov chain, when such a distribution exists. For a continuous time Markov chain with state space S {\displaystyle {\mathcal {S}}} , transition...
the Lindley equation, Lindley recursion or Lindley process is a discrete-time stochastic process An where n takes integer values and: An + 1 = max(0, An + Bn)...
This is a list of the shortest airport runways in the world. While most modern commercial aircraft require a paved runway of at least 6,000 feet (1,800 m)...
Global Information