Shortest Job First - Operating System

Q.  We have a uniprocessor machine where a set of n tasks with known run times r1, r2, r3,….rn are to be run. What will be the maximum throughput result of the processor scheduling algorithm?
- Published on 27 Aug 15

a. Shortest Job First
b. First Come First Served
c. Round Robin
d. Highest Response Ratio Next

ANSWER: Shortest Job First

Related Content

 

    Discussion

  • Nirja Shah   -Posted on 12 Nov 15
    Shortest Job First
    - It is a scheduling policy that selects the waiting process with the smallest execution time to execute next.

    - It is a non-preemptive algorithm.

    - It 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.

➨ Post your comment / Share knowledge


Enter the code shown above:

(Note: If you cannot read the numbers in the above image, reload the page to generate a new one.)
▲