Ch. 6 - Scheduling Flashcards
1
Q
Scheduling
A
A set of policies and mechanisms to control the order of work to be performed by a computer system.
2
Q
I/O Bound
A
Lots of I/O, Short CPU bursts (eg. interactive jobs)
3
Q
CPU Bound
A
Little I/O, Long CPU bursts
4
Q
How can one classify a process as I/O bound or CPU bond?
A
Need to extrapolate process execution to determine the duration of the next CPU burst. Can use a Simple Moving Average (SMA) or an Exponential Moving Average (EMA)
5
Q
Long-Term Scheduling
A
6
Q
Medium-Term Scheduling
A
7
Q
Short-Term Scheduling
A
8
Q
How can we eliminate starvation of jobs that don’t get the CPU?
A
Add an age factor. Jobs that have been waiting for a long time are prioritized over newer jobs.
