MOT SO BAI TAP CAN CHU Y !!!

Round-Robin, SJFS, B nh o, Bng FAT, Thut gii Nh bng, Sn xut-Tiu

th (semFull-semEmpty), Dining-Philosopers (deadlock, khng deadlock).
Thut gii Nh bng...........................................................................................................1
Round-Robin, SJFS,............................................................................................................3
bi tp phn on, tnh a ch vt l cho a ch logic......................................................7
bi tp phn on, tnh a ch vt l cho a ch logic c trng hp khng hp l. .9
Bng FAT,.........................................................................................................................11
RAG...................................................................................................................................13
B nh o.........................................................................................................................14
Sn xut-Tiu th (semFull-semEmpty),.........................................................................18
Dining-Philosopers (deadlock, khng deadlock)...............................................................21
BI TP H IU HNH
Thut gii Nh bng
Cu 1:
Mt h thng c 3 bng t v 3 tin trnh P1, P2, P3 vi trng thi cp pht ti
nguyn thi im Ti th hin bng vc-t Allocation = (1, 0, 1) v Max = (1, 2,
2):
Dng thut gii nh bng :
a. Chng minh trng thi ny an ton. (1 im)
b. Xc nh c nn p ng hay khng yu cu xin thm 1 na ca ca P3 ? (1
im)
Gii:
a. Xt ti thi im Ti m 3 tin trnh c cp pht nh bi ta c:

Vi: Need[i] = Max[i] Allocation[i] v Available = 3 (1 + 0 + 1) = 1

Tm chui an ton:

Vy ti thi im T0 tn ti chui an ton {P1, P2, P3}. Suy ra, h thng ti thi
im Ti trng thi an ton.
b. Ta thy, yu cu thm 1 na ca P3 tho cc iu kin:
o Request3 <= Need3 v Request1 <= Available
1

o Hn na vic cp pht thm 1 na cho P3 th h thng vn trng thi an ton v

tn ti chui an ton {P1, P3, P2} trong khi ti nguyn trong h thng khng cn na.
Tht vy:

Do vy ta c th cp thm cho yu cu xin thm 1 ca P3 ti thi im ny.

Cu 2
Mt h thng c 3 bng t v 3 tin trnh P1, P2, P3 vi trng thi cp pht ti
nguyn ti thi im Ti th hin bng cc vc-t Allocation=(0, 2, 1) v Max=(2, 2, 2).
Dng thut gii Nh bng :
a. Chng minh trng thi ny an ton (1,0 im)
b. Xc nh c p ng c hay khng yu cu xin thm 1 na ca P2 (1,0 im)
Tr li:
a. Chng minh trng thi ti thi im Ti an ton:
- Tnh Need = Max Allocation = (2, 0, 1)
- Tnh Available=3-(0+2+1)=0
- Theo thut gii Nh bng, tm c 2 chui an ton l:

Do tn ti t nht 1 chui an ton (chui no cng c), trng thi h thng ti thi
im Ti l an ton.
b. Xc nh c p ng c hay khng yu cu xin thm 1 na ca P2:
Khng c v:
- Need2=(2-2)=0, ngha l ht hn mc n nh cho P2.
- Mt khc, Available=0, ngha l h khng cn bng no.
Cu 3.
Mt h thng c 5 tin trnh vi tnh trng ti nguyn nh sau:
Process
P0
P1

Allocation
Max
Available
A B C D A B C D A B C D
0 0 1 2 0 0 1 2 1 5 2 0
1 0 0 0 1 7 5 0
2

P2
P3
P4

1 3 5 4 2 3 5 6
0 6 3 2 0 6 5 2
0 0 1 4 0 6 5 6

Dung thuat giai Nha bang e:

a. Chng minh trng thi ny an ton.
(1
im)
b. Xc nh c nn p ng yu cu (0, 4, 3, 0) ca P1 ?
(1
im)
Gii:
a. Xt ti thi im T0 m 5 tin trnh c cp pht nh bi ta c:
Need[i] = Max[i] Allocation[i]
Need
Process
A B C D
P0
0 0 0 0
P1
0 7 5 0
P2
1 0 0 2
P3
0 0 2 0
P4
0 4 4 2
Tm chui an ton:
Work >=
Need[i]
P[i]
Allocation[i]
A B C D
ABCD
ABCD
1 5 2 0
0 0 0 0
P0
0 0 1 2
1 5 3 2
1 0 0 2
P2
1 3 5 4
2 8 8 6
0 0 2 0
P3
0 6 3 2
2 14 11 8
0 4 4 2
P4
0 1 1 4
2 15 12 12
0 7 5 0
P1
1 0 0 0
Vy ti thi im T0 tn ti chui an ton {P0, P2, P3, P4, P1}. Suy ra, h
thng ti thi im T0 trng thi an ton.
b. Ta thy, yu cu thm (0, 4, 3, 0) ca P1 tho iu kin Request1 Need1,
nhng khng tho iu kin: Request1 Available v ti nguyn C trong h
thng ch cn 2 m yu cu 3. Do vy, khng th cp pht thm (0, 4, 3, 0) cho
P1 c.

Round-Robin, SJFS,
Cu 2
Mt h thng c 3 tin trnh vi thi im n v thi gian s dng CPU nh sau:

Tin trnh Thi im n (ms) CPU-Burst (ms)

P1

37

P2

10

20

P3

24

14

Dng thut gii Round-Robin vi thi lng 10 ms iu phi CPU:

a. Th hin bng biu Gantt (1,0 im)
b. Tnh thi gian ch trung bnh ca cc tin trnh (1,0 im)
Tr li:
a. Th hin bng biu Gantt:

b. Thi gian ch trung bnh ca cc tin trnh:

(34+13+29)/3 = 76/3 = 25,3 ms
Cu 4
Mt h thng c 3 tin trnh vi thi im n v thi gian s dng CPU nh sau:
Tin trnh Thi im n (ms) CPU-Burst (ms)
P1

47

P2

23

15

P3

45

28

Dng thut gii Round-Robin vi thi lng bng 20 ms iu phi CPU:

a. Th hin bng biu Gantt (0,5 im)
b. Tnh thi gian ch trung bnh ca cc tin trnh (0,5 im)
Tr li:
a. Th hin bng biu Gantt:

b. Tnh thi gian ch trung bnh ca cc tin trnh:

- Thi gian ch ca cc tin trnh:
P1 = 35 ms
P2 = 2 ms
P3 = 22 ms
- Thi gian ch trung bnh = ( 35 + 2 + 22 ) / 3 = 59 / 3 = 19,66 ms

bi tp phn on, tnh a ch vt l cho a ch logic

sau khi tm hiu v bi tp ny, mnh post ln cho mi ngi cng trao i
GII
1. V vng b nh Vt l dng cc on segment
T bng d liu bi

Ta v c vng b nh vt l nh sau:

Cc bn nhn vo hnh mnh hng dn cch tnh v cch v, cc bn ch phn

mu ch mnh s dng nhn ra d hn.
Vi segment 0: ta c
+ a ch vt l c s (basic) l 300
+ Limit l 700
==> a ch vt l ca segment 0 l t 300 -> 1000
Vi segment 1:
+ a ch vt l c s (basic) l 1200, nn ta s v bt u t 1200, nh vy t 1000>1200 l trng, khng c segment no
+ Limit l 500
==> a ch vt l ca segment 1l t 1200 -> 1700
v segment 2 cc bn tnh tng t
2. Cch tnh a ch logic

Tnh a ch vt l
+ Vi d liu bi cho l (1,200), ta xc nh: tnh a ch vt l ca segment 1, a
ch logic l 200 (lu : gi tr X tnh c ny nm trong segment 1 hay ko (1200<=
X<= 1700))
===> (1,200) = 1200 + 200 = 1400 (hp l v < 1700)
+ (1,0) = 1200 + 0 = 1200 (hp l)
+ (0,700) = 300 + 700 = 1000 (hp l)
+ (2,0) = 2000 + 0 = 2000 (hp l)
+ (2, 600) = 2000 + 600 = 2600 (hp l)
Nhn xt: tnh a ch vt l cho cc a ch logic th cc a ch logic ny hok
c vt qu gii hn (limit) ca segment tng ng ang xt
Mong cc bn trao i chng ta n tp c tt hn nha
Mt s trng hp khng hp l mnh a ra nh sau:
+ (0,800) --> khng hp l v 800 > 700 (limit ca segment 0)
+ (2,650) --> khng hp l v 650 > 600 (limit ca segment 2)
+ (1,501) --> khng hp l v 501 > 500 (limit ca segment 1)
Tm li nu nhn thy a ch logic m bi cho > limit ca segment th kt lun
ngay l khng hp l

bi tp phn on, tnh a ch vt l cho a ch logic c trng hp khng hp

l
Gi s c Bng on sau:

Hy tnh a ch vt l cho mi a ch l-gic sau:

a. 0430

b. 1010
c. 2500
d. 3400
e. 4112
gii
Tnh a ch vt l
+ Vi d liu bi cho l (0,430) = 219 +430 = 649 ( hp l) V n nm trong on
Segment 0.
+ (1,010) = 2300+ 10 = 2310 (hp l)
+ (2,500) = 90 + 500 = 1400 (khng hp l)
+ (3,400) = 1327+ 400 = 1727 (hp l)
+ (4,112) = 1952 + 112 = 2064 (khng hp l)

=>Vi cc a ch logic (0,430); (1,010); (1,500); (3,400); (4,112) ta c cc a ch

vt l tng ng l 649; 2310; khng hp l;1727; khng hp l.

10