Process Scheduling 1. Briefly describe the three types of processor scheduling. 2. Suppose that a scheduling algorithm (at the level of short-term CPU scheduling) favours those processes that have used the least processor time in the recent past. Why will this algorithm favour 1/O bound programs and yet NOT permanently starve CPU bound programs? 3. What is usually the critical performance requirement in an interactive operating system? 4. What is the difference between turnaround time and response time? 5. For process scheduling, does a low-priority value represent a low priority or a high priority? 6. What is the difference between preemptive and non-preemptive scheduling? 7. Many CPU-scheduling algorithms are parameterized. For example, the RR algorithm requires a parameter to indicate the time slice. Multilevel feedback queues require parameters to define the number of queues, the scheduling algorithms for each queue, the criteria used to move processes between queues, and so on. These algorithms are thus really sets of algorithms (for example, the set of RR algorithms for all time slices, and so on). One set of algorithms may include another (for example, the FCFS algorithm is the RR algorithm with an infinite time quantum). What (if any) relation holds between the following pairs of sets of algorithms? a. Priority and SJF b. Multilevel feedback queues and FCFS c. Priority and FCFS d. RR and SJF 8. Consider the following set of processes, with the length of CPU-burst time given in milliseconds. The processes are assumed to have in the order P1,P2,P3,P4,P5, all at time 0 . a. Draw Gantt charts illustrating the execution of these processes using FCFS, SJF, a nonpreemptive priority (a smaller priority number implies a higher priority), and RR (quantum =2 ) scheduling. b. What is the turnaround time of each process for each of the scheduling algorithms in part a