Topic: Uniprocessor Scheduling

You were given five processes with their arrival time and execution time for each in the table. A scheduling algorithm is used to estimate the CPU time required to allocate to the processes and threads. The prime goal of any CPU scheduling algorithm is to keep the CPU as busy as possible for improving CPU utilization

Question 1 : Develop the schedule (time diagram) for the following Operating System Scheduling Algorithms

1. First-Come-First-Served (FCFS)
2. Round Robin
3. Shortest Process Next (SPN)

Assume the length of the time quantum, or slice is 1 (q=1)

ProcessArrival TimeExecution TimeP 109P 226P 335P 458P 572

Question 2 : Consider the expectations below :Which one you would use? Explain your response.

Expectations:

Average waiting time should be smaller than FCFS Performance of the scheduling algorithm should archived in minimum average waiting time ( Fast)