n tp H iu Hnh - B nh o!

Bi 1: Khi no th xy ra li trang? M t x l h iu hnh khi c li trang. Li trang xy ra khi ngi dng truy cp ti mt trang khng hp l (ngha l trang khng trong khng gian a ch ca qu trnh - khng ang trong b nh chnh) hoc ta ang truy cp ti mt trang hp l nhng ang b nh ph (swap space). X l ca h iu hnh: vic truy xut mt trang "khng hp l" gy ra mt trap li trang (page-fault trap). Phn cng phn trang, dch a ch thng qua bng trang, s thng bo rng bit khng hp l c t vo, gy ra mt trap ti h iu hnh. Trap ny kch khi dch v page-fault service routine (PFSR) ca h iu hnh. Cc bc x l ca PFSR: ->1- Chuyn process pht ra tham chiu v trng thi blocked. ->2- Pht ra mt yu cu c a np trang c tham chiu vo mt frame trng; trong khi i I/O, mt process khc c cp CPU thc thi. ->3- Sau khi I/O hon tt, a gy ra mt ngt n h iu hnh; PFSR cp nht page table v chuyn process v trng thi ready.

[center] Ti bc 2 ca PFSR, gi s phi thay trang v khng tm c frame trng, PFSR c b sung nh sau:

- Xc nh v tr trn a ca trang ang cn. - Tm mt frame trng: Nu c frame trng th dng n. Nu khng c frame trng th dng mt gii thut thay trang chn mt trang hi sinh (victim page). Ghi victim page ln a, cp nht page table v frame table tng ng. - c trang ang cn vo frame trng, cp nht page table v frame table tng ng. Bi 2: Gi s c mt chui truy xut b nh c chiu di p vi n s hiu trang khc nhau xut hin trong chui. Gi s h thng s dng m khung trang (khi ng trng). Vi mt thut ton thay th trang bt k: Cho bit s lng ti thiu cc li trang xy ra. Cho bit s lng ti a cc li trang xy ra.

Cu 2: Nu chui truy xut b nh c chiu di l p, ngha l c p trang. M cc trang c s hiu khc nhau,ngha l chng khng trng nhau. Nu chng khng trng nhau th khi kim tra trong khung s khng c mt s hiu trang ang xt, nn xut hin li. V c th c p li trang.

[/center] Bi 3: Mt my tnh 32 bit a ch, s dng mt bng trang nh cp. a ch o c phn b nh sau: 9 bit dnh cho bng trang cp 1, 11 bit dnh cho bng trang cp 2, v cho offset. - Kch thc trang trong h thng: a ch o c phn b vi 9 bit cho bng trang cp 1 v 11 bit dnh cho bng trang cp 2, nh vy s bit cn li biu din offset l 32 - 9 - 11 = 12 bit =>kch thc mt trang s l 2^12 byte.(4 kb) - S trang ca a ch o: Vi 9 bit dnh cho bng trang cp 1, ta s c 2^9 mc trong bng trang cp 1, mi mc ny cha s hiu ca mt bng trang cp 2. Vi 11 bit dnh cho bng trang cp 2, ta s c 2^11 mc trong mi bng trang. Nh vy, s trang ca a ch o s l 2^9.2^11 = 2^20 trang.

Bi 4: Gi s a ch o 32 bit c phn tch thnh 4 trng a, b, c, d. Ba trng u tin c dng cho bng trang tam cp, trng th 4 dng cho offset.Gi s mi trng biu din bi s bit tng ng l x, y, z, t tha mn iu kin x + y + z + t = 32 --> S lng trang nh: 2^(x+y+z) hoc 2^(32-t) Bi 5: Mt my tnh c 48 bit a ch o, v 32 bit a ch vt l. Kch thc mt trang l 8K. C bao nhiu phn t trong mt bng trang (thng thng)? Trong bng trang nghch o? - Khng gian a ch o l 2^48, kch thc trang l 8K = 2^13, nh vy bng phn trang s c 2^48 / 2^13 = 2^35 phn t. - i vi bng trang nghch o: vi 32 bit dnh cho a ch vt l, kch thc trang l 8K ta s c 2^32 / 2^13 = 2^19 mc tc l 19 bit m t bng trang nghch o, vy bng trang nghch o s c 2^19 phn t.

Bi 6: Mt my tnh cung cp cho ngi dng mt khng gian a ch o 2^32 bytes. My tnh ny c b nh vt l 2^18 bytes. B nh o c thc hin vi k thut phn trang, kch thc trang l 4096 bytes. Mt tin trnh ca ngi dng pht sinh a ch o 11123456. Gii thch cch h thng chuyn i a ch o ny thnh a ch vt l tng ng. Phn bit cc thao tc phn mm v phn cng. 00000000101010011011101100000000 - S chuyn i a ch: + u tin, a ch o 11123456 s c chuyn thnh m nh phn 00000000101010011011101100000000 + Tip theo, do kch thc trang l 4096 = 2^12 bytes, nh vy 20 bit u ca a ch logic s l s hiu trang, 12 bit cn li l offset. + i chiu s hiu trang vi bng trang ta c s hiu khung trang trn a ch vt l. + Kt hp s hiu khung trang nhn c t bc trn vi 12 bit offset t m nh phn bn trn ta c a ch vt l.

Bi 7: Gi s c mt h thng s dng k thut phn trang theo yu cu. Bng trang c lu tr trong cc thanh ghi. x l mt li trang tn 8 miliseconds nu c sn mt khung trang trng, hoc trang b thay th khng b sa i ni dung, v tn 20 miliseconds nu trang b thay th b sa i ni dung. Mi truy xut b nh tn 100nanoseconds. Gi s trang b thay th c xc sut b sa i l 70%. T l pht sinh li trang phi l bao nhiu c th duy tr thi gian truy xut b nh ( effective acess time) khng vt qu 200 nanoseconds ? - Thi gian truy xut b nh: x = 100 nanoseconds - Thi gian trung bnh x l li trang: t = 0,3 * 8 + 0,7 * 20 = 16,4 miliseconds - Thi gian truy xut b nh hiu dng EAT <= 200 nanoseconds - EAT = x + a*t vi a l t l pht sinh li trang => a = (EAT - x)/t => a <= (200-100)/16,4 = 0,609% Bi 8: Xt cc thut ton thay th trang sau y. Xp th t chng da theo t l pht sinh li trang ca chng. Phn bit cc thut ton chu ng nghch l Belady v cc thut ton khng b nghch l ny nh hng. a) LRU b) FIFO

c) OPT d) C hi th hai -> cha hiu lm.... - Xp th t theo t l li trang: OPT < LRU < FIFO - Thut ton OPT khng chu nh hng ca nghch l Belady v n l kt qu ca vic pht hin ra nghch l .

**** - Cu 1 - **** Gii thch s khc bit gia a ch logic v a ch physic? - a ch logic (logic address): l v tr nh c din t trong mt chng trnh. Mi tham chiu b nh trong m lnh chng trnh c compiler to ra u l a ch logic. - a ch vt l (physic address): l mt a ch thc trong b nh chnh. a ch vt l c chuyn t a ch logic khi trnh bin dch thc j hin qu trnh linking/loading. **** - Cu 2 - **** Gii thch s khc bit gia hin tng phn mnh ni vi v ngoi vi? - Phn mnh ngoi (external fragmentation): l hin tng khi kch thc khng gian nh cn trng tha mn yu cu cp pht nhng khng gian nh ny li khng lin tc. Hin tng phn mnh ngoi xy ra khi bn thng xuyn cp pht vng nh mi, sau xa i nhng phn vng nh cp pht mt cch khng th t. - Phn mnh ni (internal fragmentation): l hin tng s c vng nh d tha khi ta cp pht mt vng nh hi ln hn kch thc yu cu. V d: Cp mt khong trng 18,464 bytes cho mt process yu cu 18,462 bytes Hin tng phn mnh ni thng xy ra khi b nh thc c chia thnh cc khi kch thc c nh (fixed-sized block) v cc process c cp pht theo n v khi.

**** - Cu 3 - **** Gi s b nh chnh c phn thnh cc vng c kch thc 600K, 500K, 200K, 300K (theo th t), cho bit cc tin trnh c kch thc 212K, 417K, 112K, 426K (theo th t) s c cp pht b nh nh th no nu s dng: a/ Thut ton First fit:

b/ Thut ton Best fit:

c/ Thut ton Worst fit:

Theo ta thy, thut ton Best fit thc hin tt vic phn phi b nh cho cc process nht!!! [center]**** - Cu 4 - ****Xt mt h thng trong mt chng trnh khi c np vo b nh s phn bit hon ton phn on code v phn on data. Gi s CPU s xc nh c khi no cn truy xut lnh hay d liu, v phi truy xut u. Khi , mi chng trnh s c cung cp 2 b thanh ghi base-limit: mt cho phn on code, v mt cho phn on data. B thanh ghi base-limit ca phn on code t ng c t thuc tnh readonly. Tho lun cc u khuyt im ca h thng ny.

**** - Cu 5 - **** Ti sao kch thc trang lun l ly tha ca 2? -Kch thc trang c nh ngha bi phn cng. Kch thc ca mt trang in hnh l ly tha ca 2, t 512 bytes n 16MB trn trang, ty thuc vo kin trc my tnh. Chn ly tha 2 cho kch thc trang thc hin vic dch a ch lun l thnh s trang v di trang rt d dng. [center]**** - Cu 6 - ****
Xt mt khng gian a ch c 8 trang, mi trang c kch thc 1K, nh x vo b nh vt l c 32 khung trang.

a/ a ch logic: - Khng gian a ch c 8 trang, vy ta gi s c mt bng trang (page table) gm 8 mc. - Mi trang c kch thc 1K=2^10 byte, nh vy ta s cn 10 bit qun l phn a ch tng i trong trang (page - offset). Bng trang gm 8 mc ta s cn n 3 bit qun l! => nh vy a ch logic gm c page number + page offset = 3 + 10 = 13 bit

[center] b/ a ch vt l: - B nh vt l c 32 khung trang, nh vy ta cn 5 bit qun l n (2^5=32). - Thm vi 10 bit offset cho vic qun l phn a ch tng i trong trang. => a ch vt l bao gm 5 + 10 = 15 bit

[center]

[/center] [/center] [/center]

**** - Cu 7 - ****
Ti sao trong h thng s dng k thut phn trang, mt tin trnh khng th truy xut n vng nh khng c cp cho n? Lm cch no h iu hnh c th cho php s truy xut ny xy ra? H iu hnh c nn cho php iu khng? Ti sao?

Phn trang l c ch qun l b nh cho php khng gian a ch vt l ca qu trnh l khng k nhau. Phn trang trnh vn t va kht nhm b nh c kch thc thay i vo vng lu tr ph (backing store) m hu ht cc c ch qun l b nh trc gp phi. Khi phn on m v d liu nm trong b nh c hon v ra, khng gian phi c tm thy trn vng lu tr ph. [b] B nh vt l c chia thnh cc khi c kch thc c nh gi l cc khung (frames).

B nh lun l cng c chia thnh cc khi c cng kch thc gi l cc trang (pages). Khi mt qu trnh c thc thi, cc trang ca n c np vo cc khung b nh sn dng t vng lu tr ph. Vng lu tr ph c chia thnh cc khi c kch thc c nh v c cng kch thc nh cc khung b nh. Phn trang l mt dng ca ti nh v ng. Mi a ch lun l c gii hn bi phn cng phn trang ti a ch vt l. S dng phn trang tng t s dng mt bng cc thanh ghi nn (hay ti nh v), mt thanh ghi cho mi khung b nh. Mt kha cnh quan trng ca phn trang l s phn chia r rng gia tm nhn b nh ca ngi dng v b nh vt l thc s. Chng trnh ngi dng nhn b nh nh mt khng gian lin tc, cha ch mt chng trnh. S tht, chng trnh ngi dng c phn b khp b nh vt l v n cng qun l cc qu trnh khc. S khc nhau gia tm nhn b nh ca ngi dng v b nh vt l thc s c lm cho tng thch bi phn cng dch a ch. a ch lun l c dch thnh a ch vt l. nh x ny c che giu t ngi dng v c iu khin bi h iu hnh. Nh vy, qu trnh ngi dng khng th truy xut b nh m n khng s hu. Khng c cch nh a ch b nh bn ngoi bng trang ca n v bng ch cha nhng trang m qu trnh s hu.