Indicate which is a preemptive scheduling algorithm
Indicate which is a preemptive scheduling algorithm
The correct option is D Round-robin
Round robin is the
preemptive process scheduling algorithm. Each process is provided a fix time to
execute, it is called a quantum. Once a process is executed for a given time
period, it is preempted and other process executes for a given time period.
Round robin schedulingis similar to FCFS scheduling, except that CPU bursts are assigned with limits called time quantum. If
the process finishes its burst before the time quantum timer expires, then it
is swapped out of the CPU just like the normal FCFS algorithm.
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.
Round robin is the preemptive process scheduling algorithm. Each process is provided a fix time to execute, it is called a quantum. Once a process is executed for a given time period, it is preempted and other process executes for a given time period.
Round robin schedulingis similar to FCFS scheduling, except that CPU bursts are assigned with limits called time quantum. If the process finishes its burst before the time quantum timer expires, then it is swapped out of the CPU just like the normal FCFS algorithm.
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.
