COMPUTER SOFTWARE
OPERATING SYSTEMS
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
Which of the following best describes the ‘shortest remaining time’ scheduling algorithm?
|
|
Processes that are estimated to have the shortest execution time are run first but can be returned to the ready queue by time slicing
|
|
|
Processes that are estimated to have the shortest execution time are run first until they are complete
|
|
|
Processes that are estimated to have the shortest execution time are run first although they may return to the ready queue before completion if a shorter job arrives
|
|
|
Processes are executed in the order they arrive in the ready queue
|
Explanation:
Detailed explanation-1: -Preemptive SJF: It is also known as shortest remaining time first scheduling.
Detailed explanation-2: -Shortest remaining time first scheduling This algorithm is the preemptive version of the shortest job first (SJF) scheduling or the shortest job next (SJN). In this SRTF scheduling, the process with the least burst time remaining is executed first.
There is 1 question to complete.