CS 3733 Operating Systems, Spring 1999 Assignment 2 Comments

Warning: This is not for the current semester. 

Assignment 2 notes: Spring 1999

1. Note that the CPU burst determines how the scheduling algorithm behaves,
   not the duration.
2. However, if the duration is shorter than the CPU burst time, there will
   be only one CPU burst.
3. If there is only one CPU burst, SJFA will not be a good approximation to SJF
4. If there is too much I/O and not very many processes, then there will only
   be one process in the ready queue at a time and the scheduling algorithm
   makes no difference.
5. Simple experiments are often better than complicated ones.
Solutions to this assignment are available below: