Question: In a uniprocessor system, five processes arrive at different times. The processing time for each process is listed in following table. Process | A B

In a uniprocessor system, five processes arrive at different times. The processing time for each process is listed in following table. Process | A B D E Arrival time 0 1 3 5 7 Processing time 4 3 2 5 1 a) Complete the following timeline table for different scheduling policies, namely, First-Come- First Served (FCFS), Round Robin with time quantum of 3 (RR =3), Shortest Job First (SJF) and Shortest Remaining Time First (SRTF). (16 marks) Time 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 Arrive A4 B3 C2 D5 E1 Policy Queue b) Find the Finish Time, Turnaround Time and Waiting Time for each scheduling policy. (8 marks) c) Find the average for Finish Time, Turnaround Time and Waiting Time for FCFS scheduling policy. (4 marks) d) Comment on which scheduling policy is better. (2 marks)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
