COMPUTER SCIENCE AND ENGINEERING
SYSTEM SOFTWARE
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Shortest job first
|
|
|
shortest remaining time
|
|
|
First come first served
|
|
|
Multi-level feedback queues
|
Detailed explanation-1: -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.
Detailed explanation-2: -What Does Shortest Job First (SJF) Mean? Shortest job first is a scheduling algorithm in which the process with the smallest execution time is selected for execution next. Shortest job first can be either preemptive or non-preemptive. Owing to its simple nature, shortest job first is considered optimal.
Detailed explanation-3: -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.
Detailed explanation-4: -Preemptive shortest job first Preemptive means that if another process arrives with an even shorter burst time after the process with the shortest burst time and arrival time is given CPU time, the CPU cycle is allocated to the process with the shorter burst time.