I HC QUC GIA TP.

HCM
TRNG I HC CNG NGH THNG TIN

THI MN H IU HNH
THI GIAN LM BI : 90 PHT
(Sinh vin c php tham kho ti liu , cn b coi thi khng gii thch g thm)
1. Tr li ng hoc Sai cho mi pht biu di y :
(a)Trong h thng chia s thi gian (time sharing system), tiu chun thch hp nht cho
vic nh thi CPU l ti a ha li CPU (CPU utilization) (0,5)
(b) Gii thut nh thi Round Robin c th l non-preemtive (0,5)
(c) Trong gii thut preemptive priority scheduling tin trnh hoc thread ang thc thi
lun lun c u tin cao nht trong s nhng tin trnh hoc thread sn sng (0,5)
2. Phn bit 2 khi nim : Virtual Memory v Paging (1,5)
3. Cho 4 tin trnh v thi gian vo (Arrival Time) tng ng :
P1
P2
P3
P4

Arrival Time
0
2
3
5

CPU Burst Time

10
6
1
3

V s Gannt v tnh thi gian ch trung bnh (average wait time) v thi gian xoay
vng (average turnaround time) trung bnh cho cc gii thut nh thi
(a) First Come First Serve(FCFS) (1)
(b) Shortest Remaining Time First (SRTF) (1)
(c) Round Robin (RR) vi quantum = 4 (1)
4. Gi s h thng c 4 frames cn trng . Xc nh qu trnh thay th trang nh v tnh
s page fault s xy ra i vi chui tham chiu nh sau :
1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6
khi s dng nhng gii thut thay th trang sau :
(b)LRU ( 2)
(c) Optimal (2)
--HT

p n
1. (a). Sai (b).Sai (c).ng
2. Mi tin trnh c khng gian a ch logic phn bit vi a ch vt l ca b nh thc.
C ch Paging thc hin vic nh x t a ch logic sang a ch vt l theo nhng on
b nh gi l trang (page). Virtual memory cho php nhng tin trnh c kch thc ln
hn b nh vt l cho php c x l v thng c hin thc bng c ch paging.
3. a. First Come First Service (FCFS).
P1
0

P2
5

10

11

12

13

14

P3
15

16

17

P4
18

19

20

Thi gian xoay vng cho P1 l 10-0=10, cho P2 l 16-2=14 cho P3 l 17-3=14
v cho P4 l 20-5=15. Nh vy thi gian xoay vng trung bnh l :
(10+14+14+15)/4=13.25
Thi gian ch cho P1 l 0-0=0, cho P2 l 10-2 = 8, cho P3 l 16-3=13 v P4 l
17-5=12. Vy thi gian ch trung bnh l (0+8+13+12)/4 = 8.25
b. Shortest Remaining Time First.
P1
0

P2
1

P3
3

P2
4

P4

P2
8

10

11

P1
12

13

14

15

16

17

18

19

20

Thi gian xoay vng cho P1 l 20-0=20, cho P2 l 12-2=10 cho P3 l 4-3=1
v cho P4 l 8-5=3. Nh vy thi gian xoay vng trung bnh l
(20+10+1+3)/4=8.5
Thi gian ch cho P1 l 0-0=0, cho P2 l 2-2 = 8, cho P3 l 3-3=0 v cho P4
l 5-5=0. Vy thi gian ch trung bnh l (0+0+0+0)/4 = 0.
c. Round-Robin vi time quantum bng 4, b qua thi gian tiu tn cho context
switch . Chng ta gi s rng nhng tin trnh mi vo s c a vo cui ca
ready queue
P1
0

P2
2

P3
6

P1
9

10

11

P4
12

13

14

15

P2
16

17

P1
18

19

20

Thi gian xoay vng cho P1 l 20-0=20, cho P2 l 18-2=16 cho P3 l 9-3=6
v cho P4 l 16-5=11. Nh vy thi gian xoay vng trung bnh l
(20+16+6+11)/4=13.25
Thi gian ch cho P1 l 0-0=0, cho P2 l 4-2 = 2, cho P3 l 8-3=5 v cho P4
l 13-5=8. Nh vy thi gian ch trung bnh l : (0+2+5+8)/4 = 3.75
4.

LRU ,page fault =

Optimal, page fault =

10
8