Goal

• Understand the criteria and methods of CPU scheduling

Reading Assignments

• MOS 2.5

Issues

• The non-preemptive scheduling in project 2 uses the First-Come-First-Serve (FCFS) method.  Compare this approach with the round-robin scheduling.  Under what condition the FCFS approach is preferred?  Under what condition the round-robin preemptive scheduling approach is better?
• Round-robin schedulers normally maintain a list of ready processes or threads, with occurring exactly once.  What would happen if a process or thread occurs more than once.  Is there a case you would like to do that?