Question

Consider three processes (process id 0, 1, 2 respectively) with compute time bursts 2, 4 and 8 time units. All processes arrive at time zero. 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. The average turn around time is: (a)13 units (b)14 units (c)15 units (d)16 units

Answer 1

Answer:

Consider three processes (process id 0, 1, 2 respectively) with compute time bursts 2, 4 and 8 time units. All processes arrive at time zero. Consider the longest remaining time first (lrtf) scheduling algorithm.