Consider the longest remaining time first (LRTF) scheduling algorithm. In LRTF ties are broken by giving priority to the process with the lowest process id. Calculate the average waiting time.
2 years ago
Operating System
| Process | Burst Time | Arrival time |
| P1 | 4 | 0 |
| P2 | 2 | 1 |
| P3 | 5 | 2 |
Consider the longest remaining time first (LRTF) scheduling algorithm. In LRTF ties are broken by giving priority to the process with the lowest process id. Calculate the average waiting time.
Solution:
Hence,
Average waiting time = (5+6+7)/3 =6
Waiting time for
P1 = 0+3+2 = 5
P2 = 2+2+2 = 6
P3 = (6-1) +2 = 7
Rajiv Shah
Oct 20, 2021