CNG N TP H PHN TN

A. Phn L thuyt
1.nh ngha h phn tn. Cho bit vai tr v tr v ngha ca h phn tn trong
vic pht trin Cng ngh Thng tin ng i.
L h thng x l thng tin bao gm nhiu b x l hoc b x l nm ti cc v
tr khc nhau v c lin kt vi nhau thng qua phng tin vin thng di s
iu khin thng nht ca mt h iu hnh (iu hnh y khng phi l h
iu hnh m l mt hnh ng iu hnh).
H tin hc phn tn to ra bc ngot v i so vi h tp trung v h khchch. Vic tnh ton phn tn v c bn ging vi vic tnh ton ca h khch ch
trn phm vi rng ln. D liu c cha trn nhiu my ch ti nhiu v tr a
l khc nhau kt ni thng qua mng din rng.
H phn tn l phn tn ha cc qu trnh x l thng tin v thc hin cng vic
cc trm xa nhau. l c s cn bn cho vic xy dng cc ng dng ln
nh thng mi in t, chnh ph in t
2.Hy nu nhng im ging nhau v khc nhau gia h phn tn v h qun tr c
s d liu phn tn.
Ging:
- S dng kt hp nhiu my tp trung, trn mi my u c lu tr mt bn sao
ging nhau.
- Ti nguyn ca h l ti nguyn chia s
Khc:
- H phn tn l h thng x l thng tin bao gm nhiu b x l hoc b x l
nm ti cc v tr khc nhau, c lin kt thng qua phng tin truyn thng
di s iu khin thng nht ca mt h iu hnh, cn h qun tr CSDL phn
tn l mt h thng phn mm cho php qun l cc CSDL phn tn.
- V c bn h qun tr c s d liu phn tn l mt phn mm qun tr cc d
liu c t cc trm khc nhau, c lp vi nhau v d liu nhng li kt hp
vi nhau v mt logic. Cn h phn tn l mt h thng bao gm 4 thc th, nh
vy h qun tr CSDL c th thuc h phn tn no .
- Mc ch ca h phn tn l a dng cn h qun tr CSDL ch c mc ch qun
l c s d liu
3.Trnh by cc mc tiu c bn khi thit k kin trc h phn tn.
Tnh hiu qu: Tc tnh ton v thng lng h thng c th c ci thin
qua vic x l phn tn v dng chung ti nu h thng truyn thng c thit k
cn thn.
Tnh mm do: Tnh mm do t cch nhn h thng l kh nng c th ca h
thng pht trin v di chuyn. Cc thuc tnh chnh bao gm tnh module ho,
tnh v hng, tnh di chuyn c v tnh tng h
Tnh nht qun: H thng phi c kh nng duy tr tnh ton vn ca n vi cc k
thut iu khin tng tranh thch hp, iu khin li v cc th tc khc phc li.

iu khin tng tranh trong d liu v cc file l kt qu ch yu trong cc h

thng file phn tn.
Tnh bn vng: L vn quan trng trong h thng phn tn. Tnh bn vng i
vi kh nng chu li c ngha l h thng c kh nng t khi ng li ti trng
thi m tnh ton vn ca h thng c duy tr vi s gim st hiu nng ca
n.
4.Anh (ch) hy m t mt v d ng dng c trng cho h phn tn.
Mt v d ca h thng phn tn l World Wide Web. Khi bn xem mt trang web
trn mt site, thc ra bn ang s dng mt h thng phn tn c cha site . Khi
bn duyt web, trnh duyt ca bn chy trn my tnh ca bn giao tip vi nhng
my ch web khc nhau v cung cp cho bn cc trang web m bn yu cu.
Rt c th trnh duyt ca bn dng qua mt my ch proxy truy cp n ni
dung cc trang web cha trn my ch web nhanh chng v an ton hn.
c th xc nh nhng my ch ny, trnh duyt phi dng h thng tn min
phn tn DNS. Trnh duyt c th truy cp ti tt c nhng my ch ny trn
Internet thng qua h thng cc router m chnh bn thn chng cng to nn mt
h thng phn tn khng l.
5.Trnh by vn nh danh. Minh ha bng Internet.
6.Trnh by 8 dng trong sut cho m hnh tham chiu x l phn tn m.
7.Trong cc c trng c bn ca h phn tn, theo anh (ch) c trng no l quan
trng nht, v sao?
8.Trnh by v ch kha (blocked) v khng kha (non blocked) trong qu trnh
giao tip gia Client v Server.
9.Trnh by gii thut ng b ha ng h vt l Berkeley. Cho v d.
10.Hy pht biu nguyn l nhiu bn sao. Trong h phn tn, nhiu bn sao c
s dng cho mc ch g?
Nguyn l c bn l ti mi h thng cc b s lu bn sao d liu ang c ti tt
c cc h thng khc tham gia vo h. Ti mi my cc b khi thao tc vi d liu
ca mnh, nu thay i phi lm ti cho tt c cc h thng khc trong h.
Trong h phn tn bn sao c s dng tng tc truy xut d liu, ti cc
my client h thng s truy cp thng tin cc b ca n. Ngoi ra cc bn sao s
gip tng cng kh nng chu li v phc hi khi mt my trm b hng.
B. Phn Bi tp
1.Nhn qu v thi gian
Cho bit nhn thi gian vecto ca cc s kin
Tm nht ct nht qun, nht ct khng nht qun
2.Bu th lnh trn vng
Bu th lnh trn mng vng khng ng b c phc tp thng bo O(nlogn)
3.Loi tr ln nhau
Gii thut test&set
4.Nht qun v lp: tp trung vo cc m hnh ly d liu lm trung tm.

Gii thut bu th lnh cho mng khng ng b vi phc tp O(n log n)

- T tng: bu chn c thc hin ti b x l vi ID bt k, bu chn theo 2
chiu vi min ln cn k = 1, 2, .... Gii thut chn BXL c ID ln nht l th lnh.
+ Vi pi khi bt u thc hin bu th t trng thi l Active, gi i mt thng
bo c Leader(ID,k=1) theo hai chiu tri v phi.
Vi cc pj: nu trng thi PASSIVE th ch chuyn tip thng bo theo chiu
quy nh
- Nhn thng bo s: Gim k = k -1, xem k = 0 hay cha?
0 th so snh ID ca mnh vi ID trong thng bo:+ Nu k
. Ln hn ID trong thng bo th: nut (chn) thng bo, gi tr li cho pi ID ca
mnh (mess(ID_Max)).
. Nh hn ID trong thng bo, t trng thi ca mnh thnh PASSIVE, chuyn
tip thng bo sang BXL bn cnh theo chiu quy nh.
. Bng ID trong thng bo: n l th lnh.
+ Nu k = 0 (kt thc min ln cn), cc nt gi li cho pi (mess(ID_Max))
+ Khi mess(ID) quay v nt ngun:
- Nu nhn c cc mess(ID_Max) vi ID_Max nh hn ca mnh th s m
rng min ln cn cho t thm d tip theo
- Nu nhn c ID_Max ln hn th pi s la chn gi tr ln nht trong s cc
ID nhn c v t trng thi ca mnh thnh PASSIVE, ng thi gi i mt
thng bo Selection(ID) ti BXL c ID tng ng bt u cuc bu chn mi.