Part III: Process Scheduling

Provide analysis of the process queues in the problems below.

Problem 1: You are running an application in which five processes are started nearly simultaneously, i.e., assume their arrival time = 0. Their estimated time to execute (i.e., their needed CPU time/cycle) are as follows:

P1 = 3 ms, P2 = 11 ms, P3 = 16 ms, P4 = 6 ms, P5 = 2 ms

1. [Question]Answer the four questions below for FIFO (First-In-First-Out Scheduling)
   1. In what order do the processes run?
   2. What is the total turnaround time required for all processes(it would be incorrect if you simply add the numbers above together)?
   3. What is the average turnaround time for the five processes? (Add the total time required foreach process and divide by the number of processes.)

2.[Question] Now answer the same set of questions for SJF (Shortest-Job-First) Scheduling

3.[Question]How do the scheduling algorithms compare in performance for this particular case(turnaround time)?