Cu 1: ngha ca System Call.

Hy gii thch bnh thng cc phn mm ng

dng khai thc phn cng ca my nh th no?
Tr li: 1/ nh ngha v System call (li gi h thng) cung cp 1 giao tip gia
tin trnh v h iu hnh . Li gi ny cng nh 1 lnh hp ng . Mt s h thng
cho php li gi h thng c thc hin t cc cp lp trnh bc cao nh cc hm
v li gi hm n c th pht sinh li gi t cc th tc hay gi trc tip trong
dng.
2/ ngha ca System call:
- Tit kim thi gian cho ngi s dng . Ngi dng c th g cc lnh h thng
cn cc thng tin mnh cn mt cch nhanh chng
- Gip cho h iu hnh qun l tt cc thng tin trong my
- Gip cho cc phn mm ng dng khai thc c trit phn cng ca my
tnh
- N lm cho ngi dng c mt ci nhn hon ton mi m v cc thng tin m
mnh cn,v cc thng tin c ly ra th c th theo ca ngi dng cn m
khng phi mt nhiu thi gian nhn t bng ny sang cc bng khc kt ni
thng tin m mnh cn trn cng mt bng
- Gip h iu hnh qun l tt cc thng tin trong my.
3/ Cc phn mm khai thc phn cng ca my nh sau :Bnh thng cc phn
mm khai thc phn cng thng qua s qun l v iu phi ca h iu hnh.Khi
cc phn mm ng dng khai thc phn cng my tnh thng qua cc li gi h
thng n c che du di cc hm c s dng trc tip trong cc ngn ng
lp trnh. Khi phn mm ng dng c khi ng, cc chc nng ca n c
thc hin trn my thng qua rt nhiu li gi h thng.
Cu 2: Mt tin trnh yu cu H iu hnh chuyn trng thi cho n ng 5
giy. H iu hnh c m bo c l s kch hot tin trnh ny ng 5 giy
sau khng? Ti sao?
Tr li: Khi mt tin trnh yu cu h diu hnh cho n chuyn trng thi 5 giy
th h iu hnh s cho php n c ngh nhng h iu hnh s khng m bo
s kch hot n sau ng 5 giy c v khi tin trnh ngh th h iu hnh s
cho php tin trnh khc ang c ng trong hng i c thc hin v thi
gian thc hin ca tin trnh ny phi l khong thi gian nh nht trong tt c cc
tin trnh ang ng trong hng i, khi s c 3 kh nng xy ra:
1/ Nu khong thi gian ny va ng 5 giy th h iu hnh s cho php tin
trnh m lc trc yu cu h iu hnh cho php n ng lm vic tip v khi
khong thi gian m tin trnh thc hin s l nh nht trong tt c cc tin trnh
ang i trong hng i.
2/ Nu khong thi gian thc hin ca tin trnh ny m vt qu 5 giy th tin
trnh ang ng 5 giy s khng th thc hin c khi m tin trnh ang c
thc hin vn cha thc hin xong cho nn v th m h iu hnh trong trng
hp ny khng th m bo vic cho tin trnh khi ng li sau ng 5 giy
3/ Nu khong thi gian thc hin ca tin trnh ny m nh hn 5 giy th khi
h iu hnh s cho php mt tin trnh khc c thc hin (y chnh l tin
trnh m c thi gian thc hin ln hn tin trnh va mi thc hin nhng m li
l tin trnh c khong thi gian nh hn cc tin trnh cn li trong hng i tr
tin trnh ang c ng 5 giy ) .V vy trong trng hp ny th h iu hnh
cng khng th cho php tin trnh ang c ng 5 giy thc hin c ng
sau 5 giy
Cu 3: Nu nh ngha H iu hnh. H iu hnh thc hin nhng chc
nng chnh g ?
Tr li: H iu hnh l mt chng trnh qun l phn cng ca my tnh . N
cung cp nn tng cho nhng ngi s dng v n ng vai tr trung gian giao tip
gia ngi dng my tnh v phn cng ca my tnh.Mc tiu ca h iu hnh l
cung cp mt mi trng ngi s dng c th thi hnh cc chng trnh. N
lm cho my tnh d s dng hn, thun li hn v hiu qu hn. Bn cacnhj h
iu hnh cn cung cp cc ng dng c bn v l mi trng hot ng cho cc
ng dng tng thch.
H iu hnh l mt thnh phn quan trng trong hu ht mi h thng my
tnh . Mt h iu thng my tnh c th c chia thnh bn thnh phn : phn
cng , h iu hnh cc chng trnh ng dng v ngi dng.
Chc nng chnh ca h iu hnh l :
- H iu hnh iu khin v phi hp vic s dng phn cng cho nhng
chng trnh ng dng khc nhau ca nhiu ngi s dng khc nhau
- H iu hnh cung cp mt mi trng m cc chng trnh c th lm vic
hu hiu trn .
- H iu hnh qun l v phn phi ti nguyn ca my tnh: Cc ti nguyn
ca my tnh nh l thi gian s dng CPU, vng b nh, vng lu tr tp tin, thit
b nhp xut v.v... H iu hnh hot ng nh mt b qun l cc ti nguyn v
phn phi chng cho cc chng trnh v phn phi chng cho cc chng trnh v
ngi s dng khi cn thit . Do c rt nhiu yu cu, h iu hnh phi gii quyt
vn tranh chp ti nguyn v quyt nh vic phi cp pht ti nguyn cho
nhng yu cu theo th t no hot ng ca my tnh l hiu qu nht kim
xot vic s dng my tnh c bit l cc thit b xut nhp
- Qun tr phn phi cng vic cho h thng thit b h thng thit b hot
ng hiu qu nht .
- Phc v nhu cu a dng ca ngi s dng mt cch tt nht
Cu 4: Multi-tasking l g? Gii thch s khc nhau gia cc hnh thc Multi-
tasking (cooperative and pre-emtive multi-tasking).
Tr li: Multitasking l kh nng thc hin nhiu nhim v cng lc, mt nhim v
l mt chng trnh . Nhng thut ng a nhim v a x l thng c s dng
thay th cho nhau c . Hay ta cng c th ni Multitasking l mt phn mm
lm nhim v phn chia thi gian phc v ca CPU.Cho cc tc v (tasks hay
processes) m bo cc tc v ny hon thnh mt cng vic no
S khc nhau gia cc hnh thc Multi-tasking :
- Trong m hnh a nhim hp tc( Cooperative Multitasking), ch c ng dng
ang s hu CPUmi quyt nh khi no tr li CPU cho tin trnh khc hot ng.
- Trong m hnh a nhim u tin(Preemptive Multitasking), th vic chuyn
CPU t tin trnh hin ti cho tin trnh khc c thc hin bi b phn lp lch
ca h iu hnh. B phn lp lch ca h iu hnh quyt nh thi gian m mi
tin trnh c s hu CPU. B phn lp lch thng da vo u tin ca tin
trnh quyt nh vic cp CPU cho n.
Cu 5: S ging v khc nhau gia Chng trnh , Tin trnh v Lung Tr li:
- Chng Trnh, tin trnh, lung:
+Chng trnh : Mt chng trnh l mt thc th th ng cha ng cc ch th
iu khin my tnh tin hnh mt tc v no . Chng trnh c th l mt
on lnh thc thi v 1 vn . Trong chng trnh chnh c th c cc chng
trnh con m mi chng trnh con li thc hin 1 nhim v ring.
+Tin trnh: L mt thc th ch ng, trong my tnh v c np vo b
nh chnh. L mt thc th ch ng ca mt chng trnh, c thi gian sng nht
nh. C nhiu trng thi v c th chuyn t trng thi ny sang trng thi khc
+Lung : l mt n v c bn ca s s dng CPU , l mt dng iu khin
trong mt tin trnh. Nu tin trnh c nhiu lung, n c th thc hin nhiu tc v
ti mt thi im. cc lung trong mt tin trnh chia s vi nhau on m, on
d liu v cc ti nguyn h thng khc nh cc tp m, cc tn hiu.
- Ging nhau: Tin trnh, chng trnh v Lung ging nhau l cng ni v vic
x l cc d liu v chng c mi lin h cht ch vi nhau mi th lm mt vn
khai thc d liu v chng cng c s l bi CPU.
- Khc nhau l:
+ Chng trnh l mt th th ng, nh ni dung ca cc tp tin c lu trn
a, cha ng cc ch th iu khin my tin hnh cc tc v no khi
cho thc hin cc ch th ny chng trnh s chuyn thnh tin trnh
+ Tin trnh l mt th ch ng vi con tr lnh hay b m chng trnh s xc
nh ch th lnh tip theo s thc thi v km theo cc ti nguyn phc v cho hot
ng ca tin trnh. Cc tin trnh hon ton c lp vi nhau ch c th lin lc
thng qua cc c ch thng tin gia cc tin trnh m h iu hnh cung cp.c thi
gian sng nht nh. C nhiu trng thi v c th chuyn t trng thi ny sang
trng thi khc
+ Lung n ch l mt phn nh trong tin trnh n ch l cc on lnh c nm
trong tin trnh. cc lung nm trong cng mt tin trnh li chia s mt khng gian
a ch chung iu ny c ngha l cc lung c th chia s cc bin ton cc ca
tin trnh. Mt lung c th truy xut dn c cc stack ca nhng lung khc trong
cng tin trnh.
Cu 7: Gii thch c ch CPU chuyn t vic thc hin process ny sang process
khc. Lm sao c th m bo c vic thc hin ng cc lnh ca process
tng ng?
Tr li: a/ C ch: Ni chung CPU s ct gi ton b trng thi ca tin trnh ang
thc hin a tin trnh v trng thi blocked, sau khi thc hin xong tin trnh va
yu cu CPU s khi phc li hon ton trng thi ca tin trnh c ct gi. Theo
s sau:
Ch thch: Save state into PC0: ct gi trng thi trong PCB0
Reload state from PC1: Khi phc trng thi t PCB1
Idle: Ngh excuting: Hot ng

T hnh v ta gii thch c ch chuyn t tin trnh ny sang tin trnh khc
Gi s c 2 tin trnh P0, P1. P0 ang chy th xut hin ngt v P0 dng li,
khi ton b thng tin v P0 t cc thanh ghi c ghi ra thc th PCB0 trong b
nh chnh. Sau cc thng tin ca P1 t PCB1 trong b nh chnh c np vo
cc thanh ghi v thc thi P1, P1 ang thc thi khi xut hin ngt hay li gi h
thng P1 dng li khi ton b cc thng tin v P1 t cc thanh ghi c ghi ra
thc th PCB1 trong b nh chnh. Sau cc thng tin ca P0 t PCB0 trong b
nh chnh c load ln np vo cc thanh ghi.
C ch: CPU lu tt c cc thng tin v tin trnh c dng li t cc thanh ghi
vo mt PCB no trong b nh chnh, v np li cc thng tin v mt tin trnh
c tip tc t PCB lu n vo cc thanh ghi.
b/ m bo thc hin ng cc lnh ca process tng ng th:
Mt tin trnh gm cc thng tin v: Con tr n cc tin trnh cha, con; khng
gian a ch; cc ti nguyn cc trng thi ca tin trnh; cc lung. Mt lung li
cha cc thng tin: Program counter, cc thanh ghi, Stack.
Khi chuyn gia cc tin trnh tt c cc thng tin ny c lu. Khi c np li
chng c a nguyn trng thi vo cc thanh ghi, v chng tip tuc c thc
hin nh khng c chuyn gh xy ra. Quan trng quyt nh l program counter
b m chng trnh c lu.
Cu 8: Mc ch v nguyn tc ca vic lp lch cho CPU
Tr li
- L do phi lp lch cho CPU:
+ Do s ngi s dng v s lng tin trnh lun ln hn s lng CPU ca my
tnh rt nhiu v ti mt thi im, ch c duy nht mt tin trnh c thc hin
trn mt CPU. M nhu cu ngi s dng nhiu hn ti nguyn CPU ang c do
ta cn lp lch phn phi thi gian s dng CPU cho cc tin trnh ca ngi
s dng v h thng.
+ Khi mt my tnh a chng trnh, tc l c nhiu tin trnh cn phi x l ti
mt thi im. Th khi c nhiu hn mt tin trnh trng thi sn sng v ch c 1
CPU th lc ny h iu hnh phi quyt nh tin trnh no s c chy trc,
chnh l khi nim lp lch CPU.
- Mc ch ca vic lp lch cho CPU l :
- Ti u ha CPU.
- S lng tin trnh c phc v l nhiu nht.
- Khong thi gian quay vng l t nht.
- Gim thi gian ch trong hng i.
- Cc tiu ha thi gian hon tt cc tc v x l theo l.
- Cc i ha s cng vic c x l trong mt n v thi gian.
- Nguyn tc ca vic lp lch: T chc dng xp hng cho cc tin trnh , sau
xc lp 1 chnh sch phc v cho dng xp hng .
Cu 9: Gii thch ti sao phn a ch cao(top half), a ch thp(bottom-half)
HH khng phi l tin trnh.
Tr li: - Top - half:
+ c dng trong qun l cc tin trnh ch khng phi l cc tin trnh.
+ Thc hin cc yu cu ca I/O.
- Bottom half: L cc interrupt handle l cc hm, cc th tc phc v ngt =>
dng h tr, cng tc vi cc process.
Cu 10: Cc cch la chn tin trnh t ready to run thc hin.
Tr li: Cc cch la chn tin trnh t ready to run:
1/ First come-first served (FCFS-vo trc phc v trc)
- u im: n gin, d lp trnh, qun l d dng.
- Hn ch: + Khng p dng c cho h thng my ch.
+ Khng c s u tin (non preemtive) nn khng cng bng vi nhng tin trnh
c thi gian phc v (burst time) ngn.
+ Xy ra hin tng c tin trnh c chim CPU trong thi gian di.
+ Thi gian ch i trung bnh di.
+ Khng ph hp vi cc h thng chia s thi gian.
2/ Shorted- job-first (SJF-thi gian phc v ngn th thc hin trc)
- u im:
+Tt hn so vi FCFS v hn ch c vic mt tin trnh c chim CPU.
+Thi gian ch i gim.
+ Thch hp c th s dng cho cc tin trnh tng tc ( cc tin trnh tng
tc ni chung thng theo mt mu chung l ch i lnh, kch hot lnh, ri li
i lnh v kch hot)
- Hn ch:
+Phi mt thi gian cho vic c lng v thi gian chn tin trnh.
+Khng bit chiu di ca chu k CPU k tip( Kh khn trong vic xc nh tin
trnh no trong s cc tin trnh ang c th chy c xem l c thi gian phc v
ngn nht).
3/ Round robin scheduling (RR - nh thi lun phin )
- u im: + y l gii thut n gin, cng bng v ph dng.
+ Trnh b ri vo vng lp v hn.
+ Xa b vic c chim CPU trong thi gian di.
- Hn ch: Kh xc nh khong thi gian chia cho mi tin trnh l bao lu.Mt
thi gian chuyn, bt, tt cc tin trnh.Nu khong thi gian chia cho cc tin
trnh khng hp l s lng ph thi gian.
4/ Prioity scheduling ( Lp lch u tin):
- c im: Mi tin trnh c gn mt u tin v tin trnh no c u
tin cao nht s c chy. ng thi trnh cc tin trnh c u tin cao chy
v nh khi cc tin trnh ny chy c ng vi mi khong thi gian nht nh
u tin ca n s gim i 1 mc. Khi chy mt khong thi gian nht nh u
tin ca n thp hn tin trnh khc th thao tc chuyn bt tin trnh s din ra.
- u im: + Tit kim thi gian hn round robin do xc nh c tin trnh no
quan trng cho thc hin trc.
+Mc u tin c th thay i ty theo chc nng nhim v v yu cu ca
tng c quan tng ngi s dng.
Cu 11: Trong k thut cp pht b nh phn vng ng,khi np tin trnh vo
b nh cn la chn vng cn rng no . Nu cc thut ton h iu hnh c
th s dng trong trng hp cn la chn ny.
Tr li:i vi h iu hnh s dng phn vng ng, cp pht b nh cho mt
tin trnh ta s dng mt s thut ton nh First Fit, Best fit, Worst fit, Quick
fit. Mi mt phng php c nhng c im ring u im v hn ch nht nh
- First fit (chn l trng u tin ln i vi kch thc ca tin trnh): qun
l qu trnh s qut dc theo danh sch cc on cho n khi tm c mt l trng
c kch thc ln. Nh vy trong qu trnh tin trnh s c cp pht l
trng u tin c kch thc ln hn hoc bng n. Nh vy l trng c cp pht
c th chia lm 2 phn: phn cp pht cho tin trnh v phn khng s dng n
(tc l n cn rnh).
- Best fit (chn l trng c kch thc nh nht m ln cho kch thc ca
tin trnh): mt tin trnh s c cp pht l trng m c kch thc va kht vi
n nht trong danh sch l trng rnh, tc l phn khng s dng n trong khi
l nh nht. Yu cu phi duyt ht ton b cc l trng tr khi cc l trng
c sp xp theo kch thc.
- Worst fit (chn l trng c kch thc ln nht cung cp cho tin trnh): mt
tin trnh s c cp pht phn b nh thuc khi rnh c kch thc ln nht
trong danh sch cc khi rnh. Cng phi duyt ht ton b danh sch
Trong : first fit l thut ton n gin nht vi thi gian tm kim l nhanh
nht do bt u gp khi c kch thc cho tin trnh l n nhn,
best fit tt hn worst fit trong gii hn ca tc v kh nng lu tr.
Cu 15: Gii thch ngn gn trng thi ca cc tin trnh, cc m hnh tin trnh
h thng (process models) chung.
Tr li: - Cc trng thi ca tin trnh: Khi mt tin trnh thc thi, n thay i trng
thi.Trng thi ca tin trnh ti 1 thi im c xc nh bi cc hot ng hin
hnh ca n ti thi im .Mi tin trnh c th 1 trong cc trng thi sau:
+ Mi (new): tin trnh ang c to ra.
+ ang chy (running): cc ch th ang c thc thi.
+ Ch (waiting): tin trnh ang ch s kin xy ra (VD: hon thnh vic
nhp/xut hay nhn dng tn hiu).
+ Sn sng (ready): tin trnh ang ch c cp pht CPU x l.
+ Kt thc (terminated): tin trnh hon thnh vic thc thi.
Ti mt thi im xc nh, ch c duy nht 1 tin trnh trng thi running nhng
nhiu tin trnh c th trng thi waiting hay ready.
- Cc m hnh tin trnh h thng:
+ M hnh simple monitor system:
+ M hnh h thng l (batch system)
+M hnh h thng l vi trng thi cm (a batch system with blocked state)
Cu 16: Gii thch vai tr ca PCB (process control block).
Tr li: Mi qu trnh c hin din trong h iu hnh bi Khi iu khin qu
trnh(Process Control Block-PCB) cng c gi khi iu khin tc v. N
cha nhiu phn thng tin c gn lin vi mt qu trnh xc nh, gm:
Trng thi qu trnh (process state): trng thi c th l mi, sn sng, ang
chy, ch i, kt thc,
B m chng trnh (program counter): b m hin th a ch ca ch th k
tip c thc thi cho qu trnh ny.
Cc thanh ghi (registers) CPU: cc thanh ghi khc nhau v s lng v loi, ph
thuc vo kin trc my tnh. Chng gm cc b tng (accumulators), cc thanh
ghi ch mc, cc con tr ngn xp, v cc thanh ghi a nng (generalpurpose
registers), cng vi thng tin m iu kin (condition-code information). Cng vi
b m chng trnh, thng tin trng thi ny phi c lu khi mt ngt xy ra,
cho php qu trnh c tip tc mt cch ph hp sau (Hnh III.3).
Thng tin lp thi biu CPU (CPU-scheduling information): thng tin gm
u tin ca qu trnh, cc con tr ch ti cc hng i lp thi biu, v bt
k tham s lp thi biu khc.
Thng tin qun l b nh (Memory-management information): thng tin ny c
th gm nhng thng tin nh gi tr ca cc thanh ghi nn v thanh ghi gii hn,
cc bng trang hay cc bng phn on, ph thuc h thng b nh c dng bi
h iu hnh.

Thng tin tnh ton (accounting information): thng tin ny gm lng CPU v
thi gian thc c dng, cng vic hay s qu trnh,
Thng tin trng thi nhp/xut (I/O status information): thng tin ny gm
danh sch ca thit b nhp/xut c cp pht qu trnh ny, mt danh sch cc
tp tin ang m,.. PCB n gin phc v nh kho cha cho bt c thng tin khc
nhau t qu trnh ny ti qu trnh khc.
Cu 17: Gii thiu v gii thch ngn gn cc thnh phn (components) ca H
iu hnh.
Tr li: Cc thnh phn ca h iu hnh:
1/ Qun l tin trnh: Tin trnh l 1 chng trnh ang hot ng.Khi thc hin,
tin trnh i hi 1 s ti nguyn nht nh nh :CPU, b nh, cc thit b nhp
xut Cc ti nguyn ny s c cp pht cho tin trnh vo nhng thi im cn
thit v c thu hi khi tin trnh kt thc. Ngoi ra, khi tin trnh hot ng trong
h thng c th pht sinh cc tin trnh con. Nh vy, nhim v ca h iu hnh
trong qun l tin trnh l:
- To lp v hy b cc tin trnh
- Tm dng v khi phc li cc tin trnh
- Cung cp c ch ng b ha cc tin trnh
- Cung cp cc c ch giao tip gia cc tin trnh
2/ Qun l b nh chnh: B nh chnh l 1 mng kiu byte hay kiu word c kch
thc ln. Mi phn t c a ch ring. l 1 kho cha d liu c kh nng truy
xut nhanh c chia s bi CPU v cc thit b nhp xut. B nh chnh l 1 thit
b lu tr khng n nh.Ni dung ca n b mt khi h thng b li.Trong qun l
b nh h iu hnh c cc nhim v sau:
- Lu gi thng tin v cc v tr trong b nh c s dng v ai s dng.
- Quyt nh tin trnh no c np vo b nh chnh, khi b nh c th dng
c.
- Cp pht v thu hi b nh khi cn thit.
3/ Qun l b nh ph: V b nh chnh bt n nh v qu nh lu tt c
chng trnh v d liu nn h thng my tnh phi cung cp vic lu tr ph
lu d phng b nh chnh. Hu nh tt c chng trnh : chng trnh dch, hp
ng, th tc, trnh son tho, nh dng... u c lu tr trn a cho ti khi n
c thc hin, np vo trong b nh chnh v cng s dng a cha d liu v
kt qu x l. V vy mt b qun l h thng a rt quan trng cho h thng my
tnh. Vai tr ca h iu hnh trong vic qun l a : Qun l vng trng trn a,
nh v lu tr v lp lch cho a.
4/ Qun l h thng nhp/ xut: Mt trong nhng mc tiu ca h iu hnh l che
du nhng c th ca cc thit b phn cng i vi ngi s dng thay vo l
mt lp thn thin hn, ngi s dng d thao tc hn. Mt h thng nhp/xut
bao gm :
- Mt h thng vng nh m
- Giao din trnh iu khin thit b chung.
- in khin cc thit b phn cng xc nh.
5/ Qun l tp tin: Mt tp tin l mt tp hp nhng thng tin lien quan vi nhau
do ngi to ra n xc nh. Thng thng mt tp tin i din cho mt chng
trnh v d liu. D liu ca tp tin c th l s, l k t, hay k s. Tp tin thng
c dng t do, nh tp tin vn bn, nh phn...(l tp tin cha dy cc bit). Vai tr
ca h iu hnh trong vic qun l tp tin :
To v xo mt tp tin.
To v xo mt th mc.
H tr cc hm nguyn thy thao tc trn tp tin v th mc.
nh x tp tin trn h thng lu tr ph.
Sao lu d phng tp tin trn cc thit b lu tr n nh.
6/ H thng bo v: H thng bo v l mt c ch kim sot qu trnh truy xut
ca chng trnh, tin trnh, hoc ngi s dng vi ti nguyn ca h thng v
ca ngi dng. C ch ny cng cung cp cch thc m t li mc kim
sot:
- Phn bit gia ngi s dng c php hay khng c php truy cp.
- Xc nh cc iu khin c p dng.
- Cung cp phng tin thc thi.
7/ Mng(distributed system):H phn tn l tp hp cc b x l, chng khng chia
s b nh, cc thit b ngoi vi hay ng h.Thay vo mi b vi x l c b
nh, ng h ring.Cc b vi x l trong h thng c kt ni vi nhau thng qua
mng truyn thng.H thng phn tn cung cp cho ngi dng truy xut ti cc
ti nguyn khc nhau m h thng duy tr. Truy xut ti cc ti nguyn chia s cho
php tng tc tnh ton,tng kh nng sn dng ca d liu, tng mc tin
cy.
8/ Thnh phn thng dch lnh: Nhiu lnh c cung cp ti h iu hnh bi cc
lnh iu khin gii quyt vic to v qun l tin trnh,qun l nhp xut, qun
l vic lu tr ph, qun l b nh chnh, truy xut h thng tp tin, bo v v
mng. Trong cc h thng chia x thi gian mt chng trnh c th c v thng
dch cc lnh iu khin c thc hin mt cch t ng. Chng trnh ny
thng c gi l b thng dch iu khin card, c ch dng lnh hoc Shell.
Chc nng ca n rt n gin l ly lnh k tip v thi hnh.

Cu 18: Nu vn tt cc k thut cp pht b nh (np chng trnh vo b
nh).
1. K thut phn vng ng (Dynamic Partitioning)
- S lng cc phn vng trn b nh v kch thc ca mi phn vng l c th
thay i.
-Khi c mt tin trnh c np vo b nh n c h iu hnh cp cho n
khng gian va cha tin trnh, phn cn li c tr v tp hp cc vng
trng. Nu vng trng mi nm k vi cc cng trng khc, cc vng trng nm k
ny c gom li to thnh 1 vng trng ln hn.
-Khi mt tin trnh kt thc n c a ra ngoi v phn khng gian b nh m
tin trnh ny tr li cho h iu hnh s c h iu hnh cp cho tin trnh khc,
c khi tin trnh ny c kch thc nh hn kch thc ca khng gian nh trng
.
-Khi c mt tin trnh cn c np vo b nh m trong b nh c nhiu hn mt
khi nh trng (Free Block) c kch thc ln hn kch thc ca tin trnh , th
h iu hnh phi quyt nh chn mt khi nh trng ph hp no np tin
trnh sao cho vic la chn ny dn n vic s dng b nh chnh l hiu qu
nht.
-C 3 thut ton m h iu hnh s dng trong trng hp ny, l: Fist fit, Best
Fit, Worst Fit
2. K thut phn vng c nh (Fixed Partitioning)
-Qun l b nh vi nhng phn an c nh .H iu hnh chia b nh thnh n
vng nh c nh( c th khng bng nhau)
-Vic phn chia ny c thc hin vo lc khi ng h thng v khng thay i
sut qu trnh chy.Vi t chc nh vy cn duy tr mt hng i duy nht lu
tr nhng tin trnh cha c cp pht b nh
-Tt c tin trnh c t trong mt hng i duy nht. Khi c mt phn vng t
do , tin trnh u tin trong hng i c kch thc ph hp s c t vo phn
vng ny v cho x l.
-Nu kch thc ca tin trnh khng va ng bng kch thc phn vng cha
n, phn b nh khng s dng n trong phn vng s b lng ph xy ra hin
tng phn mnh ni vi.
-Mc a chng ca h thng b gii hn bi s lng phn vng.Vn bo
v gia cc phn vng: bo v cn t chc hai thanh ghi : thanh ghi nn v
thanh ghi gii hn.
-Khi tin trnh c to lp, np vo thanh ghi nn a ch bt u ca phn vng
c cp pht cho tin trnhv np vo thanh ghi gii hn kch thc ca tin trnh
- Sau mi ch b nh c pht sinh s t ng c cng vi a ch cha
trong thanh ghi nn cho ra a ch tuyt i trong b nh v cc a ch c i
chiu vi thanh ghi gii hn bo m tin trnh khng truy xut ngoi phm vi
c cp pht cho n.
3. Swapping : hon i tm thi mt tin trnh khi b nh ra thit b lu tr ngoi
(swap out ) (backing store = vng b nh nhanh nht, tt nht cha bn sao ca
tt c cc hnh nh b nh cho all user, phi cung cp truy cp trc tip cho hnh
nh b nh ), gii phng b nh, sau c th c a tr li b nh tip
tc thc hin.(swap in). Thi gian swap chnh l time chuyn tin trnh t b nh
chnh n b nh ph, mt tin trnh cn phi c time x l ln.
4. Phn trang : Phn b nh vt l thnh cc khi (block) c kch thc c nh v
bng nhau, gi l khung trang (page frame). Khng gian a ch cng c chia
thnh cc khi c cng kch thc vi khung trang, v c gi l trang (page).
Khi cn np mt tin trnh x l, cc trang ca tin trnh s c np vo nhng
khung trang cn trng. Lu trng thi ca cc khung trang. Mt tin trnh kch
thc N trang s yu cu N khung trang t do. To mt bng trang chuyn i
a ch logic sang a ch vt l. Phng php ny cp pht khng lin nhau nn c
hin tng phn mnh ni= kch thc phn vng c nh.
5. Phn on : chng trnh thng c chia thnh nhiu phn : d liu, lnh,
ngn xp. Chng trnh c chia thnh cc on theo cu trc logic, mi on
c phn vo mt vng b nh c kch thc bng nhau, mi on tng ng vi
khn gian a ch ring c phn bit bi tn v di ca chng. Cc vng nh
thuc cc on khc nhau c th nm cc v tr khc nhau, do vy chng trnh
c th chim nhiu hn mt on v khng cn lin tip trong b nh. Trnh c
phn mnh trong nhng li c hin tng phn mnh ngoi. D sp xp b nh, d
chia s cc on gia cc tin trnh khc nhau, kch thc mi on c th thay i
m khng nh hng n on khc.
5. Phn on vi phn trang : Tc l phn trang trong mi phn on, b nh =
nhiu phn on v phn on= nhiu trang. Mi phn t ca bng phn on
gm hai thnh phn : Thanh ghi gii hn (limit cha kch thc ca phn on)
v thanh ghi c s (base cha a ch ca bng )
Cu 19. Trong k thut cp pht b nh phn vng ng, khi np tin trnh
mi vo b nh cn la chn mt vng cn rng no . Nu cc phng
php/thut ton la chn.
- First fit : Cp pht bng cch tm khi nh trng no c ln ln u tin
cp (c nhiu hole nh nhng khng cp cho mt tin trnh mi no c th
c gi l phn mnh ngoi, ngoi v n khng thuc mt tin trnh no-
fregmentation)
- Best fit : Phn mnh th lm lng ph b nh. Vy c phng php ny, tc
l tm hole no c ln ln nh nht cp pht. Phi tm kim trn ton b
danh sch vng trng.
- Worst fit : tm hole no c ln ln nhng ln nht cp pht cho tin
trnh mi. Phi tm kim trn ton b danh sch vng trng
- BF v FF tt hn v tc v ti u ha vic s dng b nh
-
Cu 20: Phn tch hai khi nim Page v Paging (trang v phn trang).
- Trang c hnh thnh t vic chia b nh logic thnh cc khi c
cng kch thc
- Phn trang l khi tin trnh cn x l th np trang ca tin trnh vo
cc khung trang no cn trng .Phi nm c trang no thuc tin trnh
no th mi qun l v cp pht c. Mun vy cn phi bo v cc tin
trnh truy xut vo cc trang k phi ca mnh. Vic bo v vng nh c
thc hin bng cch lin kt mt khung vi mt bit gi l bit kim tra hp l
(valid-invalid bit). Valid ch ra rng trang i km l nm trong khng gian
a ch logic ca tin trnh, v vy truy xut trang ny l hp l. Ngc li l
invalid.
Cu 21: Gi thch c ch phn on (segmentation) trong qun l b nh ca
h iu hnh.

- Chng trnh c chia thnh cc on(segments) theo cu trc logic bao
gm chng trnh chnh, th tc, hm, bin cc b, bin ton cc, commonblock,
ngn xp, cc mng, bng symbol, mi on c phn vo mt vng b nh c
kch thc bng nhau, mi on tng ng vi khn gian a ch ring c phn
bit bi tn v di ca chng. Cc vng nh thuc cc on khc nhau c th
nm cc v tr khc nhau, do vy chng trnh c th chim nhiu hn mt on
v khng cn lin tip trong b nh. Trnh c phn mnh trong nhng li c
hin tng phn mnh ngoi. D sp xp b nh, d chia s cc on gia cc tin
trnh khc nhau, kch thc mi on c th thay i m khng nh hng n
on khc.
Cu 22: M t ngn gn B nh o Virtual memory. B nh o c li v
thit hi g i vi vic ti u ho s dng CPU.
- B nh o l mt k thut cho php x l mt tin trnh khng c
np ton b vo b nh vt l. B nh o m hnh ho b nh nh mt bng
lu tr rt ln v ng nht, tch bit hn khi nim khng gian a ch v
khng gian vt l. Ngi s dng ch nhn thy v lm vic trong khng
gian a ch o, vic chuyn i sang khng gian vt l do h iu hnh thc
hin vi s tr gip ca cc c ch phn cng c th.
- B nh o c th c thc hin thng qua phn trang v phn on
theo yu cu. cc tin trnh c th c phn ra thnh cc trang hoc cc
on v khng nht thit phi nm lin tc vi nhau. Mi s truy xut vng
nh ca tin trnh u c chuyn i a ch lc thi hnh do c th
swap in v swap out. V 2 l do trn nn cc trang hoc cc phn on
khng nht thit phi nm trong b nh chnh lc thi hnh.
- u im : C nhiu tin trnh trong b nh hn, gii thut lp lch s
ti u hn, nng cao mc a chng, mt tin trinh c th ln hn kch
thc ca b nh chnh. Chng trnh khng cn b rng buc bi khng
gian a ch vt l sn c.Ngi dng c th vit chng trnh c khng gian
a ch o rt ln, n gin ha tc v lp trnh Cho php cc tin trnh s
dng chung khng gian a ch v d dng chia s ti nguyn, cung cp c
ch hu hiu cho vic to qu trnh.
Cu 23: Trong k thut b nh o thng s dng Phn trang theo yu cu
(demand paging). Hy gii thiu c ch ny.
- Phn trang theo yu cu =phn trang +swapping
- Mt trang ch c np vo b nh chnh khi c yu cu
+ gim cc thao tc vo ra
+ tit kim b nh
+ p ng nhanh
+ tng c s ngi s dng (tin trnh)
- Khi cn mt trang tham chiu n n
+ tham chiu li hy b
+ khng nm trong b nh trong a trang vo b nh t thit b lu tr ngoi
(Ram) vo b nh trong. Lc ny c 2 TH sy ra : nu cn frame th load trang vo
frame tng ng. Nu khng cn frame th phi swap out 1 page no ra v np
trang mi vo. Ch swap 1 page vo mt frame, cng mt trang c th c np
vo b nh trong vi ln.
- Vi m hnh ny, cn cung cp mt c ch phn cng gip phn bit
cc trang ang trong b nh chnh v cc trang trn a. C th s dng li
bit valid-invalid nhng vi ng ngha mi:
- valid : trang tng ng l hp l v ang trong b nh chnh .
- invalid : hoc trang bt hp l (khng thuc v khng gian a ch ca
tin trnh) hoc trang hp l nhng ang c lu trn b nh ph.
- Mt phn t trong bng trang m t cho mt trang khng nm trong
b nh chnh, s c nh du invalid v cha a ch ca trang trn b nh
ph
- C ch phn cng h tr k thut phn trang theo yu cu l s kt
hp ca c ch h tr k thut phn trang v k thut swapping:
- Bng trang: Cu trc bng trang phi cho php phn nh tnh trng
ca mt trang l ang nm trong b nh chnh hay b nh ph.
- B nh ph: B nh ph lu tr nhng trang khng c np vo b
nh chnh. B nh ph thng c s dng l a, v vng khng gian a
dng lu tr tm cc trang trong k thut swapping c gi l khng
gian swapping.
Cu 24: Trong k thut s dng B nh o H iu hnh cn c b phn qun
l vic hon chuyn cc trang/on gia b nh thc v b nh o v c th
xy ra Li trang (page fault). H iu hnh gi quyt vn nh th
no v mc tiu cn t c?
Truy xut n mt trang c nh du bt hp l s lm pht sinh mt li trang
(page fault). Khi d tm trong bng trang ly cc thng tin cn thit cho vic
chuyn i a ch, nu nhn thy trang ang c yu cu truy xut l bt hp l,
c ch phn cng s pht sinh mt ngt bo cho h iu hnh. H iu hnh s
x l li trang nh sau :
Kim tra truy xut n b nh l hp l hay bt hp l
Nu truy xut bt hp l : kt thc tin trnh
Ngc li : n bc 3
Tm v tr cha trang mun truy xut trn a.
Tm mt khung trang trng trong b nh chnh :
Nu tm thy : n bc 5
Nu khng cn khung trang trng, chn mt khung trang nn nhn v chuyn
trang nn nhn ra b nh ph (lu ni dung ca trang ang chim gi khung
trang ny ln a), cp nht bng trang tng ng ri n bc 5
Chuyn trang mun truy xut t b nh ph vo b nh chnh : np trang cn truy
xut vo khung trang trng chn (hay va mi lm trng ) ; cp nht ni dung
bng trang, bng khung trang tng ng.
Ti kch hot tin trnh ngi s dng.
(Cu hi thm ai l ngi quyt nh th t ca cc trang c thc hin User v
h chy lnh no th n s thc hin trang , v d va son tho, sau phn
khung.)
Cu 25: nh gi cc thut ton thay trang (Page Replacement) trong k
thut s dng B nh o.
Vn chnh khi thay th trang l chn la mt trang nn nhn chuyn ra b
nh ph. C nhiu thut ton thay th trang khc nhau, nhng tt c cng chung
mt mc tiu chn trang nn nhn l trang m sau khi thay th s gy ra t li
trang nht.
C th nh gi hiu qa ca mt thut ton bng cch x l trn mt chui cc a
ch cn truy xut v tnh ton s lng li trang pht sinh.
- FIFO : chn cc trang c np vo b nh trong lu nht thay
th thut ton ny d hiu, d ci t . Tuy nhin khi thc hin khng phi
lc no cng c kt qa tt : trang c chn thay th c th l trang cha
nhiu d liu cn thit, thng xuyn c s dng nn c np sm, do
vy khi b chuyn ra b nh ph s nhanh chng gy ra li trang cho nhng
ln truy xut sau. S lng li trang xy ra s tng ln khi s lng khung
trang s dng tng. Hin tng ny gi l nghch l Belady.
- OPT : thay th trang s lu c s dng nht trong tng lai thut
ton ny hon ho v mt tng nhng khng kh thi v mt thc t.
Thut ton ny bo m s lng li trang pht sinh l thp nht , n cng
khng gnh chu nghch l Belady, tuy nhin, y l mt thut ton khng
kh thi trong thc t, v khng th bit trc chui truy xut ca tin trnh
trong tng lai!
- LRU : thay th trang lu nht trong b nh cha c s dng dng
qu kh gn on tng lai, FIFO bit thi im np vo, ti u thi
im s truy cp, LRU i hi phn cng phi h tr kh nhiu : bin b
m, stack.
Cu 26: Nu ngn gn cc thut ton Thay th trang trong k thut b nh
o, Trnh by v gii thch bng v d thut ton FIFO.
- Nh trn
- V d i loi th ny
-
Cu 27: Nu ngn gn cc thut ton Thay th trang trong k thut b nh
o, Trnh by v gii thch bng v d thut ton Ti u OPT.
- Nh trn
- V d i loi nh sau :


Cu 28: Nu ngn gn cc thut ton Thay th trang trong k thut b nh
o, Trnh by v gii thch bng v d thut ton LRU.
- Nh trn
- V d

Cu 29: Phn bit hai hin tng phn mnh ni (internal fragmentation) v
phn mnh ngoi (external fragmentation), chng xut hin khi no v ti
sao?
- 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 30: Gii thch khi nim hon chuyn (swapping); ngha, ng dng ca
vic p dng k thut ny


Mt tin trnh c th c tm thi hon i ra khi b nh ti backing
store, v ri c a tr li b nh thc hin tip.
Backing store thit b nh th cp ln( a t) cung cp bn sao
ca tt c hnh nh b nh cho tt c ngi s dng; phi cung cp s truy
nhp trc tip ti cc hnh nh b nh ny.
Roll out, roll in bin th hon i c s dng cho thut gii lp lch
da trn mc u tin (priority-based scheduling); tin trnh c mc u tin
thp hn b thay ra tin trnh c mc u tin cao hn c th c np v
thc hin.
Phn ln thi gian hon i l thi gian chuyn d liu; tng thi gian
chuyn t l thun vi dung lng b nh hon i.
Swap out: chn tin trnh a ra backing store
Swap in: chn tin trnh t backing store a vo b nh trong
Trong cc h iu hnh s dng swapping, tn ti module h thng
swapper c chc nng: chn tin trnh swap out, chn tin trnh swap in,
nh v & qun l khng gian chuyn
Cu 31: Hy gii thch v sao DMA thng c u i s dng nh l
phng thc thc thi trao i vi ngoi vi? DMA c li im g khng i vi
input thng qua bn phm? Gii thch ti sao hoc ti sao khng?
- DM l b nh truy xut trc tip khng thng qua b vi x l (cho
php chuyn d liu trc tip gia I/O v RM m khng cn i ngang qua
CPU na), c s dng truyn ti d liu gia b nh v cc thit b
ngoi vi nh a cng, CD ROM,DVD c nhanh hn. iu ny s
thy r rng khi ghi a, tc c v ghi a s tng ln rt nhiu. Vi
DM th CPU khng phi truyn thng tin t ngoi vi sang controller na,
cho php CPU chia ti (offload) cc ngn xp b nh ngy cng cht chi
sang cc thnh phn khc, cch thc ny gii phng CPU khi cc cng vic
lt vt v cung cp nhiu chu trnh hn gii quyt cc cng vic phc tp
hn, thng dng truyn ti d liu vi dung lng ln.
- DM s khng c li g i vi input thng qua bn phm bi v input
bi bn phm th rt chm, bn phm ch chuyn c 1 k t/1 ln, cn
DM th chuyn theo block cho nn nu lm nh vy th s rt mt thi
gian, gy lng ph.


Cu 32: Cc my tnh nguyn chic s dng ph bin hin nay thng ci t
H iu hnh Windows XP hoc Vista; y l cc h thng/ H iu hnh a
trnh a nhim. Hy gii thiu mt s dng h thng/ h iu hnh khc.
- a nhim: tc l c th thc hin ng thi nhiu chng trnh, iu
ny c thc hin bng cch chuyn t chng trnh ny sang chng trnh
khc mt cch tng i nhanh chng to cho ngi dng cm gic tt c
cc chng trnh ang c x l ng thi. a nhim nhiu ngi dng:
cho php nhiu ngi ng thi ng nhp vo h thng. Vic ny c
qun l thng qua ti khon ngi dng v mt khu tng ng(VD: cc
phin bn mi HH Windows nh Win 2000,XP,7,8,Mac OS X, iPhone OS
4.0, WebOS, Windows Phone 7, Android, Unix- a trnh...).
Cu 33: Khi hc mn Tin hc i cng chng ta c bit n mt
cch chia cc thit b ngoi vi thnh 2 hoc 3 loi (nhm) l VO, RA
v/hoc va VO va RA; Di gc nhn ngi thit k H iu hnh
chng ta c th chia thit b ngoi vi thnh 2 loi. l g v cch chia ny
da trn cn c no? Hy nu v d mt s ngai vi thuc tng loi trn.
phn loi cc thit b vo/ra ngi ta da vo khun dng d liu m thit b
thc hin vo/ra vi h thng. Cc thit b vo/ra c th chia thnh hai loi ch
yu: Cc thit b khi v cc thit b k t.
Cc thit b khi: Cc thit b khi l cc thit b thc hin vo/ra h thng theo
tng khi d liu, mi khi c kch thc c nh, c a ch. Kch thc cc khi
nh nhau nu cng mt thit b, ngc li cc thit b khc nhau th chng c th
thc hin vo/ra theo khi d liu c kch thc khc nhau. Ni chung mi khi
thng c kch thc t 128-1024 bytes. Cc thit b khi c/ghi d liu theo
khi v vy trong qu trnh x l c th thc hin tm kim, la chn. V d: a t,
card mng (NIC)...
Cc thit b k t: Cc thit b l cc thit b thc hin vo/ra vi h thng theo
tng dy k t gi nhau. Cc dy k t khng c a ch ha v vy khi x l
khng th tm kim hoc la chn. V d: Mn hnh, my in...
Cu 34: Gii thch s khc bit gia polled I/O v interrupt-driven
I/O. Nu nhng u im ca interrupt-driven I/O so vi polled I/O.
C ch thm d (polling)
CPU thng xuyn kim tra port ca thit b:
Thit b nhp: C tn hiu nhp khng? nu c c d liu
Thit b xut: C trong trng thi sn sng khng? Nu c xut
d liu.
Hao ph CPU kim tra thit b nhp c ch Interrupt.
C ch ngt (intterupt)
Mi thit b c mt ng tn hiu ring gi l ng intterupt
Khi thit b nhp c d liu:
a) Thit b gi tn hiu ngt v CPU
b) CPU tm dng chng trnh ang thi hnh
c) CPU thi hnh trnh x l ngt c d liu ti port
d) Sau khi hon tt, CPU tip tc chng trnh b dng
Cu 36: Hy gii thch thut ton Lp lch cho u t FCFS l g, cho v d
m t tnh c seek time. Lp lch FCFS :
- Phng php lp lch n gin nht l FCFS(first-come,first-served),
c d liu theo ng trnh t ca blog thng tin. Thut ton ny rt d lp
trnh nhng khng cung cp c mt dch v tt. V d : cn phi c cc
khi theo th t nh sau : 98, 183, 37, 122, 14, 124, 65, v 67
- Gi s hin ti u c ang v tr 53. Nh vy u c ln lt i
qua cc khi 53, 98, 183, 37, 122, 14, 124, 65, v 67 nh hnh sau :
-
Cu 37: Hy gii thch thut ton Lp lch cho u t SSTF l g, cho v d
m t tnh c seek time.
Lp lch SSTF (shortest-seek-time-first)
Thut ton ny s di chuyn u c n cc khi cn thit theo v tr ln lt gn
vi v tr hin hnh ca u c nht. V d : cn c cc khi nh sau :
98, 183, 37, 122, 14, 124, 65, v 67
Gi s hin ti u c ang v tr 53. Nh vy u c ln lt i qua cc khi
53, 65, 67, 37, 14, 98, 122, 124 v 183 nh hnh sau :

Vi v d ny, thut ton SSTF lm gim s khi m u c phi di chuyn l 208
kh
Cu 38: Hy gii thch thut ton Lp lch cho u t SCAN l g, cho v d
m t tnh c seek time.
Lp lch SCN
Theo thut ton ny, u c s di chuyn v mt pha ca a v t di chuyn
qua pha kia. V d : cn c cc khi nh sau : 98, 183, 37, 122, 14, 124, 65, v
67
Gi s hin ti u c ang v tr 53. Nh vy u c ln lt i qua cc khi
53, 37, 14, 0 , 65, 67, 98, 122, 124 v 183 nh hnh sau :

Thut ton ny cn c gi l thut ton thang my. Hnh nh thut ton ging
nh hnh nh ca mt ngi qut tuyt, hay qut l.
Cu 39: Hy gii thch thut ton Lp lch cho u t C-SCAN l g, cho v d
m t tnh c seek time
Lp lch C-SCAN
Thut ton ny tng t nh thut ton SCN, ch khc l khi n di chuyn n
mt u no ca a, n s lp tc tr v u bt u ca a. Ly li v d trn,
khi th t truy xut cc khi s l : 53, 65, 67, 98, 122, 124, 183, 199, 0, 14, 37
nh hnh sau :

Cu 40: Hy gii thch thut ton Lp lch cho u t C-LOOK l g, cho v
d m t tnh c seek time.
Lp lch LOOK:
Nhn xt rng c hai thut ton lp lch SCN v C-SCAN lun lun chuyn u
c ca a t u ny sang u kia. Nhng thng thng th u c ch chuyn
n khi xa nht mi hng ch khng n cui. Do , SCN v C-SCAN
c chnh theo thc t v gi l lp lch LOOK.(tm li l khi n cylinder cha
thng tin cn c cui cng n khng quay li 0 na m quay ra lun ci cn li)
Nh hnh sau :

La chn thut ton lp lch :

Vi nhng thut ton lp lch, vn l phi la chn thut ton no cho h thng.
Thut ton SSTF th rt thng thng. Thut ton SCN v C-SCN thch hp
cho nhng h thng phi truy xut d liu khi lng ln. Vi bt k thut ton
lp lch no, iu quan trng l khi lng v s v kiu khi cn truy xut. V d ,
nu s khi cn truy xut l lin tc th FCFS l thut ton tt.

Cu 42: Tc nghn (deadlock) v cc iu kin xy ra tc nghn.
Tt c hin tng tc nghn u bt ngun t s xung t v ti nguyn ca hai
hoc nhiu tin trnh ang hot ng ng thi trn h thng. Ti nguyn y c
th l mt a, mt record trong c s d liu, hay mt khng gian a ch trn b
nh chnh.
iu kin xy ra tc nghn
Hin tng tc nghn xy ra khi v ch khi h thng tn ti 4 iu kin sau:
- C th s dng ti nguyn khng th chia s: Mi thi im, mt ti nguyn ch
c cp pht cho mt tin trnh. Khi tin trnh s dng xong, h thng mi thu
hi v cp pht ti nguyn ny cho tin trnh khc.
- C hin tng gi v i ti nguyn: Cc tin trnh chim gi cc ti nguyn
cp pht cho n v ch c cp pht thm ti nguyn mi
- Khng c h thng phn phi li ti nguyn: Ti nguyn khng th c c
thu hi t tin trnh ang chim gi chng trc khi tin trnh ny s dng chng
xong
- C hin tng ch i vng trn: C t nht 2 tin trnh ch i ln nhau: tin
trnh ny ch c cp pht ti nguyn m tin trnh kia ang chim gi v ngc
li
Cu 44: nh gi ngn gn cc loi thit b lu tr; s khc nhau cn bn
gia a cng v Bng t; Nguyn tc t chc lu tr tp tin trn 2 loi thit
b lu tr ny.
- Thit b lu tr l thit b c chc nng chnh l lu tr ton b cc
thng tin nh OS, phn mm, d liu, n cn c gi l b nh ph hay b
nh ngoi, thuc loi b nh bt bin.
Cu 47: Cc phng php c s dng qun l, cp pht cc block a
cho cc File.
- HH chia khng gian a thnh nhng phn c kch thc bng nhau gi l
Block. Ni dung ca 1 file c lu tr trong khi ny
1. Qun l cc Block t do, HH dng phng php Bitmap Mi khi t
do tng ng vi bit 0. Dng bng bitmap, mi phn t trong bng cho bit
trng thi ca Block trn a. Nh vy khi cp pht 1 file c n khi t do th HH
s tm n bt = 0 trn bng Bitmap ny cp pht cho file .
2. Cp pht theo danh sch lin kt: Chin lc ny c th hin 1 danh
sch lin kt cc Block cha ni dung ca 1 file. T u tin ca khi u tin
s c s dng mt con tr tr n khi tip theo v cho n ht
3. Cp pht theo danh sch lin kt s dng ch mc: Lu cc con tr trn
vo mt bng ch mc, np bng ch mc ny vo b nh khi HH c ni dung
ca file trn a.

Cu 49: Phn bit Device, Driver v Device Controller.
Divice controler : iu khin cng vic phn c ca thit b , thuc v phn cng .
Lm vic ng thi song song v c lp vi CPU

Divice driver : h tr tng tc ngi dng vi thit b , thuc v phn mm .