N TP THI H IU HNH

Phn 2: T lun
Cu 1: (2.0 ) Xt tp hp cc tin trnh sau: Thi im vo Thi gian Tin trnh RL CPU P1 0 7 P2 3 3 P3 4 2 P4 5 1 P5 6 5 a. Hy cho bit kt qu iu phi theo cc chin lc: Round Robin vi q = 4, SJF c quyn b. Tnh thi gian ch cho tng tin trnh v thi gian ch trung bnh. Cu 2. Cho mt bng thng tin tin tnh sau: Tin trnh Thi im vo RL Thi gian CPU P1 0 5 P2 1 9 P3 2 1 P4 3 3 P5 4 2 Hy thc hin iu phi tin trnh theo bng thng tin trn vi chin lc SJF khng c quyn. Tnh thi gian ch, thi gian p ng v trung bnh cng ca chng ca tng tin trnh. Cu 1B: Cho bng d liu sau: CPU I/O-1 Tin Trnh Thi im Thi gian Thi im Thi gian vo RL CPU IO IO P1 0 6 2 2 P2 3 2 1 3 P3 5 5 3 5 P4 6 2 0 0 P5 8 2 1 4 V biu iu phi CPU v IO theo nguyn l h iu hnh x l theo l v theo l a chng. Theo biu va v tnh: thi gian ch trung bnh, thi gian p ng trung bnh v hiu sut c ch CPU. Cu 2: (2.0) Cho bng m t tnh trng h thng sau: Allocation Max A B C D A B C D P1 1 2 0 1 4 4 1 1 P2 1 0 1 1 7 5 6 2 P3 1 1 1 1 7 2 5 1 P4 2 2 0 1 4 2 3 1 P5 0 2 0 1 7 4 5 2 Ti nguyn A (c 7 thc th), B (7 thc th), C (6 thc th), D (5 thc th). 1. Tnh ra ma trn Need v Available 2. Thc hin gii thut Banker kim tra trng thi ca h thng Nu h thng an ton ch ra chui tin trnh an ton Nu h thng khng an ton hy lit k ra chui cc tin trnh cp pht v khng cp pht ti nguyn.

Cu 1: (2.0 ) Xt tp hp cc tin trnh sau: Mt ti khon ngn hng vi hai ngi dng truy xut, chy trn h thng chia s thi gian. Mt thao tc rt tin gm kim tra tin rt c khng? Nu : ghi nht k cp nht ti khon nh tin Nu khng: bo li Chng trnh v h thng my c th b li g? Dng phng php ng b (SEMAPHORE V LOCK) khc phc?

Cu 2. Cho on chng trnh x l ng b nh sau: (2) int x = 1, y = 0, a[2]={1,1}; Gi s bt u turn = 0 A

while (TRUE) { while (turn!= 0); y=x+a[turn]; x = y*a[turn]; turn = 1; ra khi cs() a[turn-1]++; }

while (TRUE) { while (turn!= 1); y = x*a[turn]; x = a[turn]+y; turn = 0; ra khi cs() a[turn+1]++; }

(a) Cu trc tin trnh A (b) Cu trc tin trnh B Gi s hot ng ca hai chng trnh p ng y cc iu kin min gng. Sau khi thc hin 4 ln lp cho bit gi tr ca x, y, a[0], a[1]. (trnh by tng bc v lit k gi tr cc bin ca 2 tin trnh) Cu 3. Cho on chng trnh x l ng b nh sau: (2) P1() {m = 3*x1 + 2*x2} P2() {n = j + m} P3() {k= i + m} P4() {f = k*x3 + n*x4} P5() {h = f + k+n} a. V s biu din mi quan h gia cc tin trnh b. ng b ha bng semaphore, vit li cc hm vi cc semaphore. Cu 3. Cho mt chui truy xut trang ca mt tin trnh nh sau: (2) 5482745918745275145274585 S dng 3 khung trang vi thut ton thay th trang l Optimal, LRU s cho s li trang l bao nhiu? Cu 3: Trnh by cc k thut thay th trang. Cho dy truy xut trang sau: 1 5 2 4 5 3 2 5 2 4 5 3 2 3 5 4 2 5 2 3 5. Thc hin thay th trang theo thut ton thay th trang FIFO v thut ton ti u, bt u c 3 khung trang u trng. Cho bit c bao nhiu li trang xy ra.

HT

Ni dung n tp: Lp ngy h i hc: 1. K thut thay th trang 2. Thut ton banker (deadlock) 3. Chin lc iu phi: RR, u tin, SJF 4. ng b ha: busy and wait, sleep and wakeup (semaphore) 5. I/O c a

Lp m h lin thng cao ng 1. K thut thay th trang 2. Thut ton banker (deadlock) 3. Chin lc iu phi: RR, u tin, SJF 4. ng b ha