Monday, January 29, 2007

OS 6

CPU Scheduling
All I/O devices + CPU busy = n+1 fold speedup
CPU vs. I/O bursts
Universal Scheduling
What is the best way to run n processes on k nodes where n < k?
latency vs. throughput conflicts
speed vs. fairness
halting problem derivatives
How do Markov Chains and rival processes work?
Allocate resources across dimensions of time and space.
FIFO is the simplest scheduling algorithm.
Describe the Convoy Effect.
Round Robin Scheduling
You have to amortize the cost of context switches over the timeslice time.
What is "Priority Donation"?
Shortest Time to Completion First (STCF)?
Prove STCF given jobs a, b, c, & d.
How do you know a job's length?
Shortest Seek Time First (SSTF)
Which operations are most expensive?
Describe the Elevator Algorithm.
Use multi-level feedback queue (aka exponential Q)

No comments: