Operating System Ch5

CH5 5.3 Suppose that the following processes arrive for execution at the elongation indicatd ..... a.First-come First-servered | p1 | p2 | p3 | 0 8 12 13 ????????? [(8-0.0)+(12-0.4)+(13-1)]/3 = 10.53 b.SJF | p1 | p3 | p2 | 0 8 9 13 ????????[(8-0.0)+(9-1.0)+(13-0.4)]/3 = 9.53 c.??????????????????????0??????P1????? ?????????????????????? | wait | p3 | p2 | p1 | 0 1 2 6 14 [(2-1.0)+(6-0.4) +(14-0.0) ] / 3 = [ 1+5.6+14 ] / 3 = 6.86 5.6 Suppose that a schedule algorithm a.?????cpu??????I/O-bound????????????cpu-bound??? thirst? ??I/O-bound???????? central processor?I/O? 5.12 Considerthe following settle of process,with the length of ...... a. ??? | p1 |p2| p3 |p4| p5 | RR |p1|p2|p3|p4|p5|p1|p3|p5|p1|p5|p1|p5|p1|p5| p1 | SJF |p2|p4| p3 | p5 | p1 | antecedence |p2| p5 | p1 | p3 |p4| b.

FCFS RR SJF Priority p1 10 19 19 16 p2 11 2 1 1 p3 13 7 4 18 p4 14 4 2 19 p5 19 14 9 6 c.waitin time FCFS RR SJF Priority p1 0 9 9 6 p2 10 1 0 0 p3 12 5 2 16 p4 13 ! 3 1 18 p5 14 9 4 1 d.??????????? FCFS [0+10+11+13+14]/5 = 48/5 = 9.6sec SJF [(19-9)+(1-0)+(4-2)+(2-1)+(9-4)]/5 = 19/5 = 3.8sec RR [(19-9)+(1-0)+(3-1)+(5-3)+(19-9)]/5 = 24/5 = 4.8sec Pr [(18-16)+(6-1)+(19-18)+(21-19)+(16-6)] = 20/5 = 4sec ??SJF?? 5.21If you want to bring out down a full essay, order it on our website: BestEssayCheap.com

If you want to get a full essay, visit our page: cheap essay