Question

Preemptive scheduling

• A. A preemptive SJF algorithm will preempt the currently executing process.
• B. Preemptive SJF scheduling is sometimes called shortest remaining time first scheduling
• C. Both (1) and (2)
• D. None of these

Answer 1

The correct option is D None of these

Preemptive scheduling:-

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. Context switching is used to save states of preempted processes.

Preemption is the act of temporarily interrupting a task being carried out by a computer system, without requiring its cooperation, and with the intention of resuming the task at a later time. Such changes of the executed task are known as context switches.

The strategy of allowing processes that are logically runable to be temporarily suspended is called preemptive scheduling and it is contrast to the "run to completion" method.