Documentos de Académico
Documentos de Profesional
Documentos de Cultura
thut ton Banker chng minh khng tn ti trng thi an ton thay v phi tnh ra ht tt c
cc trng hp th mnh c ny :
ta c i theo mt hng bt k, min n cn tn ti tin trnh k tip cho ti khi n khng cn
tin trnh no c th thm vo chui na.
Gi s ta c chui < P1,P0,P3> ri cn li 2 tin trnh P4 v P2 khng ti nguyn i
vo. Lc ny ta c th suy ra khng tn ti chui an ton.
V nu gi s tn ti mt chui an ton chng hn l
th ta bt u xt t tin trnh Pa xem Pa c th thm vo sau P3 trong chui trn hay khng,
v Pa l tin trnh u tin ca chui an ton nn n khng cn s trao tr ti nguyn ca tin
trnh no trc n. Nu Pa khng thm vo c th do Pa tn ti sau P3 ri c th l P1
hay P0, v nh vy nu Pa thm vo ri th ta c th thm Pb v Pb cn Pa thc hin xong
th n mi c th thc hin. C nh vy th suy ra sau P3 lun tn ti mt tin trnh c th
thm vo --> Nu tn ti mt chui an ton th ta lun tm ra chui an ton khc cho d c i
t tin trnh no trc v chn la nh th no. Ngc li th --- > khng tn ti chui an
ton.
1. Mt h thng c 5 tin trnh vi tnh trng ti nguyn nh sau:
2. Process Allocation
3.
Max
Available
C
4. P0 0
5. P1 1
6. P2 1
7. P3 0
8. P4 0
B
0
(1 im)
11. b. Xc nh c nn p ng yu cu (0, 4, 3, 0) ca P1 ?
(1 im)
12. Gii:
13. a. Xt ti thi im T0 m 5 tin trnh c cp pht nh bi ta c:
14.
17. P0 0
18. P1 0
19. P2 1
20. P3 0
21. P4 0
22.
23.
Tm chui an ton:
24.
Work >=
Need[i]
P[i] Allocation[i]
25. A B C D
A B C D
26. 1
0 0 0 0
P0 0 0 1 2
27. 1
1 0 0 2
P2 1 3 5 4
28. 2
0 0 2 0
P3 0 6 3 2
29. 2
14 11 8
0 4 4 2
P4
30. 2
15 12 12
0 7 5 0
P1 1 0 0 0
A B C D
0 1 1 4
31. Vy ti thi im T0 tn ti chui an ton {P0, P2, P3, P4, P1}. Suy ra, h thng ti thi i
m T0 trng thi an ton.
32.
P4 110
Theo thut ton kim tra tnh an ton ca h ta c:
Work := Available = (2,5,3)
Finish[i]=False vi i= 0,1,2,3,4.
Xt :
Need[0] >= Work => finish[0]=false
Need[2] >= Work => finish[0]=false
{C phi v :
Need[0]=(5,0,1) > Work=(2,5,3)
Need[2]=(4,2,1) > Work=(2,5,3)}
Need[1] < = Work => Finish[1] = True v Work=Work + Allocation[1] = (2,5,3) + (2,2,1) =
(4,7,4).
Need[3] < = Work => Finish[3] = True v Work=Work + Allocation[3] = (4,7,4) + (1,2,1) =
(5,9,5).
Need[4] < = Work => Finish[4] = True v Work=Work + Allocation[4] = (5,9,5) + (4,1,2) =
(9,10,7).
Need[0] < = Work => Finish[0] = True v Work=Work + Allocation[0] = (9,10,7) + (2,5,2) =
(11,15,9).
Need[2] < = Work => Finish[2] = True v Work=Work + Allocation[2] = (11,15,9) + (5,1,1) =
(16,16,10).
{C phi v :
Need[1],Need[3],Need[4] < Work Ta xt ln lt t trn xung.
Need[1]=(1,0,2) < Work = (2,5,3)
Need[3]=(1,0,2) < Work = (2,5,3)
Need[4]=(1,1,0)< Work = (2,5,3)
Sau quay li xt cc Need[0],Need[2] ln lt t trn xung di.
Need[0]=(5,0,1) < Work = (2,5,3)
Need[2]=(4,2,1) < Work = (2,5,3)}
Nh vy finish[i] = true vi I = 1,3,4,0,2 dn n dy tin trnh P1, P3, P4, P0, P2 l dy an ton
=> h thng trng thi an ton.
Bi tp ny mnh ly bi trn mng v h cho p n trng thi an ton l : P1, P2, P0, P3, P4
vy em lm sai u ????
Cch gii bi tp ca mnh nh vy v thut ton v cch hiu nh vy c sai ko ????
Mnh mong cc bc xem gip em vi .