Shortest remaining time

Shortest remaining time is a method of CPU scheduling 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, processes will always run until they complete or 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. However, it has the potential for process starvation for processes which will require a long time to complete if short processes are continually added, though this threat can be minimal when process times follow a heavy-tailed distribution. [http://portal.acm.org/ft_gateway.cfm?id=762486&type=pdf&coll=ACM&dl=ACM&CFID=70737957&CFTOKEN=89892650]

Like shortest job next scheduling, shortest remaining time scheduling is rarely used outside of specialized environments because it requires accurate estimations of the runtime of all processes that are waiting to execute.

ee also

*Scheduling

It doesn't use RR if two processes are of the same length because of overhead space.


Wikimedia Foundation. 2010.

Look at other dictionaries:

  • Shortest-Remaining-Time — Ein Prozess Scheduler (Scheduler = Steuerprogramm) ist eine Arbitrationslogik, der die zeitliche Ausführung mehrerer Prozesse in Betriebssystemen regelt. Prozess Scheduler kann man grob in unterbrechende (preemptive) und nicht unterbrechende (non …   Deutsch Wikipedia

  • Shortest-Processing-Time — Shortest Job First (SJF) ist ein nonpräemptives Scheduling Verfahren, das eingesetzt wird, um rechenwillige Threads oder/und Prozesse auf die physischen Prozessoren des Rechners zu verteilen. Abwandlungen dieses Scheduling Verfahrens sind… …   Deutsch Wikipedia

  • Short Remaining Time — Shortest remaining time (« le plus court temps restant ») (ou parfois Short remaining time first, « le temps restant court en premier ») est une méthode d ordonnancement des tâches dans un ordinateur. Shortest remaining time… …   Wikipédia en Français

  • Shortest-Job-First — (SJF) ist ein nonpräemptives Scheduling Verfahren, das eingesetzt wird, um rechenwillige Threads oder/und Prozesse auf die physischen Prozessoren des Rechners zu verteilen. Abwandlungen dieses Scheduling Verfahrens sind Shortest Processing Time… …   Deutsch Wikipedia

  • Shortest-Process-Next — Shortest Job First (SJF) ist ein nonpräemptives Scheduling Verfahren, das eingesetzt wird, um rechenwillige Threads oder/und Prozesse auf die physischen Prozessoren des Rechners zu verteilen. Abwandlungen dieses Scheduling Verfahrens sind… …   Deutsch Wikipedia

  • Shortest-Job-Next — Shortest Job First (SJF) ist ein nonpräemptives Scheduling Verfahren, das eingesetzt wird, um rechenwillige Threads oder/und Prozesse auf die physischen Prozessoren des Rechners zu verteilen. Abwandlungen dieses Scheduling Verfahrens sind… …   Deutsch Wikipedia

  • Shortest job next — (SJN) (also known as Shortest Job First (SJF)) is a scheduling policy that selects the waiting process with the smallest execution time to execute next.Shortest job next is advantageous because of its simplicity and because it maximizes process… …   Wikipedia

  • Shortest job first — En informatique, SJF est l’acronyme de Shortest Job First (« plus court processus en premier »). Il désigne une méthode d ordonnancement des processus. Il s’agit d’un algorithme d ordonnancement, c est à dire d’un algorithme servant à… …   Wikipédia en Français

  • Open Shortest Path First — (OSPF) is an adaptive routing protocol for Internet Protocol (IP) networks. It uses a link state routing algorithm and falls into the group of interior routing protocols, operating within a single autonomous system (AS). It is defined as OSPF… …   Wikipedia

  • Daylight saving time around the world — legend|#c00000|Areas that never had DST Daylight saving time around the world, showing usage and a short history by location in alphabetic order. Africa The only African countries which use daylight saving time are: *Canary Islands From last… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”

We are using cookies for the best presentation of our site. Continuing to use this site, you agree with this.