1. Briefly define the following and discuss their major tradeoffs (advantages/costs). What problem are they addressing?
1. FCFS
2. SJF
3. Quantum
4. Affinity
5. NUMA
6. Round robin
2. Why would having multiple threads/processes executing help improve computer efficiency given typical process behavior in the CPU - I/O burst cycle?
3. Choose two of the criteria a scheduler tries to balance and explain how they are in tension (i.e., optimizing for one tends to hurt the other).
4. Envision a scenario where hard affinity might actually be a detriment.
5. Why is processor affinity considered when scheduling threads?
6. If you were working in a real-time environment, would you want preemptive or non-preemptive scheduling? Why?
7. If you had a typical multilevel queueing scheduler, where high priority processes were assigned smaller quantums, would it be worth it to insert some I/O into your CPU-bound program to try and execute faster?