Recent questions tagged process-scheduling

Explain how time quantum value and context switching time affect each other, in a round-robin scheduling algorithm.

Round-robin schedulers normally maintain a list of all runnable processes, with each process occurring exactly once in the list. What would happen if a process occurred t...

Consider three CPU intensive processes, which require $10$, $20$ and $30$ units of time and arrive at times $0$, $2$ and $6$ respectively. How many context switches are n...

A context switch from a process $P_{old}$ to a process $P_{new}$ consists of the following steps:Step I:saving the context of $P_{old}$;Step II: running the scheduling al...

In Multi-processing Operating Systems:(a) Maximum utilization of CPU can be achieved(b) Maximum throughput is achieved(c) Maximum security can be achieved(d) Not suitable...

Consider a preemptive priority scheduling algorithm based on dynamically changing priorities. Larger priority numbers imply higher priority. When a process is waiting for...

Which of the following scheduling algorithms could result in starvation ?$a. First-come$, $first-served$$b. Shortest$ $job$ $first$$c. Round$ $robin$$d. Priority$