Chapter 6 - CPU Scheduling

Question 1

What does process execution consist of?

Answer 1

A cycle of CPU execution and I/O wait

Question 2

When do CPU scheduling decisions take place?

Answer 2

Switches from…

1) Running to waiting
2) Running to ready
3) Waiting to ready
4) When a process terminates

Question 3

Which situations lead to preemptive CPU scheduling decisions?

Answer 3

Process switches from running or waiting to ready

Switching from running to ready and termination are non-preemptive

Question 4

What is a dispatcher module?

Answer 4

Give control of the CPU to the process selected by the short-term scheduler

Question 5

What is dispatcher latency?

Answer 5

The time it takes for the dispatcher to stop one process and start another

Question 6

How are scheduling algorithms chosen?

Answer 6

Based on optimization criteria like throughput and turnaround time

Question 7

What are some scheduling algorithms?

Answer 7

FCFS, SJF, Shortest-Remaining-Time-First, Round Robin, Priority

Question 8

What is the Round Robin algorithm?

Answer 8

Scheduling algorithm that uses small time quantums that can result in large amounts of context switches

Question 9

What can Priority Scheduling result in?

Answer 9

Starvation, which can be solved by aging a process (as time progresses increase the priority)