OS 7

O/S Scheduling
Does the nth job need to run in approximately 1/n of the the CPU?
How do RR, FIFO, SJF scheduling algorithms affect the time to run n?
How does the O/S predict a process' future needs based on past usage?
How does Lottery Scheduling work?
How does scheduling change as you have more complete information about a set of processes?
Real-Time Scheduling
soft real-time vs. hard real-time
soft - e.g. display video frame every 30th of second
hard - e.g. anti-lock brakes on a car
Which jobs do you keep in memory?
How do you determine which subset gets written to disk?
How could Mitzenmacher prove his result?
Does it converge to optimal?