Question 6
Which scheduling algorithm is designed specifically for time-sharing systems?
Round Robin scheduling uses a fixed time quantum (slice) to give every process equal CPU time in a cyclic order, ideal for interactive time-sharing systems.
Which scheduling algorithm is designed specifically for time-sharing systems?
Round Robin scheduling uses a fixed time quantum (slice) to give every process equal CPU time in a cyclic order, ideal for interactive time-sharing systems.
What happens if the time quantum in Round Robin scheduling is set to an extremely large value?
If the time quantum is larger than the longest process burst time, processes execute without preemption, turning Round Robin into FCFS.
A situation where a high priority process is indirectly delayed by a lower priority process holding a required resource is -
Priority Inversion occurs when a high-priority process waits for a resource held by a low-priority process, while a medium-priority process preempts the low-priority one.
Priority Inheritance Protocol is used to solve which problem in real-time operating systems?
Priority Inheritance temporarily boosts the priority of a low-priority process holding a lock to match the highest priority waiting process, preventing priority inversion.
Which technique gradually increases the priority of processes that wait in the ready queue for a long time?
Aging is a technique used to prevent starvation of low-priority processes by gradually increasing their priority as time passes.