Tuyn tp Bo co Hi ngh Sinh vin Nghin cu Khoa hc ln th 6

i hc Nng - 2008

THI GIAN LOGIC VECTOR V VN NG B HA CC TIN TRNH TRONG BI TON BI XE NHIU CNG
LOGIC VECTOR TIME AND SYNCHRONIZATION OF PROCESSES IN PARK WITH DISTRIBUTED STATIONS SVTH: NG PHC HUY
Lp 04CCT01, Trng i Hc S Phm.

GVHD: PGS.TSKH. TRN QUC CHIN

Khoa Tin hc, Trng i Hc S Phm.
TM TT Ngy nay, mt trong nhng hng nghin cu quan trng trong h thng phn tn l vn ng b ha cc tin trnh s dng ti nguyn dng chung. t c iu th chng ta phi m bo c trt t nh nhau cc thng ip yu cu ti nguyn tt c cc trm/my ch c trong h. ti tp trung nghin cu vn ng b ha cc tin trnh ca bi ton bi xe nhiu cng vi h thng thi gian vector (Vector time) ca Fidge, Mattern v Schmuck. Gii php ny c th m bo c trt t nhn qu cht ch ca cc s kin din ra trong h thng phn tn, m bo cc tin trnh trong bi ton hot ng hon ton n khp vi nhau v t c trng thi gn b ti nguyn thng tin dng chung. ABSTRACT Nowadays, synchronization of processes in distributed system is very important and this requires people to guarantee the same order among messages sent and received by servers. This research paper concentrates on vector time invented by Fidge, Mattern and Schmuck, and synchronization of processes in park with distributed stations. This method can lead to complete causal order between events, and can satisfy the synchronization of processes and common information resources in distributed system.

1. t vn Mt h thng phn tn bt k no cng c cu to t n thnh phn. Cc thnh phn ny c th l cc tin trnh hoc cc trm, cc nt hoc cc my Server khng dng b nh chung v lin lc vi nhau bng cch duy nht l trao i thng ip. Mi mt thnh phn nh th hot ng nh mt otomat c ngha l n trin khai cc php ton c kh nng thay i trng thi ca mnh v ca ton h thng. Cc php ton thc hin bng mt trong nhng thnh phn va nu phi c sp xp mt cch t nhin theo nhng trnh t din ra. Nu mt tin trnh no cho php cha nhiu lung, trn h thng n b x l, chnh l trt t thc hin cc lnh trn b x l ny. Chnh b x l ny m nhn vai tr sp xp cc s kin. Vic xc nh trt t cc s kin trn h thng a b x l l mt vn phc tp lin quan n nhng kh khn trong vic duy tr mt thi gian tuyt i gn b. i vi h tin hc phn tn, vic thng nht cc gi tr ca ng h vt l ng b ha cc s kin l vic lm khng kh thi v nhng l do sau y: tr ca truyn thng. S khng thng nht cc ng h vt l theo mt chun nht nh. X l khng theo thi gian thc. 2. Thi gian logic vector 1. Gii thiu

279

Tuyn tp Bo co Hi ngh Sinh vin Nghin cu Khoa hc ln th 6

i hc Nng - 2008

H thng ng h vector c Fidge, Mattern v Schmuck xut. Mi ng h l mt vector n chiu th hin bi n phn t khng m. Mi trm Si nm gi mt vector Hi [1..n], vi Hi c gi l ng h cc b ca trm Si (i l s th t ca trm Si trong h, 1 i n , n l s trm c trong h). Hi[j] cho thy hiu bit mi nht ca Si v thi gian cc b ca trm Sj. Nh vy thi gian vector cho ta thy ton cnh ca thi gian logic gia cc trm. 2. Cp nht ng h logic Cc quy lut mt trm Si cp nht li ng h logic vector ca mnh: Trc khi thc hin mt s kin bt k, Si cp nht li thi gian logic ca n nh sau: Hi[i]=Hi[i] + d (Vi d l mt s gia) Trc khi gi mt thng ip m i, trm Si s gn nhn thi gian cho thng ip y theo thi gian t mi nht ca trm Si vo thi im gi. Trm Sj khi nhn c thng ip s cp nht li ng h logic ca n theo cng thc: Hj = sup( Hj ,t); Vi sup(u,v)=w; w[i]=max(u[i],v[i]) (u, v, w l cc vector n chiu; 1in; 1in) 3. So snh hai vector Cho hai vector H1, H2 vi kch thc thc n, chng c th c so snh vi nhau theo cng thc sau y: H1H2 nu H1[i]H2[i] vi 1i n H1<H2 nu H1H2 v not (H1=H2). H1||H2 nu not (H1<H2) and not (H2<H1). 4. Xc lp th t nhn qu gia hai s kin Vic xc lp trt t nhn qu ca hai s kin e1 v e2 bt k c thc hin da trn nhng quy lut sau y: Quy tc 1: Nu hai s kin e1, e2 xy ra trn cng mt trm Si (i l s th t ca trm trong h), khi e1e2 khi v ch khi Hi(e1)<Hi(e2). Quy tc 2: Nu e1 l s kin gi i mt thng ip m trn mt trm, v e2 l s kin nhn c chnh thng ip th e1e2. Quy tc 3: Nu hai s kin e1, e2 xy ra trn hai trm Si, Sj bt k trong h (i, j l s th t ca trm) th ta c e1e2 Hi(e1)<Hj(e2). Quy tc 4 :Nu hai s kin e1, e2 ta c e1||e2 H(e1)||H(e2). 3. Bi ton bi xe nhiu cng Bi ton c pht biu nh sau: C mt bi xe hin i trong c m ch xe v n cng vo/ra, ti mi cng c ngi bo v c nhim v phn phi cho cc xe c th.

280

Tuyn tp Bo co Hi ngh Sinh vin Nghin cu Khoa hc ln th 6

i hc Nng - 2008

M hnh ca bi xe nhiu cng Trong bi ton, chng ta xem cc trm gc l cc Server, ngi thc gi cng l cc chng trnh ci t trn cc Server, cc ch trong bi xe l cc ti nguyn. Ti mi trm s c hai tin trnh, trong , mt tin trnh pht c nhim v truyn i cc thng ip: Thng ip kin ngh vo bi, hoc ra khi bi, hoc yu cu cung cp, tin trnh nhn c nhim v nhn cc thng ip truyn n n. Khi mt xe yu cu vo v tr u, c ngha l tin trnh yu cu ti nguyn dng chung. Ngc li, khi mt xe yu cu ra khi v tr u, ngha l tin trnh khuyn ngh gii phng ti nguyn dng chung. Bi ton xe c t nht l hai cng, y ta gi s l c bn cng. S lng v tr trong bi l 25, mi cng tng ng vi mt trm trn mng. Mi trm c mt a ch IP duy nht nh danh cho trm v mt Port quy nh dch v hot ng trn cng . Ni cch khc, h thng bi xe l mt h thng a Server bao gm Server1 (bo v 1), Server2 (bo v 2), Server3 (bo v 3), Server4 (bo v 4). Mi Server u c mt c s d liu ring r cha d liu. D liu y l cc thng tin vo v ra ca cc xe. Nh vy, ti mt trm no , mt xe yu cu c vo bi th tin trnh pht ti trm ny s pht sinh cc thng ip v gi cc thng ip n trm khc v ngay c chnh n. Nhng thng ip ny s c nhn bi cc tin trnh nhn t trm nhn v a vo hng i cc b ca n. Phn tch bi ton bi xe trn, chng ta nhn thy vic sp xp cc thng ip c pht ra t cc trm l iu cc k quan trng m bo tnh ng b ca d liu nhm qun l tt cc dng xe vo v ra. Vn ny t ra yu cu phi duy tr mt thi gian tuyt i ng b. 4. Gii php cho bi ton bi xe nhiu cng Vic ng b ha cc tin trnh vo v ra trong bi ton bi xe c thc hin nh gii thut loi tr tng h phn tn nh du trn c s thi gian vector. Gi n l s trm trong h, m1 l thng ip yu cu vo bi, m2 l thng ip tr li ca tin trnh Pj cho tin trnh Pj khi nhn c thng ip yu cu t tin trnh Pi, m3 l thng ip yu cu ra khi bi ca tin trnh Pi. Vi i, j l s th t ca cc trm trong h, 1 i n, 1 j n, H1, H2, H3 l du ca thng ip m1, m2, m3 (Quy nh thi gian logic ti thi im gi thng ip).

281

Tuyn tp Bo co Hi ngh Sinh vin Nghin cu Khoa hc ln th 6

i hc Nng - 2008

Khi tin trnh Pi mun vo bi th qu trnh gi v nhn thng ip s xy ra nh sau: Pi gi thng ip yu cu vo m1 cho tt c cc tin trnh trong mng Pj (vi 1jn). Pj nhn c thng ip ny th y thng ip vo hng i cc b ca trm v tr li cho Pi bng thng ip m2. Ti Pi sau khi nhn c thng ip tr li (t tt c cc trm) ri da trn s xem xt yu cu ca n xem c tip tc vo bi khng. Tin trnh Pi mun ra khi bi: Pi gi thng ip yu cu ra m3 cho tt c cc tin trnh khc trong mng. Xa yu cu vo tng ng ca n trong hng i cc b. 5. Kt lun ti nhm tp trung nghin cu v thi gian vector v vn dng thi gian nhm tin hnh ng b ha cc tin trnh trong bi ton Bi xe nhiu cng v t c nhng kt qu sau: M phng bi ton bi xe l mt h thng a Server trong h phn tn. Xc lp trt t nhn qu cht ch ca cc thng ip trn c s thi gian vector.

- Da vo trt t nhn qu cht ch gia cc thng ip, xy dng gii php ng b ha d liu gia cc trm. - Kt qu thu c cho thy s hp lc chnh xc gia cc bo v ca cc trm bng cch trao i thng ip m bo iu khin chnh xc cc dng xe vo v ra. Nhng kt qu m bi ton bi xe t c l rt ng khch l bi v n c th pht trin gii quyt nhng bi ton tng t t ra trong thc t nh bi ton t v my bay, t ni du lch, hoc cc ng dng ln nh thng mi in t, gio dc in ty l nhng bi ton cn phn tn cc chc nng ca n trn cc trm thi gian tr li c kt qu tt hn. Do n cn c m phng nh mt h a Server trong h phn tn. V lng thng tin ca chng rt ln v nhu cu giao dch rt nhiu, do cn phn tn cc giao dch trn cc trm khc nhau thi gian giao dch nhanh chng v chnh xc, trnh lng ph ti nguyn v tranh chp ti nguyn. Mun vy, gii php xy dng cn phi m bo mt s ng b d liu gia cc trm ti mi thi im. iu ny ta hon ton c th tin tng kt qu thu c t bi ton Bi xe. ti c th c nghin cu tip theo nhng hng sau: - Tin hnh gim kch thc ca nhn thi gian vector khi nh vo thng ip v gi i trn ng truyn. - To lt ct n nh (Consistent Cut) v nh chp quang cnh h thng (Snapshot) nhm x l trng hp mng b s c, tin hnh khi phc li tnh trng n nh ca mng trc s c.

282

Tuyn tp Bo co Hi ngh Sinh vin Nghin cu Khoa hc ln th 6

i hc Nng - 2008

TI LIU THAM KHO [1] PGS-TS L Vn Sn (2002), H tin hc phn tn, NXB i hc Quc gia TP.H Ch Minh. [2] PGS-TS L Vn Sn (1999), Nguyn l h iu hnh, Gio trnh. [3] Nguyn Kim Tun (2004), Gio trnh l thuyt h iu hnh, Khoa CNTT-Trng HKH Hu. [4] K thut lp trnh Java (2002), Hong c Hi-Nguyn T Thnh, Nh xut bn lao ng x hi. [5] Victor Larios, Flix F.Ramos (2004), Advanced Distributed System, Third Intenational School and Symposium, ISSAD. [6] Nicola Santoro (1997), Design and Analysis of distributed algorithms, vWiley. [7] K Mani Chandy (1985), Distributed Snapshots- Determining Global States of Distributed System, University of Texas. [8] M.Raynal, M.Singhal (1995), Logical Time: A way to capture Causality in Distributed System, Institut National de Recherche en infomatique et en automatiue. [9] Michel Raynal, Mukesh Singhal, Capturing Causality in Distributed Systems, University of Rennes, Ohio State University. [10] J.Wetch (1998), Distributed Algorithms and Sysrtem, A&M University. [11] Friedmann Mattern, VirtualTime and Global State of Distributed Systems, University of Kaiserslautern, Germany. [12] William Grosso (2001), Java RMI, ORelly. [13] John O Donahue (2002 , Java Database Programming Bible, Wiley. [14] Chris Adamson, Joshua Marinacci (2002), Swing Hacks, ORelly. [15] Dick Steflik, Prashant Sridharan, Richard Steflik (2003), Advanced Java Networking, ORelly. [16] www.javavietnam.org [17] www.ddth.com

283