Shortest Remaining Time Next (SRTN) Scheduling may be implemented
Shortest Remaining Time Next (SRTN) Scheduling may be implemented
The correct option is D Both 1 and 2
Shortest remaining time next (SRTN) scheduling may be implemented preemptive.
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.
A scheduling discipline
is preemptive if,
once a process has been given the CPU can take away. The strategy of allowing
processes that are logically run able to be temporarily suspended is called preemptive scheduling and it is contrast to the "run to
completion" method. The scheduling in which a running process cannot be
interrupted by any other process is called non-preemptive
scheduling.
Shortest remaining time next (SRTN) scheduling may be implemented preemptive.
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.
A scheduling discipline is preemptive if, once a process has been given the CPU can take away. The strategy of allowing processes that are logically run able to be temporarily suspended is called preemptive scheduling and it is contrast to the "run to completion" method. The scheduling in which a running process cannot be interrupted by any other process is called non-preemptive scheduling.
