shortest job first - meaning and definition. What is shortest job first
Diclib.com
Online Dictionary

What (who) is shortest job first - definition

SCHEDULING POLICY
Shortest Job Next; Shortest Job First; Shortest job first; Draft:Weighted Shortest Job First; SJF scheduling; Shortest job first scheduling
  • Shortest job next being executed

shortest job first         
<algorithm> A scheduling algorithm used in multitasking operating systems that favours processes with the shortest estimated running time. (1998-04-25)
Shortest job next         
Shortest job next (SJN), also known as shortest job first (SJF) or shortest process next (SPN), is a scheduling policy that selects for execution the waiting process with the smallest execution time. SJN is a non-preemptive algorithm.
Shortest seek first         
DISK-SCHEDULING ALGORITHM
SSTF; Shortest seek time first; Shortest seek time first scheduling; SSTF scheduling
Shortest seek first (or shortest seek time first) is a secondary storage scheduling algorithm to determine the motion of the disk read-and-write head in servicing read and write requests.

Wikipedia

Shortest job next

Shortest job next (SJN), also known as shortest job first (SJF) or shortest process next (SPN), is a scheduling policy that selects for execution the waiting process with the smallest execution time. SJN is a non-preemptive algorithm. Shortest remaining time is a preemptive variant of SJN.

Shortest job next is advantageous because of its simplicity and because it minimizes the average amount of time each process has to wait until its execution is complete. However, it has the potential for process starvation for processes which will require a long time to complete if short processes are continually added. Highest response ratio next is similar but provides a solution to this problem using a technique called aging.

Another disadvantage of using shortest job next is that the total execution time of a job must be known before execution. While it is impossible to predict execution time perfectly, several methods can be used to estimate it, such as a weighted average of previous execution times. Multilevel feedback queue can also be used to approximate SJN without the need for the total execution time oracle.

Shortest job next can be effectively used with interactive processes which generally follow a pattern of alternating between waiting for a command and executing it. If the execution burst of a process is regarded as a separate "job", the past behaviour can indicate which process to run next, based on an estimate of its running time.

Shortest job next is used in specialized environments where accurate estimates of running time are available.