CPU Scheduling (2-a)

The CPU–I/O burst cycle means process execution consists of:

Scheduling that occurs only when a process terminates or switches from running to waiting is:

Which module actually gives control of the CPU to the selected process?

Which scheduling criterion is the number of processes completed per time unit?

Which algorithm is optimal, giving the minimum average waiting time?

The preemptive version of SJF is called:

In priority scheduling, low-priority processes that may never execute suffer from:

The standard solution to starvation is:

If the Round Robin time quantum is very large, RR behaves like:

The 'convoy effect' is associated with which scheduling algorithm?

Maximum CPU utilization is obtained with multiprogramming.

In nonpreemptive scheduling, the OS can force a process off the CPU at any time.

Turnaround time should be maximized.

For processes P1=6, P2=8, P3=7, P4=3 (all arriving at time 0), non-preemptive SJF gives an average waiting time of 7.

In priority scheduling, the smallest integer usually represents the highest priority.

Dispatch latency is the time the dispatcher takes to stop one process and start another.

In Round Robin with n processes and quantum q, no process waits more than (n−1)q time units.

Preemptive scheduling is easier to implement than nonpreemptive scheduling.

In a multilevel feedback queue, a process can move between queues.

Response time is the time from submission until the first response is produced.

Match each scheduling criterion with its goal.

Match each algorithm with its hallmark.

Match each scheduling concept.

Match each SJF / priority term.

Match each multilevel-scheduling concept.