You have to apply FCFS and SJF (non-preemptive) scheduling algorithms on the following given processes (considering all
Fantastic news! We've Found the answer you've been seeking!
Question:
- You have to apply FCFS and SJF(non-preemptive) scheduling algorithms on the following given processes (considering all the processes arrive in the ready queue at time =0) and calculate the average waiting time for each algorithm. Keeping in view the waiting time, you have to identify which of the two algorithms is better?
Processes | Burst Time |
P1 | 4 |
P2 | 2 |
P3 | 1 |
P4 | 10 |
Related Book For
Operations and Supply Chain Management The Core
ISBN: 978-1259696596
4th edition
Authors: F. Robert Jacobs, Richard Chase
Posted Date: