The Controlled Logical Clock a Global Time for Trace Based Software Monitoring of Parallel Applications in Workstation Clusters
|
|
- Barry Adrian Logan
- 8 years ago
- Views:
Transcription
1 Copyrght 996 IEEE. Copes may not used n any way that mples IEEE endorsement of a product or servce of an employer. Copes may not be offered for sale. The Controlled Logcal Clock a Global Tme for Trace Based Software Montorng of Parallel Applcatons n Workstaton Clusters Rolf Rabensefner Computng Center Unversty of Stuttgart, Allmandrng 3, D-755 Stuttgart, Germany, Tel , e-mal: rabensefner@rus.un-stuttgart.de Abstract Event tracng and montorng of parallel applcatons are dffcult f each processor has ts own unsynchronzed clock. A survey s gven on several strateges to generate a global tme, and ther lmts are dscussed. The controlled logcal clock s a new method based on Lamport s logcal clock and provdes a method to modfy nexact tmestamps of tracefles. The new tmestamps guarantee the clock condton,.e. that the receve event of a message has a later tmestamp than the send event. The corrected tmestamps can also be used for performance measurements wth pars of events n dfferent processes. The controlled logcal clock s motvated and t s analyzed n detal by computer smulatons. No addtonal protocol overhead s needed for the new method whle tracng an applcaton. It can be mplemented as a flter for tracefles or t can be ntegrated nto montor tools for parallel applcatons. Keywords: Logcal tme, global tme, clock, montorng, clock synchronzaton, causalty, dstrbuted computng, parallel computng.. Introducton Wth global tme a correct representaton of the tme sequence of tracng nformaton s possble. Parallel and dstrbuted applcatons can be analyzed to obtan an nsght nto ther behavor and ther performance. On systems wthout global tme there are dfferent strateges of approxmatng a global tme. Ths paper presents a new algorthm the controlled logcal clock. It was developed especally for workstaton clusters or comparable systems and can be used as a flter for tracefles. The processors clocks used for generatng tmestamps are synchronzed subsequently f the tracefle contans backward references. Backward references are messages wth a tmestamp of the send event that s later than the tmestamp of the receve event. The controlled logcal clock modfes the tmestamps to fulfll the clock condton [8],. e. the send event always has an earler tmestamp than the correspondng receve event. Besdes the generaton of the tmestamps and ther collecton n the montor tool there s no addtonal protocol effort. An exchange of the tmestamps along wth the messages s not necessary because those tools have complete nsght nto the trace nformaton of the applcaton. The controlled logcal clock requres clock dfferences to be lmted to about 2 ms by a prevous synchronzaton. Ths can be acheved by an explct synchronzaton before and after the run of the applcaton [2] and a lnear nterpolaton as done by several montor tools, or t can be done by a resources savng contnuous synchronzaton, e. g. wth xntp [22]. The controlled logcal clock does not modfy the tmestamps of the orgnal clocks C as long as the tmestamp of a receve event s later than the tmestamp of the correspondng send event plus the mnmum message delay. The controlled logcal clock s a modfcaton of Lamport s pecewse dfferentable logcal clock LC wth dlc (t)=dt := dc (t)=dt as descrbed also n [6]. Hence as opposed to ths clock, the tme dfference LC C of the controlled logcal clock s lmted. It s well suted for vsualzng the causal order. It can also be used for averaged tme dfference measurements between events n dfferent processes. For such measurements wthn one process the orgnal clock s more approprate. But the tmestamps of the controlled logcal clock can be used also because, n general, ts devaton s less than 5 %. The small devaton s evdent because most montor tools do not support more than one tme scale. 2. Related Works For montorng and performance analyss of parallel and dstrbuted applcatons there are dfferent approaches
2 to synchronzng local clocks. Lamport s dscrete logcal clock [8] can be used drectly for montorng [4, 3]. In addton to ths Raynal [27] proposes an algorthm to prevent the drft between the logcal clocks. The vector clock an enhancement from Fdge [, 2] and Mattern [2] allows an equvalent representaton of the causal order gven by the send/receve event pars. It s used n some montor tools [5,, 9]. In [3] global events are ntroduced and n [25] spontaneous events (e.g. collsons on a network) are taken nto account. In the summary n [29] the lmts of the logcal clock and the vector clock are llustrated. A 2 B C 3 4 global wat 5 6 t real tme 2 global wat LC logcal tme Fgure. Global wats vsualzed n real tme and n dscrete logcal tme A further lmt of the usablty of the logcal clock s shown n Fg.. The example has two global wats. Process C wats untl a message can be receved from A or B. The tme axs s dotted durng perods of watng. In the left pcture the example s vsualzed by usng a real tme axs. In the rght pcture the logcal tme s used as tme scale. Ths representaton s only of lmted value because t seems that process A has sent ts message at t =, but ths message s not taken nto account n the global wat of process C also started at t =. The wat s not fnshed untl process B sends ts message at t = 3. Ths example shows that the logcal clock s not suffcent for vsualzng montor nformaton. A representaton wthout backward references can be acheved alternatvely wth a suffcently exact synchronzaton of the local clocks [5, 8, 2]. Often used methods are an exact synchronzaton and drft estmaton before the begnnng of the applcaton [8, 9] or better before and after the applcaton [2] wth a lnear nterpolaton whle the applcaton s runnng. The exact synchronzaton can be done by determnstc [28] or probablstc [2, 3] methods. Contnuous synchronzaton wth lttle resource usage (e. g. xntp [22]) s normally not suffcently exact due to the large jtter of the message delays n local area networks. The trace based synchronzaton s another alternatve. The dfferences between the clocks are computed by the rule that a receve event must not arrve before the send event plus the mnmum transfer tme. Duda [7] has developed two algorthms, one wth a regresson analyss, and another wth a convex hull. Usng a mnmal spannng tree algorthm Jezequel [6] has adopted Duda s algorthm for any processor topologes. Hofmann [4] has mproved Duda s algorthm by usng a smple mnmum/maxmum strategy, and he has proposed dvdng the executon tme nto several ntervals to compensate dfferent clock drfts n long runnng applcatons. Babaoǧlu and Drummond [, 6] show that an almost no cost clock synchronzaton s possble f the applcaton makes a full message exchange between all processors n suffcent short ntervals. A survey of further work can be found n [3]. The lmts of these methods are gven by the message delay jtter, by the non lnear relaton of message delay and message length, and by a one-sded communcaton topology n some applcatons (e. g. producer/consumer scenaros). The controlled logcal clock s a novel development based on both Lamport s logcal clocks, the dscrete case and that wth dlc (t)=dt := dc (t)=dt. It also contans components of the trace based synchronzaton because t does not need any further protocol overhead f t s used n montor and debug tools. It mplements a subsequent synchronzaton based on exstng tmestamps and ther communcaton relatons. In contrary to the trace based synchronzaton, the controlled logcal clock can also be used n systems wth clock tcks longer than the mnmum message delay. But the controlled logcal clock needs a precedng synchronzaton that lmts the dfferences between the orgnal clocks to the fourfold of the mnmum message delay. 3. The Clock Condton For montorng, clocks are needed whch are suffcently exact for performance measurements and whch hold the clock condton defned below [8]. The clock condton must be held to enable the vsualzaton of a program n a spacetme dagram. Defnton n s the number of processes, e j s the j th event n the process, E = fe j j = ::n; j = ::j max()g s the set of events, and M = f(e l k ;ej )jel s a send event, and k ej s ts correspondng receve eventg s the set of send/receve pars. e j s a nternal event f t s not a send event and not a receve event. For two events e l, k ej the relaton el k happened drectly before e j, shortened by el k ~!ej, s held, f and only f (a) (e l k ;ej )2 M,or () (b) the events are n the same process and they succeed one another,. e. k = ^ l = j. (2) 2
3 The relaton happened before, shortened by!, s the transtve hull of the relaton ~!,. e. the smallest relaton that addtonally satsfes (c) e l k! ej ^ ej! em n =) el k! em n (3) Defnton 2 AclockC : E 7! IR satsfes the Clock Condton f and only f 8 e l e l k 2E;ej2E k! ej =) C(e l k ) < C(ej ) (4) Neglectng dfferent clock drfts the followng theorem can be smply shown: Theorem If the dfferences between the processors clocks are constantly less than the mnmum message delay then the clock condton s held by the processors clocks. A more precse theorem for theoretcal contnuous clocks wth lmted drfts can be found n [7, 2]. In [5] real clocks wth dscrete clock tcks are analyzed. Ths paper examnes the case that the clock dfferences are n general longer than the mnmum message delay, but lmted by about the fourfold of the mnmum message delay. Ths lmt can be achved wth low cpu and network costs by usual software synchronzaton tools. In ths case the premse of Theorem s not held. 4.TheSmpleLogcalClock The smple logcal clock s an enhancement of Lamport s logcal clock. The name smple s chosen to dstngush clearly between t and the controlled logcal clock that s tself based on the smple one. Frst a weak synchronzaton must be done. There are dfferent methods to achve clock errors less than about the fourfold of the mnmum message delay, e.g. SBA samplng before and after the applcaton s run wth a lnear balancng n the meantme [2] or a low cost clock synchronzaton by software (tmeslave, tmed, xntp). Because these methods must not synchronze wth the wall clock tme (UTC), the synchronzaton s modeled wth: Defnton 3 t s the wall clock tme, T (t) s the global tme to whch the process clocks C (t) (=::n) are synchronzed wth lmted errors,.e. constants e and e + exst wth e C (t) T (t) e +. Now for each process the logcal clock LC wll be defned: t nearly stops whle LC > C and else t equals C ;at each receve event t s set on the maxmum of ts current value and of the sender s clock at the tme of sendng plus the mnmum transfer delay. The mnmum transfer delay should be estmated as a byproduct of the synchronzaton at the begnnng or at the end. Ths logcal clock s a modfcaton of Lamport s logcal clock. In the followng t s named the smple logcal clock. In the next secton t wll be enhanced to the controlled logcal clock. Algorthm. The smple logcal clock LC s exactly defned wth 8 max(lc k (e l k )+ k;; LC (e j )+ ; C (t(e j >< ))) f 9 (e l k ;ej )2 M (5) e l k LC (e j ):= max(lc (e j )+ ;C (t(e j ))) otherwse (6) and f j =then the terms >: LC (e j )+ must be omtted wth = mnmal dfference between two events n process,.e. are constants wth > ^ 8 T (t(e j )) T (t(ej )) (7) ;j k; = mnmum message delay of messages from process k to process,.e. k; are constants wth k; > ^ (e l 8 T (t(e j )) T (t(el k )) k; (8) k ;ej )2M The global smple logcal clock s then defned as LC(e j ):=LC (e j ) (9) Theorem 2 The smple logcal clock LC satsfes the clock condton. Proof. The algorthm satsfes Lamport s rules IR and IR2 n [8] and therefore holds the clock condton. 2 In the followng the error wll be modeled based on C : 8 t <t(e j e j )<t e ^ 8 e e C (t) T(t)e + e + () t:t <t<t e.e. the corrected clocks C are at maxmum e + fast and at mnmum e slow n comparson wth the global tme T. Theorem 3 If all clocks C are not more than e + fast then the smple logcal clock LC s also not more than e + fast,.e. 8 C (t(e j )) T (t(ej ))e+ =) 8 LC(e j j ) T (t(ej ))e+ e e j Proof. Assumng there s a (; j) wth LC(e j ) T (t(ej )) >e+ () and wthout loss of generalty e j may be the earlest event satsfyng () (2) 3
4 Case a) LC(e j )=LC(ej ) s defned wth (5). Then LC(e j ) T (t(ej )) (9) = LC(e j ) T (t(ej )) (5) = max(lc k (e l k)+ k; ; LC(e j )+; C(t(e j ))) T (t(ej )) and () f n the maxmum n (5) the frst term s vald: (5; st term) = LC k (e l k)+ k; T (t(e j )) (8) (2) LC k (e l k) T (t(e l k)) e + and () f n the maxmum n (5) the second term s vald: (5;2 nd term) = LC(e j )+ T(t(e j )) (7) LC(e j ) T (t(e j )) (2) e + and () f n the maxmum n (5) the thrd term s vald: (5;3 rd term) = C(t(e j )) T (t(ej )) premse e + Therefore n all three cases ( assumpton (). ) there s a contradcton to the Case b) LC(e j )=LC(ej ) s defned wth (6). Then analog to the cases a) () anda)() the contradcton can be shown. Therefore n all possble cases a contradcton to the assumpton () can be shown and therefore the theorem s proved. 2 Theorem 4 If n a process the clock C s never more than e slow then the smple logcal clock LC n ths process s also never more than e slow,.e. 8 8 T j (t(ej )) C(ej ) e =) 8 T (t(e j )) LC(ej ) e j Proof. T (t(e j )) LC(ej) (9) 8 = T (t(e j ) LC(ej)) < max(lc k (e l k)+ k; ;LC(e j )+; (5;6) = T (t(e j )) C(t(e j ))) f ::: 9 = : max(lc(e j ; )+;C(t(e j ))) otherwse T (t(e j )) C(t(e j )) premse C(t(e j )) e 2 max(:::last term) Observaton There s no symmetry between Theorem 3 and Theorem 4: The beng fast of the smple logcal clock LC s lmted only globally by the maxmum of the beng fast of all nvolved clocks, whereas the beng slow of LC s lmted n each process ndependently by the mnmal beng slow of the correspondng C. A modelng of the errors e and e + for contnuous and dscrete clocks can be seen n [26]. 5. The Controlled Logcal Clock In the Algorthm the term LC k (e l k )+ k; n (5) can cause the logcal clock LC(e j ) to be set forward compared to C (t(e j )). At subsequent events n the same process the term LC (e j )+ n (6) causes that n prncple LC stops (.e. t advances only the small tcks ) untl t has fallen back to the value of C (t(e j )) that s the last term n (5) and (6)). Now the smple logcal clock from Alg. wll be enhanced n two steps to the controlled logcal clock n order to run more contnuously and to prevent the alternate advancng and stoppng. Algorthm 2. LC s the bass of the controlled logcal clock: 8 max(lck (el k )+ k;; LC (ej )+ ; LC (ej )+ j (C (t(e j )) C (t(e j ))); C (t(e j >< ))) f 9 (e l k ;ej )2 M (3) e l k LC (ej ):= max(lc (ej )+ ; LC (ej )+ j (C (t(e j )) C (t(e j ))); C (t(e j ))) otherwse (4) and f j =then the terms >: LC (e j )+ must be omtted wth and k; defned as n Alg. and wth freely selectable j 2 [; ]. Ths algorthm wll be completed later by the control unt n Alg. 3. The global logcal clock s based on the logcal clock of the ndvdual processes LC (e j ):=LC (ej ) (5) Obvously LC Alg: = LC Alg:2 for j. Forj the defnton of LC s dentcal wth Lamport s pecewse dfferentable logcal clock LC wth dlc =dt = dc =dt for the tme between receve events. Theorem 4 the lmtaton of beng slow s also vald for LC. The proof s the same. However Theorem 3 the lmtaton of beng fast s not vald for LC. It s possble to construct examples for any large e and any postve lower lmt mn that has for each choce of j mn an event e j wth LC (e j ) beng fast more than e,.e. LC (e j ) T (t(ej )) >e. The techncal report [26] shows two examples wth unlmted error ncrease. In most cases related to the dstrbuton of the clock errors and wth normal applcatons, that not only communcate but also compute one can assume that mn > :5,.e. that for values less than.5 the logcal clock LC s lmted n ts beng fast. To lmt the beng fast of LC t makes sense to control j 2 [;] by a control loop because normally values nearby are desrable and also possble. Fg. 2 shows ts 4
5 In: C (t(e j )) Out: LC (e j ) In: γ j Logcal clock, γ= Controller j In: LC (e ) In: j In : C (t(e )) j j Out: γ LC (e ) In: Out : j j C (t(e )) LC (e ) Logcal clock, γ= var. D ;s := max(lc (e j ) C (t(e j )); q f actor (D ;s q mn )+q mn ) (8) D ;s := max(lc (ej ) C (t(e j )); q f actor (D ;s q mn )+q mn ) (9) := max (2) j+ := 8 >< >: j degress f D;s >l upper D ;s (2) mn( j = degress; max ) f D;s <l lower D ;s (22) j otherwse (23) Fgure 2. Control loop for j structure. The controller tres to lmt the dfferences between LC and T,.e. t lmts the output error LC T. The controller must estmate the output error ndrectly because T (t(e j )) s unknown. The nput error C T can not be determned for the same reason. Provded that the errors of C are lmted 8 e e e j C (t(e j )) T (t(ej )) e+ e + () the Theorem 3 mply and the error of LC LC C {z } e + + e measurable (LC T ) {z } to be lmted by the controller T s lmted by e + + (LC C ) {z } measurable Ths s the motvaton for the followng controller algorthm: Algorthm 3. For ths algorthm the logcal clocks n the Alg. and 2 are calculated stepwse. In each step s new values for LC (e j ) and LC (ej ) are computed for those processes 2 P s for whch the nput values are already determned (.e. 62 P s,f 9 (e l k ;ej ) 2 M and LC k(e l k ) e l k and LC k (el k ) are not computed n a former step). After each step the control varables j are calculated agan for each 2 P s by the followng algorthm: D ; := q nt (6) D ; := q nt (7) j s an abbrevaton of j;s and j ;s s the ndex of that event, of whch the logcal clock s computed n process n step s. Explanatons: In each step, new logcal clock values are computed for as many processes as possble. The proposed control mechansm computes j+ only on the bass of data belongng to process. Therefore the computaton of the logcal clock values can be partally parallelzed and the computaton of the controller can be fully parallelzed. Wth q nt ;q mn ;q f actor ; max ; degress ;l upper and l lower the controller must be adjusted. Based on the results n Secton 6 the followng values are recommended for Ethernet or FDDI based clusters: q nt = 25s, q mn = 25s, q f actor = :9, max = :95, degress =:9, l upper =2:, l lower =:8. D ;s s a measurement for the devaton of the smple logcal clocks LC from the system clocks C. D ;s computes the maxmum of LC C under forgettng older values after some tme. q f actor 2 (; ) s the forget-factor, see (8). q mn n (8) s a lower lmt for D ;s. It says whch clock errors should be tolerated. q mn should also be used as start value n q nt n (6). D;s s defned n the same way as D ;s. It measures the devaton of the controlled logcal clocks LC from the system clocks C. D;s computes the maxmum of LC C (see (7) and (9)). Wth (2) the controller tres to lmt the devaton D;s as soon as t exceeds the upper lmt (l upper D ;s ). By the reducton of j the behavor of the controlled logcal clock becomes stepwse more alke the behavor of the smple logcal clock. j n (22) s stepwse ncreased as soon as D;s comes below the lower lmt (l lower D ;s ). The upper boundary for ths ncrease s max. max determnes how much the controlled logcal clock s slowed down to compensate for beng fast. 6. Smulaton of the Controlled Logcal Clock The effcency of the controlled logcal clock defned by Alg. 2 and 3 was examned by computer smulatons. The components of ths computer smulaton are the followng: 5
6 (a) the smulated run of a parallel FE-computaton on a regular grd produces the set of events E = fe j g wth the wall clock tmestamps t(e j ), (b) smulated system clocks wth a gven error behavor are used to generate dfferences between C(t(e j )) and t(ej ), (c) the controlled logcal clock computes the values of LC (e j ) and LC(ej),and(d)an analyss module evaluates the controlled logcal clock. Ths secton summarzes the most mportant results. Detals can be found n the techncal report [26]. 6.. The Set of Events The base s a fcttous FE-computaton wth n n 2 processes. Each teraton n each process conssts of. computaton of fnte elements at the borders to 3.. the neghbors, sendng the new results 4. to the neghbors, computng the remanng fnte elements, 4. and recevng the new values from the neghbors. Executon tmes and message delays were defned randomly between gven lmts. These lmts were vared n dfferent smulatons Smulated Clock Errors Fgure 3. A fcttous parallel computaton T (t) :=tcan be chosen because the dfference between T and t does not nfluence the outcome of the algorthms. The dfferent clock errors used n the smulatons are denoted by pctograms. TheyplotC (t) t aganst t. Most types are contnuous clocks wth varyng drft rates. The default maxmum clock error s = s. And one type s a dscrete clock wth the tck length default l = s The Logcal Clock Module The logcal clock module s an mplementaton of the Algorthms, 2 and 3. It needed approxmately szeof(vod) n 2 + n bytes of memory for ts varables and about max(6:2=n :726 ; 2:85n :9 )s executon tme for each event on a R8 processor,.e. between 5 and s for each event f up to processors are producng the events The Analyss Many observables were examned but only a few man results wll be presented here. One advantage of computer smulatons s that observables can be analyzed that are not usually accessble n real experments. In our experments ths s the global tme t and all derved observables as LC T. For the evaluaton the followng observables of the controlled logcal clock are used: F LC the averaged beng fast of LC, S LC the averaged beng slow of LC,andA LC the averaged absolute devaton of LC. A LC s the average over all processes of the sum of jlc T j for all the tme ntervals of two succeedng events and related to the whole executon tme. All these observables were also examned for the smple logcal clock: F LC, S LC,andA LC. Then crtera for the evaluaton were defned as: F LC =F LC should be less than 2,.e. the controller should lmt the beng fast to the double of the beng fast of the smple logcal clock; S LC =S LC should be clearly less than,.e. the controlled logcal clock should clearly mprove any beng slow; A LC s a measurement for the usefulness of the controlled logcal clock for performance measurements. It should be less than 5 % The Results Experments wth 6 and H 6H show that the results are farly ndependent of the duraton all but strctly dependent on the clock error. Experments wth dfferent drft changng profles lke H 6 H, X 6 XX X,and A6show that the results are ndependent of these curves. Therefore the followng experment s representatve of a lot of other experments: One clock from 2 clocks s constantly sfast controlled logcal clock smple logcal clock Av.=47µs σ=263µs Av.=78µs σ=224µs µs µs 5 µs 5 5 µs 5 3 µs 3 7 µs 7 µs Fgure 4. Average of beng fast F LC and F LC 6
7 controlled logcal clock Av.=34 σ= smple logcal clock Av.= σ= Fgure 5. Average of the absolute devaton A LC and A LC Fg. 4 and Fg. 5 represent the absolute results for each process and the averages F and A for both logcal clocks LC and LC. Process No. 8 s fast by s all the tme. Fg. 4 shows that the controlled logcal clock s not really more fast than the smple logcal clock, however the controlled logcal clock s fast n a wder neghborhood of process No. 8. Ths s a good sgn because the controlled logcal clock tres to brng all clocks to the fastest one. Fg. 5 shows that the absolute devaton of the controlled logcal clock s clearly better than that of the smple logcal clock. In the protocol of the experment t can be seen that only n sx processes A LC s greater than 5 % and that the maxmum s 3 % whereas the smple logcal clock has values of 4-82 % n three processes. The crtera defned n the last secton are fulflled by the controlled logcal clock n ths experment. Another type of experment s the usage of clocks that are slow. Here the controlled logcal clock can compensate up to 65 % of the beng slow. The absolute devaton of that process s reduced from A LC = 96. % to A LC = 3,2 % (A LC =.7 %) and the crtcal observables are clearly less than the defned crtera. Experments wth dfferent heght of the clock error show that should be lmted by about the fourfold of the mnmum message delay f local tme dfferences n the area of the tenth of the mnmum message delay should be measured wth an error of less than 5 % n the average over all processes. The varaton of the controller parameters shows that the controller s very stable. In the last experment clocks wth a clock tck of ms are used. In ths case the smple logcal clock already provdes all benefts. The controlled logcal clock does not really mprove the results but also does not make them worse. 7. Usage of the Controlled Logcal Clock The controlled logcal clock s desgned for montorng dstrbuted and parallel applcatons. The controlled logcal clock can be used as a flter. A tracefle wth backward references,.e. wth tmestamps not fulfllng the clock condton, wll be modfed subsequently. Then the clock condton s guaranteed and n general performance measurements are possble wth the new tmestamps. The controlled logcal clock s desgned prmarly to work on events sequentally from the begnnng. If t should be used nsde of a montor tool then there s a problem f the tool allows nteractve repostonng wth subsequent scrollng forward and backward. To solve ths, the Algorthms, 2 and 3 can be started at each poston n a tracefle. For scrollng backward one can use these algorthms but the sgn of the tmestamps must be changed and the role of the send and receve events must be exchanged. There s one dsadvantage: the values of the modfed tmestamps depend on the choce of the start event,.e. the user sees the same event wth (slghtly) dfferent tmestamp values. By assgnng two tmestamps to each event the montor can compensate for ths dsadvantage. The two values are the tme of the system clocks, normally corrected by algorthms fulfllng Def. 3; t can be used for measurements of tme dfferences nsde a process or used to refer to an event; the tme of the controlled logcal clock; t can be used to vsualze the events n spacetme dagrams and to measure tme dfferences between two processes; the values depend on the start event chosen after the last repostonng. It s recommended that an estmate of the mnmum transfer delay s obtaned as a byproduct of the used synchronzaton algorthm. The varance of the message delays has a sgnfcant regon below the most frequent delay values. Our measurements n an Ethernet and an FDDI rng ndcate that n general the mnmum message delay s larger than a quarter of the most frequent round trp tme of an empty remote procedure call. Addtonal applcaton areas are possble because the Alg., 2 and 3 can be ntegrated nto parallel applcatons n the same way as Lamport s logcal clock. For ths, only the already computed tmestamps LC k (e l k ) and LC k (el k ) must be addtonally transferred nsde the messages (e l k ;ej )2 M. In ths way all necessary data requred to compute Alg. and 2 s avalable n each process. The control operaton can also be done locally, n whch case the step ndex s must be substtuted by the event ndex j. 8. Summary The controlled logcal clock s a method of correctng tmestamps of a parallel applcaton. It guarantees that the corrected tmestamps fulfll the clock condton. Also the beng fast of the new tmestamps s bounded and the beng slow s reduced. The new tmestamps are suted for performance measurng and for event vsualzaton n space- 7
8 tme dagrams. Prevously synchronzed clocks wth a maxmum dfference of about two mllseconds are necessary. Usually n workstaton clusters such synchronzaton methods are already nstalled for other purposes. The controlled logcal clock s nsenstve to a drft jtter of a few percent sometmes used for synchronzng the system clocks. In combnaton wth such synchronzaton methods an addtonal synchronzaton before and after the samplng can be dropped. Manly n the case of long executon tmes the controlled logcal clock s better than other methods because these ones assume a lttle varance of the system clocks speed. 9. Future Work Frst tests of the controlled logcal clock n practce as a flter for VAMPIR/PARvs [24] montor tracefles are done. They show that the reducton rule (2) can be weakened. The prncple of the current controller lmts the value of to below, n the practce to.95. For ths reason the controlled logcal clock often falls back to the value of the system clock C. It s planed to allow = or at least = 5 wth a modfed controller. It s planned to modfy the controller to acheve by the controlled logcal clock LC a better approxmaton of the maxmum of all system clocks C. The smulaton has also shown that the clock errors should be lmted to about the fourfold of the message passng delay. Reasons and more precse rules for that lmtaton must be examned. Addtonal questons arse f one wants to use the controlled logcal clock n systems combng message passng wth one-sded communcaton,.e. GET and PUT operatons drectly nto the memory of a remote process. In [23] an ATM adapter s descrbed n whch the PUTs are mplemented manly n hardware. Besdes the problem that normally t s not possble to record a trace event n the remote process, one must study the effects of the dfferent latences of the message passng and of the one-sded communcaton. References [] O. Babaoǧlu and R. Drummond. (Almost) no cost clock synchronzaton. In Proceedngs of 7th Internatonal Symposum on Fault-Tolerant Computng, pages IEEE Computer Socety Press, July 987. [2] F. Crstan and C. Fetzer. Probablstc nternal clock synchronzaton. In Proceedngs. 3th Symposum on Relable Dstrbuted Systems, Dana Pont, CA, USA, Oct , 994, pages IEEE Computer Socety Press, 994. [3] F. Crstan and C. Fetzer. Probablstc nternal clock synchronzaton. Techncal Report CS94-367, Unversty of Calforna, San Dego, May ftp://cs.ucsd.edu/pub/team/nternalprobclocksync.ps.z, ftp://cs.ucsd.edu/pub/cfetzer/cs ps.z. [4] J. E. Cuny, A. A. Hough, and J. Kundu. Logcal tme n vsualzatons produced by parallel programs. In Proceedngs. Vsualzaton 92, Boston, MA, USA, Oct. 9-23, 992, pages IEEE Computer Socety Press, 992. [5] G. v. Djk and A. v. d. Wal. Partal orderng of sychronzaton events for dstrbuted debuggng n tghtly-coupled multprocessor systems. In A. Bode, edtor, Dstrbuted Memory Computng, 2nd European Conference, EDMCC2, Munch, FRG, LNCS 487, pages 9. Sprnger-Verlag, Aprl [6] R. Drummond and O. Babaoǧlu. Low-cost clock synchronzaton. Dstrbuted Computng, 6(4):93 23, July 993. [7] A. Duda, G. Harrus, Y. Haddad, and G. Bernard. Estmatng global tme n dstrbuted systems. In Proceedngs of the 7th Internatonal Conference on Dstrbuted Computng Systems, Berln, September 2-25, 987, pages IEEE Computer Socety Press, 987. [8] T. H. Dungan. Hypercube clock synchronzaton. Techncal Report ORNL TM-744, Oak Rdge Natonal Laboratory, TN, February 99. [9] T. H. Dungan. Hypercube clock synchronzaton. ORNL TM-744 (updated), September [] D. Edwards and P. Kearns. DTVS: a dstrbute trace vsualzaton system. In Proceedngs. Sxth IEEE Symposum on Parallel and Dstrbuted Processng, Dallas, Oct , 994, pages IEEE Computer Socety Press, 994. [] C. J. Fdge. Tmestamps n message-passng systems that preserve partal orderng. In Proceedngs of th Australan Computer Scence Conference, pages 56 66, February 988. [2] C. J. Fdge. Partal orders for parallel debuggng. ACM SIGPLAN Notces, 24():83 94, January 989. [3] D. Haban and W. Wegel. Global events and global breakponts n dstrbuted systems. In Proceedngs of 2st Hawa Internatonal Conference on System Scences, pages 66 75, vol. II, 988. [4] R. Hofmann. Gemensame Zetskala für lokale Eregnsspuren. In B. Walke and O. Spanol, edtors, Messung, Modellerung und Bewertung von Rechen- und Kommunkatonssystemen, 7. GI/ITG-Fachtagung, Aachen, September 993. Sprnger-Verlag, Berln, 993. ftp://fau79.nformatk.un-erlangen.de/pub/doc/mmb93 globtme.ps.z. [5] R. Hofmann. Gescherte Zetbezüge für de Lestungsanalyse n parallelen und vertelten Systemen. Dssertaton, Unverstät Erlangen-Nürnberg, Technsche Fakultät, 993. ftp://fau79.nformatk.un-erlangen.de/pub/doc/mmd26#3.ps.z. [6] J.-M. Jez équel. Buldng a global tme on parallel machnes. In J.-C. Bermond and M. Raynal, edtors, Proceedngs of the 3rd Internatonal Workshop on Dstrbuted Algorthms, LNCS 392, pages Sprnger-Verlag, 989. [7] J.-M. Jez équel. Outls pour l expérmentaton d algorthmes dstrbués sur machnes parallèles. PhD thess, Unversté de Rennes,. Oct [8] L. Lamport. Tme, clocks, and the orderng of events n a dstrbuted system. Communcatons of the ACM, 2(7): , July 978. [9] W. S. Lloyd and P. Kearns. Tracng the executon of dstrbuted programs. Journal of Systems and Software, 2(3):2 24, June 993. [2] E. Mallet and C. Tron. On effcently mplementng global tme for performance evaluaton on multprocessor systems. Journal of Parallel and Dstrbuted Computng, 28:84 93, 995. [2] F. Mattern. Vrtual tme and global states of dstrbuted systems. In M. Cosnard and P. Qunton, edtors, Proceedngs of Internatonal Workshop on Parallel and Dstrbuted Algorthms, Chateau de Bonas, France, October 988, pages Elsever Scence Publshers B. V., Amsterdam, 989. [22] D. L. Mlls. Network tme protocol (verson 3), specfcaton, mplementaton and analyss. RFC 35, Request for Comments, March 992. [23] T. Mummert, C. Kosak, P. Steenkste, and A. Fsher. Fne gran parallel communcaton on general purpose LANs. In Internatonal Conference on Supercomputng, ACM, Phladelpha, May [24] W. E. Nagel and A. Arnold. Performance vsualzaton of parallel programs: The parvs envronment. Techncal report, Forschungszentrum Jülch, [25] R. L. Probert, H. Yu, and K. Saleh. Relatve-clock-based specfcaton and test result analyss of dstrbuted systems. In Eleventh Annual Internatonal Phoenx Conference on Computers and Communcatons, Scottsdale, AZ, USA, Aprl -3, 992, pages IEEE, New York, 992. [26] R. Rabensefner. De geregelte logcal Clock Defnton, Smulaton und Anwendung. Techncal Report RUS-3, Rechenzentrum, Unverstät Stuttgart, Germany, May clock rus3.html. [27] M. Raynal. A dstrbuted algorthm to prevent mutual drft between n logcal clocks. Informaton Processng Letters, 24:99 22, 987. [28] F. B. Schneder. Understandng protocols for byzantne clock synchronzaton. Techncal Report , Department of Computer Scence, Cornell Unversty, August [29] R. Schwarz and F. Mattern. Detectng causal relatonshps n dstrbuted computatons: n search of the holy gral. Dstrbuted Computng, 7(3):49 74, 994. [3] Z. Yang and A. Marsland, T. Annotated bblography on global states and tmes n dstrbuted systems. Operatng Systems Revew, 27(3):55 74, July 993. [3] M. Zak, M. El-Nahas, and H. Allam. DPDP: an nteractve debugger for parallel and dstrbuted processng. Journal of Systems and Software, 22():45 6, July
Luby s Alg. for Maximal Independent Sets using Pairwise Independence
Lecture Notes for Randomzed Algorthms Luby s Alg. for Maxmal Independent Sets usng Parwse Independence Last Updated by Erc Vgoda on February, 006 8. Maxmal Independent Sets For a graph G = (V, E), an ndependent
More informationbenefit is 2, paid if the policyholder dies within the year, and probability of death within the year is ).
REVIEW OF RISK MANAGEMENT CONCEPTS LOSS DISTRIBUTIONS AND INSURANCE Loss and nsurance: When someone s subject to the rsk of ncurrng a fnancal loss, the loss s generally modeled usng a random varable or
More informationDEFINING %COMPLETE IN MICROSOFT PROJECT
CelersSystems DEFINING %COMPLETE IN MICROSOFT PROJECT PREPARED BY James E Aksel, PMP, PMI-SP, MVP For Addtonal Informaton about Earned Value Management Systems and reportng, please contact: CelersSystems,
More informationRecurrence. 1 Definitions and main statements
Recurrence 1 Defntons and man statements Let X n, n = 0, 1, 2,... be a MC wth the state space S = (1, 2,...), transton probabltes p j = P {X n+1 = j X n = }, and the transton matrx P = (p j ),j S def.
More informationProject Networks With Mixed-Time Constraints
Project Networs Wth Mxed-Tme Constrants L Caccetta and B Wattananon Western Australan Centre of Excellence n Industral Optmsaton (WACEIO) Curtn Unversty of Technology GPO Box U1987 Perth Western Australa
More information1. Fundamentals of probability theory 2. Emergence of communication traffic 3. Stochastic & Markovian Processes (SP & MP)
6.3 / -- Communcaton Networks II (Görg) SS20 -- www.comnets.un-bremen.de Communcaton Networks II Contents. Fundamentals of probablty theory 2. Emergence of communcaton traffc 3. Stochastc & Markovan Processes
More informationCausal, Explanatory Forecasting. Analysis. Regression Analysis. Simple Linear Regression. Which is Independent? Forecasting
Causal, Explanatory Forecastng Assumes cause-and-effect relatonshp between system nputs and ts output Forecastng wth Regresson Analyss Rchard S. Barr Inputs System Cause + Effect Relatonshp The job of
More informationThe Development of Web Log Mining Based on Improve-K-Means Clustering Analysis
The Development of Web Log Mnng Based on Improve-K-Means Clusterng Analyss TngZhong Wang * College of Informaton Technology, Luoyang Normal Unversty, Luoyang, 471022, Chna wangtngzhong2@sna.cn Abstract.
More informationModule 2 LOSSLESS IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module LOSSLESS IMAGE COMPRESSION SYSTEMS Lesson 3 Lossless Compresson: Huffman Codng Instructonal Objectves At the end of ths lesson, the students should be able to:. Defne and measure source entropy..
More informationAn Analysis of Central Processor Scheduling in Multiprogrammed Computer Systems
STAN-CS-73-355 I SU-SE-73-013 An Analyss of Central Processor Schedulng n Multprogrammed Computer Systems (Dgest Edton) by Thomas G. Prce October 1972 Techncal Report No. 57 Reproducton n whole or n part
More informationVision Mouse. Saurabh Sarkar a* University of Cincinnati, Cincinnati, USA ABSTRACT 1. INTRODUCTION
Vson Mouse Saurabh Sarkar a* a Unversty of Cncnnat, Cncnnat, USA ABSTRACT The report dscusses a vson based approach towards trackng of eyes and fngers. The report descrbes the process of locatng the possble
More informationWhat is Candidate Sampling
What s Canddate Samplng Say we have a multclass or mult label problem where each tranng example ( x, T ) conssts of a context x a small (mult)set of target classes T out of a large unverse L of possble
More informationA DYNAMIC CRASHING METHOD FOR PROJECT MANAGEMENT USING SIMULATION-BASED OPTIMIZATION. Michael E. Kuhl Radhamés A. Tolentino-Peña
Proceedngs of the 2008 Wnter Smulaton Conference S. J. Mason, R. R. Hll, L. Mönch, O. Rose, T. Jefferson, J. W. Fowler eds. A DYNAMIC CRASHING METHOD FOR PROJECT MANAGEMENT USING SIMULATION-BASED OPTIMIZATION
More informationConferencing protocols and Petri net analysis
Conferencng protocols and Petr net analyss E. ANTONIDAKIS Department of Electroncs, Technologcal Educatonal Insttute of Crete, GREECE ena@chana.tecrete.gr Abstract: Durng a computer conference, users desre
More informationCHOLESTEROL REFERENCE METHOD LABORATORY NETWORK. Sample Stability Protocol
CHOLESTEROL REFERENCE METHOD LABORATORY NETWORK Sample Stablty Protocol Background The Cholesterol Reference Method Laboratory Network (CRMLN) developed certfcaton protocols for total cholesterol, HDL
More informationVoIP Playout Buffer Adjustment using Adaptive Estimation of Network Delays
VoIP Playout Buffer Adjustment usng Adaptve Estmaton of Network Delays Mroslaw Narbutt and Lam Murphy* Department of Computer Scence Unversty College Dubln, Belfeld, Dubln, IRELAND Abstract The poor qualty
More informationConversion between the vector and raster data structures using Fuzzy Geographical Entities
Converson between the vector and raster data structures usng Fuzzy Geographcal Enttes Cdála Fonte Department of Mathematcs Faculty of Scences and Technology Unversty of Combra, Apartado 38, 3 454 Combra,
More informationLoop Parallelization
- - Loop Parallelzaton C-52 Complaton steps: nested loops operatng on arrays, sequentell executon of teraton space DECLARE B[..,..+] FOR I :=.. FOR J :=.. I B[I,J] := B[I-,J]+B[I-,J-] ED FOR ED FOR analyze
More informationFeature selection for intrusion detection. Slobodan Petrović NISlab, Gjøvik University College
Feature selecton for ntruson detecton Slobodan Petrovć NISlab, Gjøvk Unversty College Contents The feature selecton problem Intruson detecton Traffc features relevant for IDS The CFS measure The mrmr measure
More informationFrequency Selective IQ Phase and IQ Amplitude Imbalance Adjustments for OFDM Direct Conversion Transmitters
Frequency Selectve IQ Phase and IQ Ampltude Imbalance Adjustments for OFDM Drect Converson ransmtters Edmund Coersmeer, Ernst Zelnsk Noka, Meesmannstrasse 103, 44807 Bochum, Germany edmund.coersmeer@noka.com,
More informationIMPACT ANALYSIS OF A CELLULAR PHONE
4 th ASA & μeta Internatonal Conference IMPACT AALYSIS OF A CELLULAR PHOE We Lu, 2 Hongy L Bejng FEAonlne Engneerng Co.,Ltd. Bejng, Chna ABSTRACT Drop test smulaton plays an mportant role n nvestgatng
More informationAn Alternative Way to Measure Private Equity Performance
An Alternatve Way to Measure Prvate Equty Performance Peter Todd Parlux Investment Technology LLC Summary Internal Rate of Return (IRR) s probably the most common way to measure the performance of prvate
More informationFault tolerance in cloud technologies presented as a service
Internatonal Scentfc Conference Computer Scence 2015 Pavel Dzhunev, PhD student Fault tolerance n cloud technologes presented as a servce INTRODUCTION Improvements n technques for vrtualzaton and performance
More informationAPPLICATION OF PROBE DATA COLLECTED VIA INFRARED BEACONS TO TRAFFIC MANEGEMENT
APPLICATION OF PROBE DATA COLLECTED VIA INFRARED BEACONS TO TRAFFIC MANEGEMENT Toshhko Oda (1), Kochro Iwaoka (2) (1), (2) Infrastructure Systems Busness Unt, Panasonc System Networks Co., Ltd. Saedo-cho
More informationTHE DISTRIBUTION OF LOAN PORTFOLIO VALUE * Oldrich Alfons Vasicek
HE DISRIBUION OF LOAN PORFOLIO VALUE * Oldrch Alfons Vascek he amount of captal necessary to support a portfolo of debt securtes depends on the probablty dstrbuton of the portfolo loss. Consder a portfolo
More informationRESEARCH ON DUAL-SHAKER SINE VIBRATION CONTROL. Yaoqi FENG 1, Hanping QIU 1. China Academy of Space Technology (CAST) yaoqi.feng@yahoo.
ICSV4 Carns Australa 9- July, 007 RESEARCH ON DUAL-SHAKER SINE VIBRATION CONTROL Yaoq FENG, Hanpng QIU Dynamc Test Laboratory, BISEE Chna Academy of Space Technology (CAST) yaoq.feng@yahoo.com Abstract
More informationAn RFID Distance Bounding Protocol
An RFID Dstance Boundng Protocol Gerhard P. Hancke and Markus G. Kuhn May 22, 2006 An RFID Dstance Boundng Protocol p. 1 Dstance boundng Verfer d Prover Places an upper bound on physcal dstance Does not
More informationBUSINESS PROCESS PERFORMANCE MANAGEMENT USING BAYESIAN BELIEF NETWORK. 0688, dskim@ssu.ac.kr
Proceedngs of the 41st Internatonal Conference on Computers & Industral Engneerng BUSINESS PROCESS PERFORMANCE MANAGEMENT USING BAYESIAN BELIEF NETWORK Yeong-bn Mn 1, Yongwoo Shn 2, Km Jeehong 1, Dongsoo
More informationPAS: A Packet Accounting System to Limit the Effects of DoS & DDoS. Debish Fesehaye & Klara Naherstedt University of Illinois-Urbana Champaign
PAS: A Packet Accountng System to Lmt the Effects of DoS & DDoS Debsh Fesehaye & Klara Naherstedt Unversty of Illnos-Urbana Champagn DoS and DDoS DDoS attacks are ncreasng threats to our dgtal world. Exstng
More informationAn Evaluation of the Extended Logistic, Simple Logistic, and Gompertz Models for Forecasting Short Lifecycle Products and Services
An Evaluaton of the Extended Logstc, Smple Logstc, and Gompertz Models for Forecastng Short Lfecycle Products and Servces Charles V. Trappey a,1, Hsn-yng Wu b a Professor (Management Scence), Natonal Chao
More informationTraffic-light a stress test for life insurance provisions
MEMORANDUM Date 006-09-7 Authors Bengt von Bahr, Göran Ronge Traffc-lght a stress test for lfe nsurance provsons Fnansnspetonen P.O. Box 6750 SE-113 85 Stocholm [Sveavägen 167] Tel +46 8 787 80 00 Fax
More informationIWFMS: An Internal Workflow Management System/Optimizer for Hadoop
IWFMS: An Internal Workflow Management System/Optmzer for Hadoop Lan Lu, Yao Shen Department of Computer Scence and Engneerng Shangha JaoTong Unversty Shangha, Chna lustrve@gmal.com, yshen@cs.sjtu.edu.cn
More informationSPEE Recommended Evaluation Practice #6 Definition of Decline Curve Parameters Background:
SPEE Recommended Evaluaton Practce #6 efnton of eclne Curve Parameters Background: The producton hstores of ol and gas wells can be analyzed to estmate reserves and future ol and gas producton rates and
More informationThe Application of Fractional Brownian Motion in Option Pricing
Vol. 0, No. (05), pp. 73-8 http://dx.do.org/0.457/jmue.05.0..6 The Applcaton of Fractonal Brownan Moton n Opton Prcng Qng-xn Zhou School of Basc Scence,arbn Unversty of Commerce,arbn zhouqngxn98@6.com
More informationNPAR TESTS. One-Sample Chi-Square Test. Cell Specification. Observed Frequencies 1O i 6. Expected Frequencies 1EXP i 6
PAR TESTS If a WEIGHT varable s specfed, t s used to replcate a case as many tmes as ndcated by the weght value rounded to the nearest nteger. If the workspace requrements are exceeded and samplng has
More informationA Novel Methodology of Working Capital Management for Large. Public Constructions by Using Fuzzy S-curve Regression
Novel Methodology of Workng Captal Management for Large Publc Constructons by Usng Fuzzy S-curve Regresson Cheng-Wu Chen, Morrs H. L. Wang and Tng-Ya Hseh Department of Cvl Engneerng, Natonal Central Unversty,
More informationHow To Understand The Results Of The German Meris Cloud And Water Vapour Product
Ttel: Project: Doc. No.: MERIS level 3 cloud and water vapour products MAPP MAPP-ATBD-ClWVL3 Issue: 1 Revson: 0 Date: 9.12.1998 Functon Name Organsaton Sgnature Date Author: Bennartz FUB Preusker FUB Schüller
More informationOn-Line Fault Detection in Wind Turbine Transmission System using Adaptive Filter and Robust Statistical Features
On-Lne Fault Detecton n Wnd Turbne Transmsson System usng Adaptve Flter and Robust Statstcal Features Ruoyu L Remote Dagnostcs Center SKF USA Inc. 3443 N. Sam Houston Pkwy., Houston TX 77086 Emal: ruoyu.l@skf.com
More informationPSYCHOLOGICAL RESEARCH (PYC 304-C) Lecture 12
14 The Ch-squared dstrbuton PSYCHOLOGICAL RESEARCH (PYC 304-C) Lecture 1 If a normal varable X, havng mean µ and varance σ, s standardsed, the new varable Z has a mean 0 and varance 1. When ths standardsed
More informationExtending Probabilistic Dynamic Epistemic Logic
Extendng Probablstc Dynamc Epstemc Logc Joshua Sack May 29, 2008 Probablty Space Defnton A probablty space s a tuple (S, A, µ), where 1 S s a set called the sample space. 2 A P(S) s a σ-algebra: a set
More informationActivity Scheduling for Cost-Time Investment Optimization in Project Management
PROJECT MANAGEMENT 4 th Internatonal Conference on Industral Engneerng and Industral Management XIV Congreso de Ingenería de Organzacón Donosta- San Sebastán, September 8 th -10 th 010 Actvty Schedulng
More informationCan Auto Liability Insurance Purchases Signal Risk Attitude?
Internatonal Journal of Busness and Economcs, 2011, Vol. 10, No. 2, 159-164 Can Auto Lablty Insurance Purchases Sgnal Rsk Atttude? Chu-Shu L Department of Internatonal Busness, Asa Unversty, Tawan Sheng-Chang
More informationA Secure Password-Authenticated Key Agreement Using Smart Cards
A Secure Password-Authentcated Key Agreement Usng Smart Cards Ka Chan 1, Wen-Chung Kuo 2 and Jn-Chou Cheng 3 1 Department of Computer and Informaton Scence, R.O.C. Mltary Academy, Kaohsung 83059, Tawan,
More informationAnalysis of Premium Liabilities for Australian Lines of Business
Summary of Analyss of Premum Labltes for Australan Lnes of Busness Emly Tao Honours Research Paper, The Unversty of Melbourne Emly Tao Acknowledgements I am grateful to the Australan Prudental Regulaton
More informationA Hierarchical Anomaly Network Intrusion Detection System using Neural Network Classification
IDC IDC A Herarchcal Anomaly Network Intruson Detecton System usng Neural Network Classfcaton ZHENG ZHANG, JUN LI, C. N. MANIKOPOULOS, JAY JORGENSON and JOSE UCLES ECE Department, New Jersey Inst. of Tech.,
More information"Research Note" APPLICATION OF CHARGE SIMULATION METHOD TO ELECTRIC FIELD CALCULATION IN THE POWER CABLES *
Iranan Journal of Scence & Technology, Transacton B, Engneerng, ol. 30, No. B6, 789-794 rnted n The Islamc Republc of Iran, 006 Shraz Unversty "Research Note" ALICATION OF CHARGE SIMULATION METHOD TO ELECTRIC
More informationANALYZING THE RELATIONSHIPS BETWEEN QUALITY, TIME, AND COST IN PROJECT MANAGEMENT DECISION MAKING
ANALYZING THE RELATIONSHIPS BETWEEN QUALITY, TIME, AND COST IN PROJECT MANAGEMENT DECISION MAKING Matthew J. Lberatore, Department of Management and Operatons, Vllanova Unversty, Vllanova, PA 19085, 610-519-4390,
More informationRequIn, a tool for fast web traffic inference
RequIn, a tool for fast web traffc nference Olver aul, Jean Etenne Kba GET/INT, LOR Department 9 rue Charles Fourer 90 Evry, France Olver.aul@nt-evry.fr, Jean-Etenne.Kba@nt-evry.fr Abstract As networked
More informationOn the Optimal Control of a Cascade of Hydro-Electric Power Stations
On the Optmal Control of a Cascade of Hydro-Electrc Power Statons M.C.M. Guedes a, A.F. Rbero a, G.V. Smrnov b and S. Vlela c a Department of Mathematcs, School of Scences, Unversty of Porto, Portugal;
More informationForecasting the Direction and Strength of Stock Market Movement
Forecastng the Drecton and Strength of Stock Market Movement Jngwe Chen Mng Chen Nan Ye cjngwe@stanford.edu mchen5@stanford.edu nanye@stanford.edu Abstract - Stock market s one of the most complcated systems
More informationSurvey on Virtual Machine Placement Techniques in Cloud Computing Environment
Survey on Vrtual Machne Placement Technques n Cloud Computng Envronment Rajeev Kumar Gupta and R. K. Paterya Department of Computer Scence & Engneerng, MANIT, Bhopal, Inda ABSTRACT In tradtonal data center
More informationAdaptive Fractal Image Coding in the Frequency Domain
PROCEEDINGS OF INTERNATIONAL WORKSHOP ON IMAGE PROCESSING: THEORY, METHODOLOGY, SYSTEMS AND APPLICATIONS 2-22 JUNE,1994 BUDAPEST,HUNGARY Adaptve Fractal Image Codng n the Frequency Doman K AI UWE BARTHEL
More informationPerformance Analysis of Energy Consumption of Smartphone Running Mobile Hotspot Application
Internatonal Journal of mart Grd and lean Energy Performance Analyss of Energy onsumpton of martphone Runnng Moble Hotspot Applcaton Yun on hung a chool of Electronc Engneerng, oongsl Unversty, 511 angdo-dong,
More informationBERNSTEIN POLYNOMIALS
On-Lne Geometrc Modelng Notes BERNSTEIN POLYNOMIALS Kenneth I. Joy Vsualzaton and Graphcs Research Group Department of Computer Scence Unversty of Calforna, Davs Overvew Polynomals are ncredbly useful
More informationCalculation of Sampling Weights
Perre Foy Statstcs Canada 4 Calculaton of Samplng Weghts 4.1 OVERVIEW The basc sample desgn used n TIMSS Populatons 1 and 2 was a two-stage stratfed cluster desgn. 1 The frst stage conssted of a sample
More informationBrigid Mullany, Ph.D University of North Carolina, Charlotte
Evaluaton And Comparson Of The Dfferent Standards Used To Defne The Postonal Accuracy And Repeatablty Of Numercally Controlled Machnng Center Axes Brgd Mullany, Ph.D Unversty of North Carolna, Charlotte
More informationINVESTIGATION OF VEHICULAR USERS FAIRNESS IN CDMA-HDR NETWORKS
21 22 September 2007, BULGARIA 119 Proceedngs of the Internatonal Conference on Informaton Technologes (InfoTech-2007) 21 st 22 nd September 2007, Bulgara vol. 2 INVESTIGATION OF VEHICULAR USERS FAIRNESS
More information+ + + - - This circuit than can be reduced to a planar circuit
MeshCurrent Method The meshcurrent s analog of the nodeoltage method. We sole for a new set of arables, mesh currents, that automatcally satsfy KCLs. As such, meshcurrent method reduces crcut soluton to
More informationHollinger Canadian Publishing Holdings Co. ( HCPH ) proceeding under the Companies Creditors Arrangement Act ( CCAA )
February 17, 2011 Andrew J. Hatnay ahatnay@kmlaw.ca Dear Sr/Madam: Re: Re: Hollnger Canadan Publshng Holdngs Co. ( HCPH ) proceedng under the Companes Credtors Arrangement Act ( CCAA ) Update on CCAA Proceedngs
More information8 Algorithm for Binary Searching in Trees
8 Algorthm for Bnary Searchng n Trees In ths secton we present our algorthm for bnary searchng n trees. A crucal observaton employed by the algorthm s that ths problem can be effcently solved when the
More informationTraffic State Estimation in the Traffic Management Center of Berlin
Traffc State Estmaton n the Traffc Management Center of Berln Authors: Peter Vortsch, PTV AG, Stumpfstrasse, D-763 Karlsruhe, Germany phone ++49/72/965/35, emal peter.vortsch@ptv.de Peter Möhl, PTV AG,
More informationCharacterization of Assembly. Variation Analysis Methods. A Thesis. Presented to the. Department of Mechanical Engineering. Brigham Young University
Characterzaton of Assembly Varaton Analyss Methods A Thess Presented to the Department of Mechancal Engneerng Brgham Young Unversty In Partal Fulfllment of the Requrements for the Degree Master of Scence
More informationStatistical Methods to Develop Rating Models
Statstcal Methods to Develop Ratng Models [Evelyn Hayden and Danel Porath, Österrechsche Natonalbank and Unversty of Appled Scences at Manz] Source: The Basel II Rsk Parameters Estmaton, Valdaton, and
More informationMinimal Coding Network With Combinatorial Structure For Instantaneous Recovery From Edge Failures
Mnmal Codng Network Wth Combnatoral Structure For Instantaneous Recovery From Edge Falures Ashly Joseph 1, Mr.M.Sadsh Sendl 2, Dr.S.Karthk 3 1 Fnal Year ME CSE Student Department of Computer Scence Engneerng
More informationHow To Calculate The Accountng Perod Of Nequalty
Inequalty and The Accountng Perod Quentn Wodon and Shlomo Ytzha World Ban and Hebrew Unversty September Abstract Income nequalty typcally declnes wth the length of tme taen nto account for measurement.
More informationCalculating the high frequency transmission line parameters of power cables
< ' Calculatng the hgh frequency transmsson lne parameters of power cables Authors: Dr. John Dcknson, Laboratory Servces Manager, N 0 RW E B Communcatons Mr. Peter J. Ncholson, Project Assgnment Manager,
More informationLogical Development Of Vogel s Approximation Method (LD-VAM): An Approach To Find Basic Feasible Solution Of Transportation Problem
INTERNATIONAL JOURNAL OF SCIENTIFIC & TECHNOLOGY RESEARCH VOLUME, ISSUE, FEBRUARY ISSN 77-866 Logcal Development Of Vogel s Approxmaton Method (LD- An Approach To Fnd Basc Feasble Soluton Of Transportaton
More informationPower-of-Two Policies for Single- Warehouse Multi-Retailer Inventory Systems with Order Frequency Discounts
Power-of-wo Polces for Sngle- Warehouse Mult-Retaler Inventory Systems wth Order Frequency Dscounts José A. Ventura Pennsylvana State Unversty (USA) Yale. Herer echnon Israel Insttute of echnology (Israel)
More informationA Probabilistic Theory of Coherence
A Probablstc Theory of Coherence BRANDEN FITELSON. The Coherence Measure C Let E be a set of n propostons E,..., E n. We seek a probablstc measure C(E) of the degree of coherence of E. Intutvely, we want
More informationGeneralizing the degree sequence problem
Mddlebury College March 2009 Arzona State Unversty Dscrete Mathematcs Semnar The degree sequence problem Problem: Gven an nteger sequence d = (d 1,...,d n ) determne f there exsts a graph G wth d as ts
More informationWhen Network Effect Meets Congestion Effect: Leveraging Social Services for Wireless Services
When Network Effect Meets Congeston Effect: Leveragng Socal Servces for Wreless Servces aowen Gong School of Electrcal, Computer and Energy Engeerng Arzona State Unversty Tempe, AZ 8587, USA xgong9@asuedu
More informationA Performance Analysis of View Maintenance Techniques for Data Warehouses
A Performance Analyss of Vew Mantenance Technques for Data Warehouses Xng Wang Dell Computer Corporaton Round Roc, Texas Le Gruenwald The nversty of Olahoma School of Computer Scence orman, OK 739 Guangtao
More informationA Replication-Based and Fault Tolerant Allocation Algorithm for Cloud Computing
A Replcaton-Based and Fault Tolerant Allocaton Algorthm for Cloud Computng Tork Altameem Dept of Computer Scence, RCC, Kng Saud Unversty, PO Box: 28095 11437 Ryadh-Saud Araba Abstract The very large nfrastructure
More informationdenote the location of a node, and suppose node X . This transmission causes a successful reception by node X for any other node
Fnal Report of EE359 Class Proect Throughput and Delay n Wreless Ad Hoc Networs Changhua He changhua@stanford.edu Abstract: Networ throughput and pacet delay are the two most mportant parameters to evaluate
More informationCHAPTER 14 MORE ABOUT REGRESSION
CHAPTER 14 MORE ABOUT REGRESSION We learned n Chapter 5 that often a straght lne descrbes the pattern of a relatonshp between two quanttatve varables. For nstance, n Example 5.1 we explored the relatonshp
More informationJ. Parallel Distrib. Comput.
J. Parallel Dstrb. Comput. 71 (2011) 62 76 Contents lsts avalable at ScenceDrect J. Parallel Dstrb. Comput. journal homepage: www.elsever.com/locate/jpdc Optmzng server placement n dstrbuted systems n
More informationOpen Access A Load Balancing Strategy with Bandwidth Constraint in Cloud Computing. Jing Deng 1,*, Ping Guo 2, Qi Li 3, Haizhu Chen 1
Send Orders for Reprnts to reprnts@benthamscence.ae The Open Cybernetcs & Systemcs Journal, 2014, 8, 115-121 115 Open Access A Load Balancng Strategy wth Bandwdth Constrant n Cloud Computng Jng Deng 1,*,
More informationFORMAL ANALYSIS FOR REAL-TIME SCHEDULING
FORMAL ANALYSIS FOR REAL-TIME SCHEDULING Bruno Dutertre and Vctora Stavrdou, SRI Internatonal, Menlo Park, CA Introducton In modern avoncs archtectures, applcaton software ncreasngly reles on servces provded
More informationQoS-based Scheduling of Workflow Applications on Service Grids
QoS-based Schedulng of Workflow Applcatons on Servce Grds Ja Yu, Rakumar Buyya and Chen Khong Tham Grd Computng and Dstrbuted System Laboratory Dept. of Computer Scence and Software Engneerng The Unversty
More informationRisk Model of Long-Term Production Scheduling in Open Pit Gold Mining
Rsk Model of Long-Term Producton Schedulng n Open Pt Gold Mnng R Halatchev 1 and P Lever 2 ABSTRACT Open pt gold mnng s an mportant sector of the Australan mnng ndustry. It uses large amounts of nvestments,
More informationAn Interest-Oriented Network Evolution Mechanism for Online Communities
An Interest-Orented Network Evoluton Mechansm for Onlne Communtes Cahong Sun and Xaopng Yang School of Informaton, Renmn Unversty of Chna, Bejng 100872, P.R. Chna {chsun,yang}@ruc.edu.cn Abstract. Onlne
More informationHow To Know The Components Of Mean Squared Error Of Herarchcal Estmator S
S C H E D A E I N F O R M A T I C A E VOLUME 0 0 On Mean Squared Error of Herarchcal Estmator Stans law Brodowsk Faculty of Physcs, Astronomy, and Appled Computer Scence, Jagellonan Unversty, Reymonta
More informationDurham Research Online
Durham Research Onlne Deposted n DRO: 9 March 21 Verson of attached le: Accepted Verson Peer-revew status of attached le: Peer-revewed Ctaton for publshed tem: Matthews, P. C. and Coates, G. (27) 'Stochastc
More informationEfficient Striping Techniques for Variable Bit Rate Continuous Media File Servers æ
Effcent Strpng Technques for Varable Bt Rate Contnuous Meda Fle Servers æ Prashant J. Shenoy Harrck M. Vn Department of Computer Scence, Department of Computer Scences, Unversty of Massachusetts at Amherst
More informationChapter 4 ECONOMIC DISPATCH AND UNIT COMMITMENT
Chapter 4 ECOOMIC DISATCH AD UIT COMMITMET ITRODUCTIO A power system has several power plants. Each power plant has several generatng unts. At any pont of tme, the total load n the system s met by the
More informationRisk-based Fatigue Estimate of Deep Water Risers -- Course Project for EM388F: Fracture Mechanics, Spring 2008
Rsk-based Fatgue Estmate of Deep Water Rsers -- Course Project for EM388F: Fracture Mechancs, Sprng 2008 Chen Sh Department of Cvl, Archtectural, and Envronmental Engneerng The Unversty of Texas at Austn
More informationHowHow to Find the Best Online Stock Broker
A GENERAL APPROACH FOR SECURITY MONITORING AND PREVENTIVE CONTROL OF NETWORKS WITH LARGE WIND POWER PRODUCTION Helena Vasconcelos INESC Porto hvasconcelos@nescportopt J N Fdalgo INESC Porto and FEUP jfdalgo@nescportopt
More informationPerformance Analysis and Comparison of QoS Provisioning Mechanisms for CBR Traffic in Noisy IEEE 802.11e WLANs Environments
Tamkang Journal of Scence and Engneerng, Vol. 12, No. 2, pp. 143149 (2008) 143 Performance Analyss and Comparson of QoS Provsonng Mechansms for CBR Traffc n Nosy IEEE 802.11e WLANs Envronments Der-Junn
More informationRELIABILITY, RISK AND AVAILABILITY ANLYSIS OF A CONTAINER GANTRY CRANE ABSTRACT
Kolowrock Krzysztof Joanna oszynska MODELLING ENVIRONMENT AND INFRATRUCTURE INFLUENCE ON RELIABILITY AND OPERATION RT&A # () (Vol.) March RELIABILITY RIK AND AVAILABILITY ANLYI OF A CONTAINER GANTRY CRANE
More informationData Broadcast on a Multi-System Heterogeneous Overlayed Wireless Network *
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 24, 819-840 (2008) Data Broadcast on a Mult-System Heterogeneous Overlayed Wreless Network * Department of Computer Scence Natonal Chao Tung Unversty Hsnchu,
More informationApplication of Multi-Agents for Fault Detection and Reconfiguration of Power Distribution Systems
1 Applcaton of Mult-Agents for Fault Detecton and Reconfguraton of Power Dstrbuton Systems K. Nareshkumar, Member, IEEE, M. A. Choudhry, Senor Member, IEEE, J. La, A. Felach, Senor Member, IEEE Abstract--The
More informationRobust Design of Public Storage Warehouses. Yeming (Yale) Gong EMLYON Business School
Robust Desgn of Publc Storage Warehouses Yemng (Yale) Gong EMLYON Busness School Rene de Koster Rotterdam school of management, Erasmus Unversty Abstract We apply robust optmzaton and revenue management
More informationDynamic Pricing for Smart Grid with Reinforcement Learning
Dynamc Prcng for Smart Grd wth Renforcement Learnng Byung-Gook Km, Yu Zhang, Mhaela van der Schaar, and Jang-Won Lee Samsung Electroncs, Suwon, Korea Department of Electrcal Engneerng, UCLA, Los Angeles,
More informationQuantization Effects in Digital Filters
Quantzaton Effects n Dgtal Flters Dstrbuton of Truncaton Errors In two's complement representaton an exact number would have nfntely many bts (n general). When we lmt the number of bts to some fnte value
More informationStochastic Protocol Modeling for Anomaly Based Network Intrusion Detection
Stochastc Protocol Modelng for Anomaly Based Network Intruson Detecton Juan M. Estevez-Tapador, Pedro Garca-Teodoro, and Jesus E. Daz-Verdejo Department of Electroncs and Computer Technology Unversty of
More informationVRT012 User s guide V0.1. Address: Žirmūnų g. 27, Vilnius LT-09105, Phone: (370-5) 2127472, Fax: (370-5) 276 1380, Email: info@teltonika.
VRT012 User s gude V0.1 Thank you for purchasng our product. We hope ths user-frendly devce wll be helpful n realsng your deas and brngng comfort to your lfe. Please take few mnutes to read ths manual
More informationSingle and multiple stage classifiers implementing logistic discrimination
Sngle and multple stage classfers mplementng logstc dscrmnaton Hélo Radke Bttencourt 1 Dens Alter de Olvera Moraes 2 Vctor Haertel 2 1 Pontfíca Unversdade Católca do Ro Grande do Sul - PUCRS Av. Ipranga,
More informationReal-Time Process Scheduling
Real-Tme Process Schedulng ktw@cse.ntu.edu.tw (Real-Tme and Embedded Systems Laboratory) Independent Process Schedulng Processes share nothng but CPU Papers for dscussons: C.L. Lu and James. W. Layland,
More information: ;,i! i.i.i; " '^! THE LOGIC THEORY MACHINE; EMPIRICAL EXPLORATIONS WITH A CASE STUDY IN HEURISTICS
! EMPRCAL EXPLORATONS WTH THE LOGC THEORY MACHNE; A CASE STUDY N HEURSTCS. :, by Allen Newell, J. C. Shaw, & H. A. Smon Ths s a case study n problem-solvng, representng part of a program of research on
More informationHow To Solve An Onlne Control Polcy On A Vrtualzed Data Center
Dynamc Resource Allocaton and Power Management n Vrtualzed Data Centers Rahul Urgaonkar, Ulas C. Kozat, Ken Igarash, Mchael J. Neely urgaonka@usc.edu, {kozat, garash}@docomolabs-usa.com, mjneely@usc.edu
More information