1,482 views
2 votes
2 votes

With the use of SRTF the execution of three processes is as follows, the process A is scheduled first and A has been running for 6 units of time, the process B is arrived process B ran for 2 units of time, later process C is arrived and completed running in 4 units of time. Find the minimum possible burst time of the process A and B.

  1.   9, 6
  2.   10, 6
  3.   2, 8
  4.   11, 7

2 Answers

Best answer
6 votes
6 votes
Suppose burst time of A is x, its mention A has already run for 6 unit of time, so Remaining Burst time for A is x-6, now it get preempted by B
Now Suppose Burst time of B is y, its mention B has already run for 2 unit of times before getting preempted by C, so remaining burst time for B is y-2.
Now C run for 4 unit of time.

Now given B is preempted by C, so C has shortest BT as compare to B, i.e minimum value of y-2 must be 5, then only it get preempted by C

Therefore y-2 = 5, so y = 7.

Similarly x-6 = 8, and x = 14

Therefore burst time of A and B is 14 and 7, which is not matched by any option, so none of the above.
selected by

Related questions

1 votes
1 votes
1 answer
1
Nandkishor3939 asked Jan 17, 2019
2,778 views
I have solved this but not getting the answer…. will any one verify its correctness plzThank you:)
0 votes
0 votes
1 answer
2
iarnav asked Jul 17, 2018
834 views
Let's say we have four processes as (P1, P2, P3, P4) and have Arrival time as (0,1,2,3) respectively, but all of them has same CPU Burst time as (10ms) then does SRTF wil...