Distribution File System

11,1 KIN TRC 11.1.1 Kin trc Client-Server Nhiu h thng file DFS c t chc theo kin trc Client-Server. Network File System (NFS) ca SunMicrosystem l mt trong nhng trin khai rng ri nht cho h thng UNIXbased. c bit, chng ta s tp trung vo NFSv3, phin bn th 3 ca NFS (Callaghan nm 2000) v NFSv4, gn y nht (Shepler et al.2003). v tm hiu v s khc bit gia chng. tng c bn ca NFS l mi File Server s cung cp mt chun cho h thng file cc b ca n. Ni cch khc, mi file cc b c thc hin c t nh th no. Mi h thng my ch s c chun ha ging nh vy. Cch tip cn ny c p dng cho cc h thng phn phi file rt tt. NFS i km vi mt giao thc cho php client c th truy cp ln h thng lu tr. Do cho php kin trc ny c th c thc hin trn cc h thng my tnh khc nhau, cc h iu hnh khc nhau. Cc m hnh ca NFS v cc h thng, l mt dch v truy cp t xa. Trong m hnh ny, client c cho php truy cp trong sut i vi mt h thng file c qun l bi mt my ch t xa. Tuy nhin, client s khng bit v tr thc t ca cc files c lu tr trn server. Thay vo , h c cung cp mt giao din ca mt file system tng t nh giao din c cung cp bi mt h thng files cc b thng thng. c bit, clients c cung cp mt giao din c cha cc thao tc ca cc files khc nhau, nhng my ch chu trch nhim thc hin nhng hot ng ny. M hnh ny do cng c gi l m hnh truy cp t xa.

Ngc li, vic upload/download ca mt client i vi mt files cc b sau khi ti v t my ch, sau khi client hon tt vic chnh sa tp tin ny ti my cc b. N s c ti ln

trn server mt ln na cho cc clients khc s dng. Kin trc ny c thc hin nh mt FTP server . NFS c s cho nhiu h iu hnh khc nhau, mc d cc phin bn chy trn UNIX lun chim u th. i vi hu nh tt c cc h thng UNIX hin i, NFS thng c thc hin theo kin trc lp ,c thy trong hnh 11.2

Mt client truy cp ln file system bng cch s dng cc li gi c cung cp bi h iu hnh ca h. Tuy nhin, giao din h thng file UNIX local c thay th bng mt giao din Virtual File System (VFS), chun giao tip vi h thng file khc nhau (Kleiman, 1986). Vi NFS, hot ng trn giao din VFS hoc thng qua mt h thng tp tin cc b, hoc thng qua mt thnh phn ring bit NFS client, c qun l truy cp vo my ch lu tr d liu t xa. Trong NFS, tt c cc giao tip client-server c thc hin thng qua RPCs.Lient NFSc. V pha server, chng ta thy mt cch thc t chc tng t. Cc my ch NFS chu trch nhim x l yu cu ca client. M hnh h file c cung cp bi NFS ging nh cung cp bi h thng da trn UNIX. Cc tp tin ang c coi l cc chui uninterpreted byte. Chng c phn cp t chc thnh mt th, trong cc nt i din cc th mc v tp tin. NFS cng h tr cc lin kt cng nh bt k file no trn h thng UNIX. truy cp mt tp tin, mt client u tin phi tra cu tn ca n trong mt dch v xc nh tn v c c cc file mong mun. Hn na, mi tp tin

c mt s thuc tnh c gi tr c th c xem xt v thay i. Chng ta tr li vo vic t tn ny chi tit trong chng ny. 11.1.2 Cluster Based Distributed File Systems NFS l mt v d cho nhiu h thng phn, c t chc theo mt kin trc client-server truyn thng. Kin trc ny c s dng cho cc cm(cluster) my ch vi mt vi s khc bit. Gi s cc cm my ch c s dng cho cc ng dng song song. Mt cng ngh ni ting l trin khai l cc k thut phn chia tp tin, l mt tp tin duy nht c phn phi trn nhiu my ch. tng c bn l: bng cch phn phi mt tp tin ln trn nhiu my ch,.V hot ng tt nu ng dng c t chc trong i truy cp d liu song song c ngha. iu ny thng i hi rng cc d liu c lu tr trong tp tin c cu trc rt thng xuyn.

D liu s dng c thc hin bng cch s dng cc hot ng ghi (Wirte). Cc client xc nh v tr v bt u ghi, c th l cc byte bng vn bn hoc d liu. Ngoi ra, n c th hng dn cc my ch m bo rng tt c cc d liu phi c ghi vo lu tr n nh (chng ti tho lun v lu tr n nh nm Chap.8). Vi vic lu tr nhiw vy m bo cc my ch lun hot ng k c khi mt in, li h iu hnh hay li phn cng.. Th v hn l cc trng hp t chc mt h thng tp tin phn phi cho rt trung tm d liu ln chng hn nh nhng ngi s dng bi cc cng ty nh Amazon v Google. Cc cng ty cung cp dch v cho cc khch hng Web kt qu trong ln c v cp nht n mt s lng ln cc tp tin phn phi trn hng chc ngn my tnh [xem cng Barroso et al. (2003). Trong mi trng nh vy, gi nh truyn thng lin quan n h thng tp tin phn phi khng cn nm gi. V d, chng ta c th mong i ti bt k thi im duy nht s c mt my tnh b hng hc.

 gii quyt nhng vn ny, Google, v d, pht trin Goo-ring ca mnh gle tp tin h thng (GFS), trong thit k c m t trong Ghemawat et al. (2003). Google tp tin c xu hng l rt ln, thng khc nhau, ln nhiu giga- byte, mi mt trong nhng ni cha rt nhiu vt th nh hn. Hn na, cp nht cc tp tin thng din ra bng cch thm d liu hn l ghi ln cc b phn ca mt tp tin. nhng quan st, cng vi thc t l cc li my ch l cc ch tiu ch khng phi l ngoi l, dn n xy dng cc cm my ch nh hnh. 115.

Mi cm GFS bao gm mt tng th duy nht cng vi cc my ch nhiu on.Mi tp tin GFS c chia thnh nhiu phn 64 MB mi, sau khi cc khi ny c phn phi qua nhng g c gi l my ch chunk.Mt quan st quan trng l mt bc thy GFS c lin lc vi ch cho thng tin siu d liu.c bit, mt khch hng GFS vt qua mt tn tp tin v ch s on lm ch, mong i mt a ch lin lc cho on. a ch lin lc c cha tt c cc thng tin truy cp vo my ch on chnh xc c c nhng on tp tin cn thit. kt thc ny, ch GFS c bn duy tr mt khng gian tn, cng vi mt lp bn t tn tp tin khi. Mi on c mt nh danh c lin quan gip s cho php mt my ch on tra cu n. Ngoi ra, ch theo di mt on nm. Khi c nhn rng x l tht bi, nhng khng c nhiu hn th. Mt tnh nng th v l ch GFS khng c gng gi mt ti khon chnh xc ca v tr on. Thay vo , thnh thong lin lc vi on my ch xem nhng phn m h c lu tr.

u im ca chng trnh ny l s n gin. Lu rng tng th l trong kim sot phn b khi my ch chunk. Ngoi ra, cc my ch chunk gi mt ti khon ca nhng g h c lu tr. Kt qu l, mt khi cc ch thu c v tr on, n c mt bc tranh chnh xc ni m d liu c lu tr. Tuy nhin, vn s tr nn phc tp nu iu ny xem c ph hp tt c cc thi gian. V d, mi khi mt my ch on b treo hoc khi mt my ch c thm vo, cc ch s cn phi c thng bo. Thay vo , n l n gin hn nhiu lm mi thng tin ca n t cc thit lp hin ti ca on cc my ch thng qua b phiu. GFS khch hng ch n gin l c c bit m on my ch tng th tin c lu tr cc d liu yu cu. Bi v khi c nhn rng anyway, c mt xc sut cao l mt on c t nht mt trong cc my ch chunk. Ti sao quy m chng trnh ny? Mt vn thit k quan trng l tng th l phn ln trong kim sot, nhng n khng to thnh mt nt c chai do cho tt c cc cng vic cn phi lm. Hai loi quan trng ca cc bin php c thc hin ph hp kh nng m rng. u tin, v n nay mt trong nhng quan trng nht, l phn ln cc cng vic thc t thc hin bi cc my ch chunk. Khi khch hng cn truy cp d liu, a ch lin lc ch tm ra my ch chunk gi d liu . Sau , n ch giao tip vi cc my ch chunk. Khi c nhn rng theo chnh-sao lu n. Khi khch hng c thc hin mt hot ng cp nht, a ch lin lc gn nht chunk my ch ang nm gi d liu , v y cc cp nht ca n ti my ch . my ch ny s y cp nht gn nht tip theo gi d liu, v nh vy. Mt khi tt c cp nht c tuyn truyn, khch hng s lin lc vi my ch on chnh, nhng ngi sau s ch nh mt s trnh t hot ng cp nht v vt qua n trn cc bn sao lu. Trong khi , thc s c gi ra khi vng lp. Th hai, (th bc) tn khng gian cho cc tp tin c thc hin bng cch s dng mt n gin cp mt bng, trong tn ng dn c nh x siu d liu (chng hn nh tng ng vi inodes trong cc h thng tp tin truyn thng). Hn na, ton b bng ny c gi trong b nh chnh, cng vi cc bn ca cc tp tin n khi. Cp nht v nhng d liu ny ng nhp lu tr lin tc. Khi ng nhp tr nn qu ln, trm kim sot thc hin cc d liu chnh ca b nh c lu tr trong mt cch m n c th c ngay lp tc nh x vo b nh chnh. Nh mt h qu, cng ca I / O ca mt bc thy GFS c gim mnh. T chc ny cho php mt tng th duy nht kim sot mt on vi trm dch VER, m l mt kch thc ng k cho mt cm duy nht. Sau t chc mt dch v nh Google

vo cc dch v nh hn c nh x vo cc cm, khng kh tng tng rng mt b su tp ln ca cc cm c th c thc hin lm vic vi nhau. 11.1.3 i xng Kin trc Tt nhin, t chc hon ton i xng c da trn cng ngh peer-to-peer cng tn ti. Tt c cc xut hin nay s dng mt h thng da trn DHT-phn phi d liu, kt hp vi mt c ch tra cu quan trng. Mt khc bit quan trng l cho d h xy dng mt h thng tp tin trn u trang ca mt lp lu tr phn phi, hay ton b cc tp tin c lu tr trn cc nt tham gia. Mt v d v cc loi u tin ca h thng tp tin l Ivy, mt h thng tp tin phn tn c xy dng bng cch s dng mt dy nhau DHT-da trn h thng. Ivy c m t trong Muthitacharoen etal. (2002). H thng ca h v c bn bao gm ba lp ring bit nh trong Hnh 11-6. Lp thp nht c hnh thnh bi mt h thng dy nhau cung cp c bn decen tralized tra cu c s. gia l mt khi theo nh hng phn phi y Stor tui lp. Cui cng, trn nh c mt lp thc hin mt h thng tp tin NFS.

Lu tr d liu trong Ivy c thc hin bi Chord-da trn nh hng, khi phn phi h thng lu tr c gi l DHash (Dabek et al, 2001). V bn cht, DHash l kh n gin. N ch bit v cc khi d liu, mi khi thng c kch thc ca 8 KB. Ivy s dng hai loi ca cc khi d liu. Mt khi bm ni dung c lin quan trng im, c tnh nh bm an ton ca ni dung ca khi. Bng cch ny, bt c khi no mt khi c nhn ln, mt khch hng ngay

lp tc c th kim tra xem liu khi chnh xc c nhn ln, hoc phin bn khc hoc b hng c tr v. 11.2 PROCESSES Khi ni n cc tin trnh, Distributeion File System khng c tnh cht phn bit. Trong nhiu trng hp, s c s hp tc qun l khc nhau : my ch lu tr v qun l file v cc chc nng khc nhau. C nhiu vn cn quan tm trong tin trnh ca h thng. NFS l mt v d . Mt trong nhng tnh nng khc bit ca n (so vi cc DFS). Ni cch khc, cc giao thc NFS khng yu cu rng cc my ch duy tr bt k mt quc gia no. u im chnh l tnh n gin. V d, khi xy ra s c, ta khng cn phi quay tr li li trng thi trc . Tuy nhin Staeless Aproach trong giao thc NFS khng th lun thc hin c mt cch hon chnh. V d vic lock mt file khng th c thc hin bi Stateless server . Trong trng hp ny vic kha ring r cc file s c thc hin. Tng t nh vy, cc giao thc xc thc nht nh yu cu cc my ch duy tr trng thi Client. Tuy nhin, cc my ch NFS c th c thit k ch c rt t thng tin v client cn thit c duy tr. i vi hu ht cc phn, chng trnh lm vic y . Bt u t phin bn th 4, Stateless A khng b ph nhn. Giao thc mi c thit k : mt my ch khng cn phi duy tr nhiu thng tin client ca mnh. Bn cnh nhng vn , c nhng l do khc la chn Statefull Apraoch .Mt l do quan trng l NFS version 4 c p dng lm vic trn mng WAN. iu ny i hi client c th s dng c hiu qu cache, Giao thc nh vy thng xuyn lm vic tt nht trong hp tc vi mt my ch duy tr mt s thng tin onfiles v d clients. lin kt mt hp ng thu vi mi tp tin, n tay ra cho khch hng, ha hn s cung cp cho cc khch hang c quyn c v vit truy cp cho n khi hp ng thu expiresoris lm mi. Chng ti tr li cc vn nh sau trong chng ny. S khc bit r rng nht vi cc phin bn trc l h tr cho cc chun m . Ngoi ra, NFS h tr cc th tc gi li bi mt my ch c th lm mt RPC mt khch hng. R rng, cc callbacks cng yu cu mt server theo di client. 11.3.1 RPCs trong NFS Trong NFS, tt c cc thng tin lin lc gia my khch v my ch tin cng cc giao thc Open Network Computing (ONC RPC) RPC, quy nh Srinivasan (1995a), cng vi mt tiu chun cho i din marshaled d liu (Srinivasan, 1995b). ONC RPC tng t nh cc h thng khc RPC nh chng ta tho lun trong Chap. 4.

Mi hot ng NFS c th c thc hin nh mt th tc gi t xa mt File Server. Trong thc t, cho n NFSv4, client c lm vic vi cc my ch mt cch d dng nht. c d liu t mt file cho ln u tin, mt client bnh thng s tm kim cc file x l bng cch s dng cc hot ng tra cu, sau n c th ra mt yu cu c(Request to Read), nh trong hnh. 11-7 (a).

Hn ch tr nn r rng khi xem xt vic s dng ca NFS trong mt h thng WAN. Trong trng hp , thm tr ca RPC th hai dn n gim i hiu nng. gii quyt cc vn nh vy, NFSv4 h tr th tc hp cht m mt s RPCs c th c nhm li thnh mt yu cu duy nht, nh hnh. 11-7 (b). Trong v d, client kt hp tra cu v c yu cu vo mt RPC. Trong trng hp ca version 4, n cng l cn m cc tp tin trc khi vic c file ny c th thc hin c. Sau khi tm kim c file mong mun, vic m file c tin hnh, sau my ch vn tip tc vi vic c file. Kt qu v d ny l ch c hai thng ip cn c trao i gia cc my khch v my ch. Cc hot ng nhm li vi nhau trong mt th tc gi duy nht l x l theo th t cc yu cu. Nu c yu cu ng thi t cc clients khc nhau, s khng c cch thc hin trnh xung t. Nu hot ng khng v l do g, sau khng c hot ng hn na trong cc th tc hp cht c thc hin, v li stm thy cho n nay c tr li cho khch hng. Nu vic tm kim khng thnh cng s khng thc hin na. 11.3.2 Cc h thng con RPC2 Mt ci tin hay ca RPCs c pht trin nh mt phn ca Coda trong h thng (Kistler v Satyanarayanan, nm 1992). RPC2 l mt gi phn mm cung cp tnh tin cy RPCs trn giao thc UDP (khng ng tin cy). Mi ln thc hin th tc c gi,code client RPC2

gi mt yu cu n my ch n khi n nhn c phn hi. Nh vy yu cu x l c th mt mt thi gian ty hon tt, cc my ch thng xuyn gi phn hi li cho client cho h bit n vn cn lm vic. Mt tnh nng th v ca RPC2 l h tr cho tc dng khc. Mt tc dng ph l mt c ch m cc my khch v my ch c th giao tip bng cch s dng 1 ng dng vic c th giao thc. Xem xt, v d, mt client m mt video t my ch. Nhng g l cn thit trong trng hp ny l cc my khch v my ch thit lp lin tc dng d liu vi mt ch truyn dn ng thi. Ni cch khc, d liu chuyn t my ch cho client c m bo c trong vng ti thiu v ti a s chm tr end-to-end.

Mt tnh nng ca RPC2 m lm cho n khc nhau t cc RPC h thng khc l ca mnh h tr cho multicast. Mt vn thit k quan trng trong Coda l cc my ch gi theo di trong khch hng c mt bn sao a phng ca mt tp tin. Khi mt tp tin c sa i, mt my ch lm mt hiu lc cc bn sao a phng bng cch thng bo cho cc khch hng thch hp thng qua RPC. R rng, nu mt my ch c th thng bo cho ch c mt khch hng ti mt thi im, hy b hiu lc tt c cc khch hng c th mt mt thi gian, nh minh ha trong hnh. 11-9 (a).

Vn c gy ra bi thc t rng mt RPC i khi c th tht bi. Invali- hn h vi cc tp tin trong mt trnh t nghim ngt c th c tr hon ng k v my ch khng th t c mt khch hng c th b ri, nhng s cung cp cho khch hng ch sau mt thi gian ht hn tng i di. Trong khi , cc khch hng khc vn s c c- ing t bn sao a phng ca h. Mt gii php thay th (v tt hn) c th hin trong hnh. 11-9 (b). y, thay v hy b hiu lc mi bn sao tng ngi mt. my ch s gi mt thng bo hu b hiu lc cho tt c khch hng ti cng mt thi gian. Kt qu l, tt c cc khch hng nonfailing c thng bo thi gian tng t nh n s c c lm mt RPC ngay lp tc. Ngoi ra, cc my ch thng bo trong thi gian ht hn thng thng rng mt s khch hng khng p ng cc RPC, v c th khai bo cc khch hng nh ang b ri. RPCs song song c thc hin bng phng tin ca h thng MultiRPC, l mt phn ca gi RPC2 (Satyanarayanan v Siegel, 1990). mt quan trng kha cnh ca MultiRPC l ni rng cch gi song song ca RPCs l hon ton minh bch callee. Ni cch khc, ngi nhn ca mt cuc gi MuitiRPC khng th distinzuish gi t mt RPC bnh thng. bn cnh ca ngi gi, thc hin song song phn ln cng l minh bch. V d, ng ngha ca MultiRPC trong s hin din ca tht bi nhiu nh RPC bnh thng. Tng t nh vy, c ch tc dng ph c th c s dng trong cng mt cch nh trc. MultiRPC c thc hin bi c bn thc hin cc RPCs nhiu song song. iu ny c ngha l ngi gi mt cch r rng s gi mt yu cu RPC mi ngi nhn. Lm th no- bao gi ht, thay v ngay lp tc ch i mt phn ng, n tr hon chn cho n khi tt c li nhim v c gi i. Ni cch khc, ngi gi gi mt s mt chiu RPCs, sau n ngn chn cho n khi tt c cc cu tr li c nhn c t cc phi khng ngi nhn. Mt cch tip cn thay th thc hin song song ca RPCs Mul tiRPC c cung cp bi thit lp mt nhm multicast, v gi RPC cho tt c thnh vin trong nhm bng cch s dng IF multicast.

11.3.3 File-nh hng truyn thng trong k hoch 9

Cui cng, n l gi tr cp n mt cch tip cn hon ton khc nhau x l truyn thng trong h thng tp tin phn phi. K hoch 9 (Pike et al, 1995). khng phi l qu mt h thng tp tin phn phi, m l afile da trn h thng phn phi. Tt c li ngun c truy cp trong cng mt cch, c th l vi cc tp tin ging nh c php v opera chc, bao gm c ngun ti nguyn nh cc qu trnh v cc giao din mng. iu ny tng c tha hng t UNIX, cng c gng cung cp cc tp tin ging nh giao din li ngun, nhng n c khai thc nhiu hn na v nht qun hn trong k hoch 9. minh ha, giao din mng c i din bi mt h thng tp tin, trong trng hp ny con sisting ca mt b su tp ca tp tin c bit. Cch tip cn ny tng t nh UNIX, mc d giao din mng trong UNIX c i din bi gch v h thng tp tin. (Lu mt h thng tp tin trong bi cnh ny mt ln na l cc thit b khi hp l c cha tt c cc cc d liu v siu d liu bao gm mt b su tp cc tp tin) Trong K hoch 9., v d, mt kt ni TCP c nhn c i din bi mt bao gm th mc con ca tp tin c hin th trong hnh. 11-10.