Performance Prediction of Distributed Load Balancing on Multicomputer Systems
|
|
- Eustace Clarke
- 8 years ago
- Views:
Transcription
1 Performnce Prediction of Distributed Lod Blncing on Multicomputer Systems Ishfq Ahmd *, Arif Ghfoor+, nd Kishn Mehrotr * * School of Computer nd Informtion Science, Syrcuse University, Syrcuse, NY school of Electricl Engineering, Purdue University, West Lfyette, IN 4797 Abstrct Thispperpresents performnce evlution pproch to compre different distributed lod blncing schemes on unified bsis. This pproch is n integrtion of simultion, sttisticl nd nlyticl models, nd tkes into ccount thefundmentl system prmeters tht cn possibly ffect the pe~ormnce. We show tht ll the sender+ nitited distributed lod blncing strtegies cn be modeled by centrl server open queuing network. Furthermore, these lod blncing strtegies cn be chrcterized by only two queuing prmeters the verge execution queue length nd the probbility (ht newly rrived tsk is executed loclly or m grted to nother node. To cpture the reltwn between these queuingprmeters nd vrious system prmeters, sttisticl nlysis hs been crried out on the empiricl dt obtined through simultion. The nlyticl queuing model is then used topredict the response time of system with ny combintion of systemprmeters. Experimentl results re obtm nedfor six dl~erent lod blncing strtegies. The proposed model provides pe~ormnce results in strightforwrd mnner nd cn be beneficil to the system designers in ssessing the system under vrying conditions. L Introduction Efficient utiliztion of multicomputer system lies in its bility to efficiently prtition nd blnce the computtionl lod mong its computing nodes. With the incresing populrity of multicomputer systems, reserchers nd system designers hve been focusing on these essentil issues. If the decisions to llocte worklod tsks to processing nodes re fixed nd re tken before ctully running the problem, then lod blncing is considered sttic. For dynmic lod blncing, there me no fixed lloction decisions nd lod is blnced depending upon the time dependent stte of the system. Dynmic lod blncing hs lso been termed s dynmic lod shring [3], or lod distribution [8]. As noted in [3], ny simple dynmic lod blncing lgorithm improves the performnce of the system, nd is better thn no lod blncing. Dynmic lod blncing strtegies re chrcterized by the mnner in which informtion exchnge nd control of worklod lloction tkes plce. The control cn be centrlized [14], fully distributed [2], [3], [4], [9], [12], [15], [22] or semi distributed [1]. With fully distribtttedcontrol, the lod blncing strtegy is incorported t every node of the system in tht ech node in rhe system mkes utonomous decisions. A node decides whether the tsk submitted to it should be executed loclly or trnsported to some other node. If the tsk should be migrted, the locl node needs to know the lod sttus of other nodes. Anode for tsk migrtion cn be selected rndomly [31, [61, [221 or with some other criteri [3]. However, the ccurcy of scheduling decisions in decentrlized lgorithms, depends on the ccurcy nd mount of stte informtion [8]. Wng nd Morris [23] proposed number of reltively simple lod blncing lgorithms nd clssified them into two ctegories: source-initited nd server-initited. In source initited lgorithm, tsks enter the distributed system vi source nodes nd reprocessed by server nodes. Fox et L [5] presented lod blncing scheme by mking use of the nlogy of lod blncing to minimizing n pproprite energy function. In[15] nd [2], vrious bidding lgorithms hve been proposed, which belong to the sender-initited clss. A drfting lgorithm belongs to the server-initited clss [13]. A comprison of these two types of lgorithms [16] revels tht in spite of the fct tht the bidding lgorithm suffers tlom tsk-dumping or tsk thrshing, it performs consistently better thn the drfting lgorithm. Tsk-thrshing is phenomenon ssocited with lod blncing where lightly loded node cn become victim of tsk rrivls from other nodes [6], [12]. Lod blncing lgorithms cn lso suffer from stte woggling nother performnce decying phenomenon in which processors frequently chnge their sttus between low nd high [16]. For systems with certin interconnection topologies, distributed lod blncing schemes bsed on tsk migrtion mong nerest neighbors hve gined considerble ttention. In number of independent studies [6], [8], [1], [17], vrints of this strtegy hve been proposed nd their effectiveness hs been proven both by simultion nd implementtion observtions. KE [ 17] hs compred one version of this strtegy, known s Contcting Within Neighborhood (CWN), to the Grdient Model [11] nd hs shown tht CWN spreds the lod more quickly nd performs better. In two more studies [6], [17], the concept of lod verging mong neighbors is introduced. The dvntge of lod verging is tht ech node tries to keep its own lod equl to the verge lod mong its nettrest neighbors. Shu nd K16 [19] hve proposed nd implemented revised version of CWN known s Adptive Contrcting Within Neighborhood (ACWN), which consistently shows better response time compred to the Grdient model nd Rndom strtegy. Grunwld et l. [8] hve proposed clssifiction 1991 ACM /91/83 $1.5 83
2 for the type of informtion required to mke lod blncing decisions. Given the diversity of number of proposed strtegies nd their dependence on number of prmeters, it is difflcult to compre their effectiveness on unified bsis. One prticulr strtegy my perform well under certin combintion of prmeters, such s, system lod or system communiction rte on certin topology. The sme strtegy my be outperformed by nother strtegy due to difference in informtion collection nd scheduling overhed. In ddition, simplified ssumptions nd neglecting importnt prmeters sometimes obscures the reltive merits nd demerits of ech strtegy. This pper presents n pproch to predict nd compre the performnce of different lod blncing schemes bsed on unified bsis. Our pproch, which is n integrtion of simultion, sttistics nd nlyticl models, tkes into ccount vrious system prmeters, such s system lod, tsk migrtion time, scheduling overhed nd system topology etc., tht cn ffect the performnce. We show tht lod blncing strtegies, belonging to the sender-inititedclss, cn bemodeledbycentrl serverqueuing network. We lso show tht these strtegies cn be chrcterized by only two prmeters the verge queue length nd the probbility tht tsk is executed loclly or migrted to nother node. Through n extensive simultion, lrge number of vlues of the verge queue length nd theprobbility ssocited with tsk migrtion hve been obtined. A sttisticl nlysis hs been performed on these dt points to cpture the reltion between the queuing prmeters nd the system prmeters. The nlyticl queuing model is then used to predict the response time of system with ny set of prmeters. Six different lod blncing lgorithms hve been studied nd chrcterized. This performnce prediction pproch hs mny dvntges. First, insted of ssessing prticulr strtegy on the bsis of selected set of experiments, ny combintion of prmeters cn be used to predict the performnce. Second, ll strtegies cn be reltively compred by selecting more pproprite nd relistic prmetem. Finlly, n existing system cn be tuned, nd system design cn be evluted before it is ctully buik Theresponsetime predictedbythe model is compred with the response time produced by simultion for ll six strtegies. 2. Selected Lod Blncing Strtegies We consider fully homogeneous mukicomputer system in which processing nodes re connected with ech other through symmetric topology, tht is, ech-node is linked to the sme number of nodes. The number of links per node, clled the degree of the network, is considered s one of the system prmeters nd is denoted sl. The worklod submitted to the system is ssumed to be in the form of tsks, which re submitted to ech node with n verge rrivl rte of tsks per time-unit per node, f%e tsk rrivl process is ssumed to be Poisson. The lod blncing control is fully distributed for which ech node mkes n utonomous decision to schedule tsk by collecting the lod sttus informtion from its neighbom. A tsk is either scheduled to locl execution queue or it is migrted to one of the neighbors connected with ech communiction chnnel. The informtion nd scheduling tkes certin mount of time, which is ssumed to be exponentilly distributed with n verge of l/as time-units. Informtion is collected by hrdwre@ftwre component t ech node nd is clled CollcdorlScheduler. Since informtion interchnge nd execution of the scheduling lgorithm tkes certin mount of time, the tsks rriving during tht time wit in witing queue. For ech communiction link, communiction queue is mintined. The underlying network supports point-to-point communiction nd the communiction chnnel is modeled by server. A communiction server trnsfers tsk from one node to nother with n verge of 1/% time-units. The tsk communiction time is lso ssumed to be exponentilly distributed. Ech communiction queue is served on the FCFS bsis. At ech node, the incoming trftlc from other nodes joins the loclly generted trffic, nd both re hndled with equl priority. Ech node mintins n exeeution queue in which loclly scheduled tsks re served by CPU on the FCFS bsis. A tsk my migrte from node to node in the network before finlly being executed t some node. The execution time is lso ssumed to be exponentilly distributed with n verge of l/pe time-units. We hve nlyzed six different sender-initited lod blncing strtegies for vrying informtion collection mechnisms nd scheduling disciplines. Bsed on the informtion interchnge mechnism, these strtegies cn be further clssified into two ctegories. In the fwst ctegory, the informtion bout the lod nd the sttus of other nodes is collected t the time tsk is scheduled for execution or migrtion. The lod is expressed in terms of the length of the execution queue. This lod metric hs been widely ccepted nd experimentl results hve shown tht it ccurtely reflects the CPU lod [16]. In the second ctegory, nodes exchnge the lod informtion mong their neighbors perioditlly. Within ech ctegory, we hve considered three different scheduling policies. Ctego rv. I: Informtion Exchnpe t the Time of Tsk Schedule 9 FRndom: In this strtegy, the tsk scheduler clcultes the verge of the locl lod nd the lod of ll neighbors, If the locl lod is greter thn the verge, the tsk is sent to rndomly selected neighbor. If the locl execution queue is empty (or locl lod is less thn the verge), then the tsk is sent to the locl execution queue. FMin: In this strtegy, the tsk scheduler sends new tsk to the node tht hs the minimum lod. However, if the locl node s lod is equl to the minimum lod mong neighbors, the locl node is given priority. FAverge: In this strtegy, the tsk scheduler clcultes the verge 831
3 of ll neighbors lod nd its own lod. If the locl lod is greter thn the verge, the tsk is sent to the neighbor with the minimum lod. However, if the locl execution queue is empty or the locl lod is less thn the verge, the tsk is sent to the locl execution queue. II: Periodic Informt ion Exchntz prndom: This strtegy is similr to FRndom except tht every node sends it own lod informtion to ll its neighbors periodiclly. The time period, T. for sending messges is system prmeter.. PMin: This strtegy is similr to FMin except tht informtion exchnge is done periodiclly.. PAverge: This strtegy is similr to FAverge except tht informtion exchnge is done periodiclly. 3. The Performnce Prediction Model In this section, we describe the performnce prediction model for the distributed lod blncing strtegies described bove. I%is model isnintegrtion of simultion, nd sttisticl nd queuing models. First, we describe the queuing model nd show tht the clss of distributed lod blncing strtegies described bove cn be modeled by n open centrl server queuing model The Queuing Model As described bove, the multicotnputer system consideredhere is symmetric nd homogeneous. By symmetry, we men tht the interconnection network of the system is regulr grph with fixed number of links per node. By homogeneity we imply tht the processors of the system hve identicl processing speeds. Similrly, ll communiction chnnels nd tsk schedulers re identicl. The stedy-stte tsk deprture nd rrivl rtes t every node re the sme. As explined erlier, tskkeeps on migrting until it finds suitble node. When tsk migrtes from one node to nother, it sees sttisticlly identicl node. Therefore, the stedy-sttekhvior of nerest neighbor lod blncing cn be pproximted by the open centrl server queuing model s shown in Figure 1. The model consists of witing queue,l communiction queues nd n execution queue. This model is pproximte, since routing of tsks is dependent on the stte of execution queues. However, s described in the next section, simultion results obtined on ctul network topologiesre very close to thenlyticlresults determined from this model, which vlidte tht theproposedmodelof Figure 1 indeed represents the tsk scheduling nd migrtion process. The durtion oftsk sresidence time in thesystemconsists of two phses. In the first phse, the tsk my keep on migrting during the course of which it wits in the witing queue, gets service from the scheduler, wits in the communiction queue, nd then trnsfers to nother node. At tht point the sme cycle my strt ll over gin. Once the tsk is scheduled t the execution queue of node, the second phse strts, which includes the queuing nd service time t the CPU. In the fiist phse, the tsk cn be viewed s occupying either the tsk scheduler or one of the communiction links. The Mrkov chin shown in Figure 2 describes the behvior of the centrl server which in turn explins the tsk migrtion phenomenon before the tsk enters the execution queue. The stte of the Mrkov chin is described by (L. +1) tuple, h, kl,.. kl in which ki represents the number of tsks t the i-th queue ( O s i s L) t node. It follows [21] tht the model crt be solved by the Jcksonin network, which hs the product form solution; tht is, the joint probbility of kj tskst queuej (j =,1,..., L) is given by the product: Wok,,,k,...kL) = ~ Pl{kj) where ~j(kj) is the probbility of kj tsks tj-th queue nd is given by: ~j{kj) H (1 Qj) e? L j=o AA Witing Queue Scheduler Informtion Co ector ~ 111% Ps Communiction Queue I Migrted Plj ia Execution Queue Loclly submitted tsks 1- with rte2 Communiction P; Queue tsks Sink Figure 1: Distributed lod blncing represented by open centrl server model. 832
4 & Figure 2: Mrkov chin with the stte of the chin describing the number of tsks t ech queue of node. For thej-th component, the verge utiliztion, Q], is equl to ~j/pj. The eqution implies tht the lengths of ll queues re mutully independent in stedy stte. The bove model cn lso be solved while considering the probbilistic behvior of tsk, Suppose, fter the tsk is served by the scheduler, it goes to the i th link with probbility Pi or it enters the locl execution queue with the probbility P.. When tsk leves (enters) the witing queue, thenumberof tsks in tht queue is decresed (incresed) by one. Similrly, when tsk is served by the communiction, sttisticlly identicl tsk joins the witing queue. The verge queue length nd verge response time for the j th component is given by: respectively. The ~verge number of tsks t n&l e is the sum of the verge number of tsks t ech component node nd is given by. ~j of from which thewverge res~nse time before the tsk is scheduled in the execution queue cn be computed s [2 1]: = 1 / (p#o) I Pj / (p@j) 1- ~ / (f r#o) + ~, 1 - Pj O) Once tsk is scheduled t locl execution queue, the response time from the time it is scheduled to the time it finishes execution is given by: where EINEI is the verge execution queue length. The complete response time, therefore, is given by E[R] = E[R~] + E[RJ, Theboveeqution implies tht, forgivensystem lod, w nd Pj s, the response time yielded by lod blncing strtegy cn be clculted if the probbility, P., nd the vergeexecution queue length, HNEI is determined. h other words, P., is the probbility with which lod blncing strtegy schedules the tsks loclly. The probbility tht tsk will be migrted to nother node is simply 1 P. nd migrtion probbilities to individul chnnels t ech node re identicl. The verge execution queue length, E[NK], determines how smoothly the lod is blnced. Both prmeters, Po nd E[N~], depend on system prmeters, such s 1, p,, Ac, p,, T. ~dl In the next sections, we briefly describe the simultion methodology tht is used to obtin very lrge dt set from different test cses. We describe how we performed sttisticl nlysis on the simultion dt nd determined the sensitivity of POnd E[Nd ginst different system prmeters The Simultion Model The bove mentioned lod blncing strtegies were simulted on n Encore Multimx. The simultor ccepts the topology of the network long with 2, ps, PC, & Iengthof simultion run, ndchoiceof lodblncing strtegies nd their ssocited prmeters. The results produced by the simultor include verge response time, utiliztion of individul nodes, verge time spent in communiction, verge number of messges, throughput, verge number of migrtions mde by tsk nd their distribution, verge lengths of witing, communiction nd execution queues. In ddition to verge vlues, the vrince nd ech node s individul sttistics re lso produced The probbility, P., is then clculted by dividing the verge number of loctly 833
5 scheduled tsks by the totl number of tsks rrived, t ech node. The importnt spects of discrete-event simultion re tht it should be run for sufficiently long time nd initil trnsients should be removed before strting the ccumultion of sttistics. Moreover, the confidence intervl must be clculted fter rttming the sme experiment with multiple independent strems. All of these fetures hve been incorported in the simtdtorndllr esults re obtined with 99 % confidence intervl. Along series of simultion runs ws conducted to obtin totl of 5 dt vlues for POnd E[NE] were obtined, for ech strtegy. Three different topologies were selected, which included the ring, the hypercube nd the folded hypercttbe [7], ech consisting of 16 nodes. Ech point for one prticulr strtegy ws obtittedon ech of the topologies by fining one prmeter nd vrying the rest. In most cses, 1 ws vried from to.9 tsks per time-unit, PS ws vried from 8 to 16 tsks per time-unit nd PC ws vried Tble I: Estimtion for PO nd its sensitivity versus system prmeters. S&tegy FRndoon FMin FAverge PPndom PMin PAverge R-Squre System Prmeter ;inh Pc y Liti k -!&_ L Links Pc TV Linb Pc y Tu L& k y Tu Links Pc y Z!oefficlent Estimte t Note All estimtes of model prmeters re sttisticlly significn~ except slightly significnt ), nd not significnt (f). from 8 to 16 tsk per time-unit. The tsk execution rte, p~, ws fixed s 1 tsk per time-unit in ll cses. For strtegies tht required periodic informtion updte, the updte time, TM., period ws vried from.5 time-units to 1.5 timeumts. It is worth mentioning tht the simultor tkes into ccount the time to schedule tsk, which includes the exchnge of stte informtion nd the execution of the scheduling lgorithm itself. Most previous studies hve ignored this overhed. We hve ssumed n verge scheduling time, 1/,S, which in turn, cn be normlized with respect to the execution time, p,. In other words, when ~~ is 1tsks/ timeunit nd g~ is 1 tsk/time-unit, the verge tsk scheduling time is 1I1O of the execution time. We consider it n input prmeter which cn be observed from rel system depending upon how the informtion messge hndling nd regulr tsk migrtion is implemented Sttisticl Anlysis To chrcterize PO nd E[NJ in terms of system prmeters, such s ~, ~~, PC, TM nd system network topology, sttisticl nlyses hve keen performed. As described txwe, dt on PO ws collected for vrious vlues of the system prmeters for ech lod blncing strtegy. A regression nlysis ws then performed to obtin model tht expresses PO in terms of the system prmeters. It is observed tht the model shown in Eqution 1 works quite well for ll six strtegies. The estimtes of P nd coefflcients,~ s, re given in Tble I long with mesures tht describe how well the bove model predicts the observed P.. For instnce, in cse of FRndom, the R-Squre vlue is.9277, which implies tht the regression model is ble to compute YO of vrition observed vlues of P.. A similr regression nlysis pproch is tken to chrcterize E[N~] in terms of system prmeters. In this cse, the observed model is given by Eqution 2. This model fits extremely well, sis observedfiom its R Squzue vlues (ll R Squxe vlues re 99 %) given in Tble II. In cse of E[N~], the coefficients for A rtdpc were found insignificnt nd hence re ignored The Complete Model The complete model for performnce prediction is shown in Flgttre 3. The performnce mesure is the verge tsk response time. As described bove, the model building consisted of running lrge number of simultions, then pplying sttisticl nlysis to obtin models for PO nd EIIVE]. Using this model, thevhtes of PO nd E[N~] cn be directly computed for ny of the six lod blncing strtegies with ny combintion of system lod, communiction rte, tsk scheduling rte, lod updte period (for lod blncing strtegies belonging to ctegory II) nd network topology. We then compute the verge response time by USing the formul given in section 3.1. As explined erlier, this response time consists of hvo prts. The first prt is the verge response time before 834
6 %+IiW=$ + I&UC + I@ + #V + AT. I Po=[l+e- ( ) 1 Eqution E[N~] = exp (q +~,$inks + /%#c + J%pS + 1%# + I%J. ) Eqution (II) (I) Tble II: Estimtion for E[N~] nd its sensitivity versus system prmeters. Strtegy R-Squre Prmeter I I I Prmeter Estimte RmdOOml 31 I AS I MY FMin FAverge PRndom PMin PAverge A Links ps Tu Links A ;.116 Links A : -.95 Link -.52 tsk is scheduledin n execution queue. This is simply equl to the time the tsk is scheduled (in the execution queue of node) minus the tsk rrivl time. This response time, clled trnsient time, is completely described by Po, which indictes the tsk migrtion tendency of bd blncing strtegy. The second prt of verge response time shows how much time (queuing dely plus execution time) tsk tkes fter eventully being scheduled. This time is equl to the time the tsk finishes execution minus the time the tsk ws scheduled in the execution queue. The best trnsient response time results when strtegy s P. is neither very high nor very low. In other words, the strtegy should not hve tsk thrshing tendency nd yet it should mke tsk migrtions whenever pproprite. The second prt of the response time depends on strtegy s lod equliztion bility; tht is, smller verge execution queue length will result if the lod is eqully blnced. Both fctors, however, re dependent on ech other. For exmple, if strtegy suffers from tsk thrshing, execution queue length is not blnced nd the verge vlue of queue length increses. As n exrnple,figure4 shows the plot of POversus system lod for ll six strtegies, on 16-node hypercube. We notice tht t low lod both FMin nd PMin hve high vlues of PO, which shrply increse t high lod. This implies tht both Min strtegies schedule more tsks loclly (nd hence, mke less migrtions) but trnsfer more tsks t high lod. In contrs~ both rndom strtegies hve low vlues of P., which implies tht greter tsk migrtion tkes plce using rndom lgorithms. Figure 5 shows the vritions in E[NE] versus system lod for ll six strtegies. From this figure, we observe tht, in this cse, the vlue of E[N~] is the minimum with FAverge followed by PAverge, nd Ph4in results in the lrgest verge queue length. 4. Performnce Prediction, Evlution nd Comprison After obtining response time dt from the performnce prediction model, we compre it with the observed simultion results. Six lod blncing strtegies long with vrying vlues of A, #S, PC, T. nd different network topologies provide wide rnge of figures to mke comprison between the response time obtined with the model nd the response time obtined with simultion. However, we compre the two figures by vrying one prmeter while keeping the rest constnt. Theresuks re quite encourging, nd the difference between the two figures is found to be less thn ~ 7%. Since ll results cnnot be provided within this pper, we present only those results with noticebleimpct of ech prmeter on response time produced by the model, s well s by the simultion. First, we exmine the impct of system lod on the verge response time for ll six strtegies, shown in Figure 6 nd Figure 7. In both figures, we hve plotted the pirs of verge response time computed from the model nd the venge response time observed horn simultion. The difference in model nd simultion results is lso indicted on these figures. The tsk scheduling rte, ps, nd the tsk communiction rte p= re both 16 tsks/tim&unit. System topology is 16-node hypercube network nd lod updte period, T., is.5 time-units. In Figure 6, system lod Q is.5 (with A =.5 nd pe = 1). Figure 7 differs from Figure 6 in tht the system lod is incresed from.5 to.8. From these figures, we observe the following The difference in the response time computed from the model nd the response time observed from simultion is very smll. For most of the cses, this difference is less thn 1%. The worst cse difference is 6.52%. At low loding conditions, FAverge performs well, wheres PRndom performs the worst of ll. The difference in the performnce of FRndom nd PRndom is not significnt, implying tht for rndom lgorithms, informtion exchnge cn be done either instntneously w periodiclly with T. =.5. me difference in the performnce of FiWin nd PiWin is not significnt. Agin, this implies tht informtion updte cn be done by selecting either of the two principles. 835
7 ssimultion simultion Dt E Amdytict ~ Queuing Model )- ~ Model Building Prmeters Selection * Figure 3: The complete Performnce Prediction Model. E[NE] I I ~ Figure 4: Vritions in ProbbilityPO versus system lod for vrious lod blncing strtegies ~ Figure 5: Vritions in E[NE] length versus system lod for vrious lod blncing strtegies. This indictes tht with TM =.5, periodic updte strtegies perform s well s fresh informtion updte strtegies. In order to check the vlidity of the proposed model for vrious prmeters, we chnge PS nd PC but keep the rest f~ed. These results re shown in Figures 8 nd 9. A high system lod, eqol to.8, is selected by first considering fst communiction network nd slow tsk scheduling rte (PC = 16 ~ks/timeunits d PS = 8 tshhw-unk), nd then considering slow network nd fst tsk sehedulingrte with (PC =8 tsks/time-units nd ps = 16tsks/time-units). Agin, the model is shown to predict the verge response time, which closely mtches the response time produced by simultion, Further insights drwn from these figures re summrized below.. We note tht tsk scheduling time hs greter impct on the verge tsk response time thn the tsk communic- tion time. This is obvious becuse the verge response time with slow sehedulingrte nd high communiction rte (Figure 8) is greter thn the response time with fst scheduling rte nd slow communiction rte (Figure 9). The observtion is true for ll strtegies. Next, we show two rbitrrily chosen sets of system prmeters. In the fwst set, 16-node folded hyperculx with 5 links per node t reltively low system lod (.6) is selected. Thetskcommuniction rte ndthetsk scheduling rte re both 12 tsks/time-unit nd T= is equl to 1.5 timeunit, which is reltively lrge. The results for this combintion of prmeters re shown in Figure 1 nd re summrized below. The difference in the response time for the model nd simultion is gin very smtl. The periodic updte strtegies, PMin nd PAverge, re outperformed by FMin nd FAverge becuse of the lrger vlue of Tw. 836
8 Comprison of response times predicted by the model nd simultion for vrious strtegies with vrious system prmeters on 16-node hypercube topology. I Legend Model:= Simultion: Dl I Time-units l e ~ 2.1!!! 1 8 % 1.5 S? $J 1.2 $.9.6 FRhdom Fhin FAv&ge PRhdom Phin PAve)ge FRndom FMin FAverge PRndom PMin PAverge Figure 62 =.5, PC = 16 tsk/time-uni~ Figure 7:1 =.8, #c = 16 tsk/time-unit, ps = 16 tsk/time-unig T= =.5 tim~units. A = 16 tsk/time-unit, Tu =.5 time-units. t3me-units Tree-units ] gy%) I (2.38%) (1.8%) (1.32%) FR&dom Fhin FAv;rge PR&dom Phin PAve;ge FRn om FMin FAverge PRndom PMin PAverge Figure 8: A =,8, PC = 16 tskk.ime-unit, Figure 9: A =.8, PC = 8 tsk/time-unit, /% = 8 tsldtime-unit, T,= 1. time-units. ps = 16 tsk/time-unit, T = 1. time-units. On the other hnd, FRndom nd PRndom yield identicl results by showing their insensitivity to the lod up dte method. In the second set, we hve selected 16-node ring network with medium system lod equl to,7. Agin, theresponse times predicted by the model mtch those produced by the simultion, s shown in Figure 11. Up to this point, the performnce of the model is compred with the sme simultion test cses through which empiricl dt for sttisticl modeling ws obtined. After chrcterizing PO nd E[NE], the queuing model ws used to compute the verge response time nd the results were compred with the sme simultion results. Therefore, the comprison of the model with simultion hs only reveled the correctness of the model. The vlidity of the proposed model is more strongly estblished s we obtin response time horn the model nd compre it with some dditionl 837
9 Comprison of response times predicted by the model nd simultion for vrious strtegies with vrious system prmeters on different network topologies. Legend: Model:- Time-units FRndom Ffiin FAverge PRklom PMin PAve>ge Figure 1 ~ =.6, PC = 12 tsk/time+nit, IZS = 12 tsk/time-unit, T. = 1.5 time-units. Topology = 16-node Folded Hypercube. Time-units I 1 FRndom Fkin FAv&ge PR&dom Phin PAv;rge Figure 11:2 =.7, PC =12 tsk/time-uni~ A = 12 tsk/time-unit, T. = 1. time-units. Topology = 16-node Ring.. Time-units FR&dom FMin FAv;rge PR&dom PMin PAve>ge Figure 121 =.7, AC = 16 tsk/time-unit, % = 16 tsk/time-unit, T. = 1. time-units. Topology = 9 node Mesh. FRtdom FMin FAverge PRndom PMin PAverge Figure 13:1 =.7, PC = 16 tsk/time-unit, AS = 16 tsk/time-unit, T. = 1. tim+units. Topology = 8 node Fully Conected. simultion runs. The empiricl dt from these simultion. P.4verge performs s well sfaverge, if TM is St_fIdl. runs hs not been used for sttisticl modeling. The ddi- All nerest neighbor lod blncing strtegies perform tionl simultion runs include different network topologies better if the number of links per node re incresed. This with different prmeters. The results of some combin- is becuse the probbility tht node finds suitble tions re shown in Figures 12 nd 13. By exmining these neighbor for tsk migrtion improves with the increse in figures, we conclude the following. the number of links.. Agtin, the difference bsvcen simultion nd model is smll. 838
10 TIW difference in the performnce of rndom strtegies nd rein strtegies is not very significnt scompred to the difference in the performnce of rndom nd verging strtegies. Rndom lgorithms cn be used with periodic informtion updtes for ny network topology becuse they generte less messge trffic. This is especilly true for the fully connected network where PRndom performs s well s FRndom.. If the ctul scheduling time, V for the rndom lgorithm is less thn tht for rein $ gonthms,prndom cn be used insted of FMin, PMin or FRndom. 5. Concluding Remrks In this pper, we hve presented n pproch for modeling the verge tsk response time for distributed lod blncing in multicomputer systems. With this pproch, we re ble to compre different lod brdncing schemes on unified bsis. We hve shown tht these strtegies cn be modeled by n open centrl server queuing network if the system is symmetric nd homogeneous. We believe tht ny sender-initited lod blncing strtegy cn be modeled by this queuing network. With exmples from wide rnge of system prmeters, it is shown tht the verge tsk response timepredictedthrough the proposed model closely mtches the response time obtined vi simultion. This pproch cn be useful for nlyzing nd tuning n existing system, nd evluting newly proposed strtegies. Acknowledgements The uthors express their grtitude to nonymous referees whose comments improved the qulity of this pper. Thnks re lso due to NPAC, Syrcuse University, in prticulr the system dministrtion stff, for mking Multimx vilble during the lst hours. References [1] I. Ahmd nd A. Ghfoor, A Semi Distributed Tsk Al- Ioction Strtegy for Lrge Hypercube Supercomput- ;;8~97Proc. of Supercomputing 9, Nov. 199, pp. [2] RymondM. Brynt nd Rphel A. Finkel, A Stble Distributed Scheduling Algorithm: in Proc. of 2nd Int 1. Conf on Distributed Computing Systems, 1981, pp [31 D. L. Eger, E. D. LzowskndJ. Zhorjn, Adptive Lod Shring in Homogeneous Distributed Systems, IEEE Trns. on Sofwre Erw.,vol. SE 12,. PD , My [4] K. Efe nd B. Groselj, Minimizing Control Overhed in A&ptive Lod Shring: in Proc. of 9 th Intl. Con. on Distributed Computing Syste~? 1989, pp [5] G. C. Fox, A. Kolw ndr. Wdhms, The Implementtion of Dynmic Lod Blncer, in Proc. of SIAM Hypercube A4uitiprocessors ConJ, 1987, pp [61 A. Ghfcor nd I. Ahmd. An Efficient Model of Dynmic Tsk Scheduling for Distributed Systems, in Proc. of COMPSAC 9, Oct.,199, pp [7] A. Ghfoor, T. Rshkow nd Imrn Ghfoor, Bisectionl Fult Tolernt Communiction Architecture for Supercomputer Systems, IEEE Trns. on Computers,vol. 38, no. 1, pp , October [8] D. C. Gnmdwld, B. A. Nzief ndd. A. Reed, Empiricl Comprison of Heuristic Lod Distribution in Point WPoint Multicomputer Networks: Proc. of The F~thDistributed Memory Computing Conference, April 199, pp [9] A. H cndt. J.Johnson, Sensitivity ShIdyof the Lod Blncing Algorithm in Distributed SystemYJourn/ of Prllel nd Distributed Computing, October 199, pp [1] L.V. KE, Compringtheperformnceof twodynmic lod distribution rneth6ds, Proceedings of Znt 1. Confi on Prllel Processing, 1988, pp [11] F. C. H. Lin nd R. M. Keller, Grdient Model: A demnd Driven Lod Blncing Scheme: in Proc. of d-th Int 1 Conf on Distributed Computing Systems, 1986, pp [121 M. L. nd M. Mehnn, Lod Blncing in Homoge- - neous Brodcst Distributed Systemsj h-proc. ofa~m Computer Network Pe@ormnce Symposium, April 1982, pp [13] L. M. Ni, C. Xu nd T. B. Gendreu, A Disrnbuted Drfting Algorithm for Lod Blncing, IEEE Trns. on Sof&re Eng., vol. SE-11, no. 1 Oct. 1985, pp [14] L. M. Ni nd Ki Hwng, Optiml Lod Blncing in Multiple Processor System with Mny Job Clsses, IEEE Trns. on Softwre Eng., vol. SE-11, My 1985, pp [15] K. Rmmrithm, J. A. Stnkovic nd Wei Zho, Distributed Scheduling of Tsks with Dedlines nd Resource Requirements, IEEE Trns. on Computers, vol. 38, no. 8, Aug. 1989, pp [16] A. Ross nd B. McMillin, Experimentl Comprison of Bidding nd Drfting Lod Shring Pmtocds, Proc. of The Fjlh Distributed Memory Computing Conference, April 199, pp [17] V. A. Sltore, A Distributed nd Adptive Dynmic Lod Blncing Scheme for Prllel Processing of Medium-Grin Tsks; Proc. of The Fifth Distributed ;9e.zoo9 Computing Conference, April 199, pp. [18] K. G. Sh~ nd Y. -C. Chng, LodShringin Distributed Rel-Time Systems with Stte-Chnge Brodcsts, IEEE Trns. on Computers, VOL 38, no. 8, Aug. 1989, pp [19] W. ShundL. V. K&5, ADynmic Scheduling Strtegy for the Chre-Kemel System, in Proc. of Supercomputing 89, November 1989, pp [2] J. A. Stnkovic nd I. S. Sidhu, An Adptive Bidding Algorithm for Processes, Clusters nd Distributed Groups, in Proc. of4 thint 1. Conf. on Distributed Computing Systems, 1984, pp [21] K. S. Trivedi, Probbility & Sttistics with Relibility, Queuing nd Computer Science Applictions, Prentice Hll, inc. Englewood Cliffs, NJ, [22] J. Xu nd K. Hwng, Heuristic Methods for Dynmic Lod Brdncing in Messge-Pssing Supercomputer, in Proc. of Supercomputing 9, November 199, pp. 88U397. [23] Y. Wng ndr. J. T. Morris, Lod Shring in Distributed Systems, inieee Trns. on Computers, C 34 no. 3, Mrch 1985, pp
Economics Letters 65 (1999) 9 15. macroeconomists. a b, Ruth A. Judson, Ann L. Owen. Received 11 December 1998; accepted 12 May 1999
Economics Letters 65 (1999) 9 15 Estimting dynmic pnel dt models: guide for q mcroeconomists b, * Ruth A. Judson, Ann L. Owen Federl Reserve Bord of Governors, 0th & C Sts., N.W. Wshington, D.C. 0551,
More informationSmall Business Networking
Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd business. Introducing technology
More informationSmall Business Networking
Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd business. Introducing technology
More informationSmall Business Networking
Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd processes. Introducing technology
More informationTreatment Spring Late Summer Fall 0.10 5.56 3.85 0.61 6.97 3.01 1.91 3.01 2.13 2.99 5.33 2.50 1.06 3.53 6.10 Mean = 1.33 Mean = 4.88 Mean = 3.
The nlysis of vrince (ANOVA) Although the t-test is one of the most commonly used sttisticl hypothesis tests, it hs limittions. The mjor limittion is tht the t-test cn be used to compre the mens of only
More informationHow To Network A Smll Business
Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd processes. Introducing technology
More informationHow To Set Up A Network For Your Business
Why Network is n Essentil Productivity Tool for Any Smll Business TechAdvisory.org SME Reports sponsored by Effective technology is essentil for smll businesses looking to increse their productivity. Computer
More informationSmall Business Networking
Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd processes. Introducing technology
More informationHelicopter Theme and Variations
Helicopter Theme nd Vritions Or, Some Experimentl Designs Employing Pper Helicopters Some possible explntory vribles re: Who drops the helicopter The length of the rotor bldes The height from which the
More informationDlNBVRGH + Sickness Absence Monitoring Report. Executive of the Council. Purpose of report
DlNBVRGH + + THE CITY OF EDINBURGH COUNCIL Sickness Absence Monitoring Report Executive of the Council 8fh My 4 I.I...3 Purpose of report This report quntifies the mount of working time lost s result of
More informationEcon 4721 Money and Banking Problem Set 2 Answer Key
Econ 472 Money nd Bnking Problem Set 2 Answer Key Problem (35 points) Consider n overlpping genertions model in which consumers live for two periods. The number of people born in ech genertion grows in
More informationPerformance analysis model for big data applications in cloud computing
Butist Villlpndo et l. Journl of Cloud Computing: Advnces, Systems nd Applictions 2014, 3:19 RESEARCH Performnce nlysis model for big dt pplictions in cloud computing Luis Edurdo Butist Villlpndo 1,2,
More informationWEB DELAY ANALYSIS AND REDUCTION BY USING LOAD BALANCING OF A DNS-BASED WEB SERVER CLUSTER
Interntionl Journl of Computers nd Applictions, Vol. 9, No., 007 WEB DELAY ANALYSIS AND REDUCTION BY USING LOAD BALANCING OF A DNS-BASED WEB SERVER CLUSTER Y.W. Bi nd Y.C. Wu Abstrct Bsed on our survey
More informationPolynomial Functions. Polynomial functions in one variable can be written in expanded form as ( )
Polynomil Functions Polynomil functions in one vrible cn be written in expnded form s n n 1 n 2 2 f x = x + x + x + + x + x+ n n 1 n 2 2 1 0 Exmples of polynomils in expnded form re nd 3 8 7 4 = 5 4 +
More informationAll pay auctions with certain and uncertain prizes a comment
CENTER FOR RESEARC IN ECONOMICS AND MANAGEMENT CREAM Publiction No. 1-2015 All py uctions with certin nd uncertin prizes comment Christin Riis All py uctions with certin nd uncertin prizes comment Christin
More informationSpace Vector Pulse Width Modulation Based Induction Motor with V/F Control
Interntionl Journl of Science nd Reserch (IJSR) Spce Vector Pulse Width Modultion Bsed Induction Motor with V/F Control Vikrmrjn Jmbulingm Electricl nd Electronics Engineering, VIT University, Indi Abstrct:
More informationClearPeaks Customer Care Guide. Business as Usual (BaU) Services Peace of mind for your BI Investment
ClerPeks Customer Cre Guide Business s Usul (BU) Services Pece of mind for your BI Investment ClerPeks Customer Cre Business s Usul Services Tble of Contents 1. Overview...3 Benefits of Choosing ClerPeks
More informationbelief Propgtion Lgorithm in Nd Pent Penta
IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, VOL. 9, NO. 3, MAY/JUNE 2012 375 Itertive Trust nd Reputtion Mngement Using Belief Propgtion Ermn Aydy, Student Member, IEEE, nd Frmrz Feri, Senior
More informationCOMPARISON OF SOME METHODS TO FIT A MULTIPLICATIVE TARIFF STRUCTURE TO OBSERVED RISK DATA BY B. AJNE. Skandza, Stockholm ABSTRACT
COMPARISON OF SOME METHODS TO FIT A MULTIPLICATIVE TARIFF STRUCTURE TO OBSERVED RISK DATA BY B. AJNE Skndz, Stockholm ABSTRACT Three methods for fitting multiplictive models to observed, cross-clssified
More informationQoS Mechanisms C HAPTER 3. 3.1 Introduction. 3.2 Classification
C HAPTER 3 QoS Mechnisms 3.1 Introduction In the previous chpter, we introduced the fundmentl QoS concepts. In this chpter we introduce number of key QoS mechnisms tht enble QoS services. At the end of
More informationWhy is the NSW prison population falling?
NSW Bureu of Crime Sttistics nd Reserch Bureu Brief Issue pper no. 80 September 2012 Why is the NSW prison popultion flling? Jcqueline Fitzgerld & Simon Corben 1 Aim: After stedily incresing for more thn
More informationReasoning to Solve Equations and Inequalities
Lesson4 Resoning to Solve Equtions nd Inequlities In erlier work in this unit, you modeled situtions with severl vriles nd equtions. For exmple, suppose you were given usiness plns for concert showing
More informationUse Geometry Expressions to create a more complex locus of points. Find evidence for equivalence using Geometry Expressions.
Lerning Objectives Loci nd Conics Lesson 3: The Ellipse Level: Preclculus Time required: 120 minutes In this lesson, students will generlize their knowledge of the circle to the ellipse. The prmetric nd
More informationSoftware Cost Estimation Model Based on Integration of Multi-agent and Case-Based Reasoning
Journl of Computer Science 2 (3): 276-282, 2006 ISSN 1549-3636 2006 Science Publictions Softwre Cost Estimtion Model Bsed on Integrtion of Multi-gent nd Cse-Bsed Resoning Hsn Al-Skrn Informtion Technology
More informationBasic Analysis of Autarky and Free Trade Models
Bsic Anlysis of Autrky nd Free Trde Models AUTARKY Autrky condition in prticulr commodity mrket refers to sitution in which country does not engge in ny trde in tht commodity with other countries. Consequently
More informationLecture 3 Gaussian Probability Distribution
Lecture 3 Gussin Probbility Distribution Introduction l Gussin probbility distribution is perhps the most used distribution in ll of science. u lso clled bell shped curve or norml distribution l Unlike
More informationDistributions. (corresponding to the cumulative distribution function for the discrete case).
Distributions Recll tht n integrble function f : R [,] such tht R f()d = is clled probbility density function (pdf). The distribution function for the pdf is given by F() = (corresponding to the cumultive
More informationExperiment 6: Friction
Experiment 6: Friction In previous lbs we studied Newton s lws in n idel setting, tht is, one where friction nd ir resistnce were ignored. However, from our everydy experience with motion, we know tht
More informationGraphs on Logarithmic and Semilogarithmic Paper
0CH_PHClter_TMSETE_ 3//00 :3 PM Pge Grphs on Logrithmic nd Semilogrithmic Pper OBJECTIVES When ou hve completed this chpter, ou should be ble to: Mke grphs on logrithmic nd semilogrithmic pper. Grph empiricl
More informationValue Function Approximation using Multiple Aggregation for Multiattribute Resource Management
Journl of Mchine Lerning Reserch 9 (2008) 2079-2 Submitted 8/08; Published 0/08 Vlue Function Approximtion using Multiple Aggregtion for Multittribute Resource Mngement Abrhm George Wrren B. Powell Deprtment
More informationAN ANALYTICAL HIERARCHY PROCESS METHODOLOGY TO EVALUATE IT SOLUTIONS FOR ORGANIZATIONS
AN ANALYTICAL HIERARCHY PROCESS METHODOLOGY TO EVALUATE IT SOLUTIONS FOR ORGANIZATIONS Spiros Vsilkos (), Chrysostomos D. Stylios (),(b), John Groflkis (c) () Dept. of Telemtics Center, Computer Technology
More informationMathematics. Vectors. hsn.uk.net. Higher. Contents. Vectors 128 HSN23100
hsn.uk.net Higher Mthemtics UNIT 3 OUTCOME 1 Vectors Contents Vectors 18 1 Vectors nd Sclrs 18 Components 18 3 Mgnitude 130 4 Equl Vectors 131 5 Addition nd Subtrction of Vectors 13 6 Multipliction by
More informationSTATUS OF LAND-BASED WIND ENERGY DEVELOPMENT IN GERMANY
Yer STATUS OF LAND-BASED WIND ENERGY Deutsche WindGurd GmbH - Oldenburger Strße 65-26316 Vrel - Germny +49 (4451)/9515 - info@windgurd.de - www.windgurd.com Annul Added Cpcity [MW] Cumultive Cpcity [MW]
More informationAn Undergraduate Curriculum Evaluation with the Analytic Hierarchy Process
An Undergrdute Curriculum Evlution with the Anlytic Hierrchy Process Les Frir Jessic O. Mtson Jck E. Mtson Deprtment of Industril Engineering P.O. Box 870288 University of Albm Tuscloos, AL. 35487 Abstrct
More information9 CONTINUOUS DISTRIBUTIONS
9 CONTINUOUS DISTIBUTIONS A rndom vrible whose vlue my fll nywhere in rnge of vlues is continuous rndom vrible nd will be ssocited with some continuous distribution. Continuous distributions re to discrete
More informationSmall Businesses Decisions to Offer Health Insurance to Employees
Smll Businesses Decisions to Offer Helth Insurnce to Employees Ctherine McLughlin nd Adm Swinurn, June 2014 Employer-sponsored helth insurnce (ESI) is the dominnt source of coverge for nonelderly dults
More informationTITLE THE PRINCIPLES OF COIN-TAP METHOD OF NON-DESTRUCTIVE TESTING
TITLE THE PRINCIPLES OF COIN-TAP METHOD OF NON-DESTRUCTIVE TESTING Sung Joon Kim*, Dong-Chul Che Kore Aerospce Reserch Institute, 45 Eoeun-Dong, Youseong-Gu, Dejeon, 35-333, Kore Phone : 82-42-86-231 FAX
More informationProject 6 Aircraft static stability and control
Project 6 Aircrft sttic stbility nd control The min objective of the project No. 6 is to compute the chrcteristics of the ircrft sttic stbility nd control chrcteristics in the pitch nd roll chnnel. The
More informationpiecewise Liner SLAs and Performance Timetagment
i: Incrementl Cost bsed Scheduling under Piecewise Liner SLAs Yun Chi NEC Lbortories Americ 18 N. Wolfe Rd., SW3 35 Cupertino, CA 9514, USA ychi@sv.nec lbs.com Hyun Jin Moon NEC Lbortories Americ 18 N.
More informationLump-Sum Distributions at Job Change, p. 2
Jnury 2009 Vol. 30, No. 1 Lump-Sum Distributions t Job Chnge, p. 2 E X E C U T I V E S U M M A R Y Lump-Sum Distributions t Job Chnge GROWING NUMBER OF WORKERS FACED WITH ASSET DECISIONS AT JOB CHANGE:
More informationVendor Rating for Service Desk Selection
Vendor Presented By DATE Using the scores of 0, 1, 2, or 3, plese rte the vendor's presenttion on how well they demonstrted the functionl requirements in the res below. Also consider how efficient nd functionl
More informationBandwidth Allocation for Best Effort Traffic to Achieve 100% Throughput
Bndwidth Alloction for Best Effort Trffic to Achieve 100% Throughput Msoumeh Krimi, Zhuo Sun, nd Deng Pn Florid Interntionl University, Mimi, FL E-mils: {mkri001, zsun003, pnd}@fiu.edu Abstrct Generlized
More informationTraffic Rank Based QoS Routing in Wireless Mesh Network
Trffic Rnk Bsed QoS Routing in Wireless Mesh Network Deep P Kmble #1, Sujth P Terdl *2 #1 Deprtment of Computer Science nd Engineering, Poojy Doddp App College of Engineering, Gulbrg, Krntk, Indi. *2 Deprtment
More informationThe Velocity Factor of an Insulated Two-Wire Transmission Line
The Velocity Fctor of n Insulted Two-Wire Trnsmission Line Problem Kirk T. McDonld Joseph Henry Lbortories, Princeton University, Princeton, NJ 08544 Mrch 7, 008 Estimte the velocity fctor F = v/c nd the
More informationVoIP for the Small Business
Reducing your telecommunictions costs VoIP (Voice over Internet Protocol) offers low cost lterntive to expensive trditionl phone services nd is rpidly becoming the communictions system of choice for smll
More informationSPECIAL PRODUCTS AND FACTORIZATION
MODULE - Specil Products nd Fctoriztion 4 SPECIAL PRODUCTS AND FACTORIZATION In n erlier lesson you hve lernt multipliction of lgebric epressions, prticulrly polynomils. In the study of lgebr, we come
More informationEE247 Lecture 4. For simplicity, will start with all pole ladder type filters. Convert to integrator based form- example shown
EE247 Lecture 4 Ldder type filters For simplicity, will strt with ll pole ldder type filters Convert to integrtor bsed form exmple shown Then will ttend to high order ldder type filters incorporting zeros
More information2. Transaction Cost Economics
3 2. Trnsction Cost Economics Trnsctions Trnsctions Cn Cn Be Be Internl Internl or or Externl Externl n n Orgniztion Orgniztion Trnsctions Trnsctions occur occur whenever whenever good good or or service
More informationORBITAL MANEUVERS USING LOW-THRUST
Proceedings of the 8th WSEAS Interntionl Conference on SIGNAL PROCESSING, ROBOICS nd AUOMAION ORBIAL MANEUVERS USING LOW-HRUS VIVIAN MARINS GOMES, ANONIO F. B. A. PRADO, HÉLIO KOII KUGA Ntionl Institute
More informationProfileMe: Hardware Support for Instruction-Level Profiling on Out-of-Order Processors
ProfileMe: Hrdwre Support for Instruction-Level Profiling on Out-of-Order Processors Jeffrey Den Jmes E. Hicks Crl A. Wldspurger Willim E. Weihl George Chrysos Digitl Equipment Corportion Abstrct Profile
More information2015 EDITION. AVMA Report on Veterinary Compensation
2015 EDITION AVMA Report on Veterinry Compenstion AVMA Report on Veterinry Compenstion 2015 EDITION Copyright 2015 by the All rights reserved. ISBN-13: 978-1-882691-31-9 AVMA Report on Veterinry Compenstion
More informationModeling POMDPs for Generating and Simulating Stock Investment Policies
Modeling POMDPs for Generting nd Simulting Stock Investment Policies Augusto Cesr Espíndol Bff UNIRIO - Dep. Informátic Aplicd Av. Psteur, 458 - Térreo Rio de Jneiro - Brzil ugusto.bff@uniriotec.br Angelo
More informationg(y(a), y(b)) = o, B a y(a)+b b y(b)=c, Boundary Value Problems Lecture Notes to Accompany
Lecture Notes to Accompny Scientific Computing An Introductory Survey Second Edition by Michel T Heth Boundry Vlue Problems Side conditions prescribing solution or derivtive vlues t specified points required
More informationNetwork Configuration Independence Mechanism
3GPP TSG SA WG3 Security S3#19 S3-010323 3-6 July, 2001 Newbury, UK Source: Title: Document for: AT&T Wireless Network Configurtion Independence Mechnism Approvl 1 Introduction During the lst S3 meeting
More informationENHANCING CUSTOMER EXPERIENCE THROUGH BUSINESS PROCESS IMPROVEMENT: AN APPLICATION OF THE ENHANCED CUSTOMER EXPERIENCE FRAMEWORK (ECEF)
ENHNCING CUSTOMER EXPERIENCE THROUGH BUSINESS PROCESS IMPROVEMENT: N PPLICTION OF THE ENHNCED CUSTOMER EXPERIENCE FRMEWORK (ECEF) G.J. Both 1, P.S. Kruger 2 & M. de Vries 3 Deprtment of Industril nd Systems
More informationCost Functions for Assessment of Vehicle Dynamics
Cost Functions for Assessment of Vehicle Dynmics Dzmitry Svitski Automotive Engineering Deprtment Ilmenu University of Technology Ilmenu, Germny dzmitry.svitski@tu-ilmenu.de Pvel Nedom, Jroslv Mchn Skod
More informationRotating DC Motors Part II
Rotting Motors rt II II.1 Motor Equivlent Circuit The next step in our consiertion of motors is to evelop n equivlent circuit which cn be use to better unerstn motor opertion. The rmtures in rel motors
More informationContextualizing NSSE Effect Sizes: Empirical Analysis and Interpretation of Benchmark Comparisons
Contextulizing NSSE Effect Sizes: Empiricl Anlysis nd Interprettion of Benchmrk Comprisons NSSE stff re frequently sked to help interpret effect sizes. Is.3 smll effect size? Is.5 relly lrge effect size?
More informationData replication in mobile computing
Technicl Report, My 2010 Dt repliction in mobile computing Bchelor s Thesis in Electricl Engineering Rodrigo Christovm Pmplon HALMSTAD UNIVERSITY, IDE SCHOOL OF INFORMATION SCIENCE, COMPUTER AND ELECTRICAL
More informationThe LENA TM Language Environment Analysis System:
FOUNDATION The LENA TM Lnguge Environment Anlysis System: Audio Specifictions of the DLP-0121 Michel Ford, Chrles T. Ber, Dongxin Xu, Umit Ypnel, Shrmi Gry LENA Foundtion, Boulder, CO LTR-03-2 September
More informationDecision Rule Extraction from Trained Neural Networks Using Rough Sets
Decision Rule Extrction from Trined Neurl Networks Using Rough Sets Alin Lzr nd Ishwr K. Sethi Vision nd Neurl Networks Lbortory Deprtment of Computer Science Wyne Stte University Detroit, MI 48 ABSTRACT
More informationDiscovering General Logical Network Topologies
Discovering Generl Logicl Network Topologies Mrk otes McGill University, Montrel, Quebec Emil: cotes@ece.mcgill.c Michel Rbbt nd Robert Nowk Rice University, Houston, TX Emil: {rbbt, nowk}@rice.edu Technicl
More informationModule 2. Analysis of Statically Indeterminate Structures by the Matrix Force Method. Version 2 CE IIT, Kharagpur
Module Anlysis of Stticlly Indeterminte Structures by the Mtrix Force Method Version CE IIT, Khrgpur esson 9 The Force Method of Anlysis: Bems (Continued) Version CE IIT, Khrgpur Instructionl Objectives
More informationReputation management for distributed service-oriented architectures
Reputtion mngement for distributed service-oriented rchitectures Article Accepted version C. Crpnzno, F. Milzzo, A. De Pol, G. Lo Re In Proceedings of the Fourth IEEE Interntionl Conference on Self- Adptive
More informationEnterprise Risk Management Software Buyer s Guide
Enterprise Risk Mngement Softwre Buyer s Guide 1. Wht is Enterprise Risk Mngement? 2. Gols of n ERM Progrm 3. Why Implement ERM 4. Steps to Implementing Successful ERM Progrm 5. Key Performnce Indictors
More informationEstimating Exchange Rate Exposures:
Estimting Exchnge Rte Exposures: Issues in Model Structure * Gordon M. Bodnr ** Pul H. Nitze School of Advnced Interntionl Studies, The Johns Hopkins University 1740 Msschusetts Avenue NW Wshington, DC
More informationHow To Study The Effects Of Music Composition On Children
C-crcs Cognitive - Counselling Reserch & Conference Services (eissn: 2301-2358) Volume I Effects of Music Composition Intervention on Elementry School Children b M. Hogenes, B. Vn Oers, R. F. W. Diekstr,
More informationPhysics 43 Homework Set 9 Chapter 40 Key
Physics 43 Homework Set 9 Chpter 4 Key. The wve function for n electron tht is confined to x nm is. Find the normliztion constnt. b. Wht is the probbility of finding the electron in. nm-wide region t x
More informationHealth insurance marketplace What to expect in 2014
Helth insurnce mrketplce Wht to expect in 2014 33096VAEENBVA 06/13 The bsics of the mrketplce As prt of the Affordble Cre Act (ACA or helth cre reform lw), strting in 2014 ALL Americns must hve minimum
More informationParticipation and investment decisions in a retirement plan: the influence of colleagues choices
Journl of Public Economics 85 (2002) 121 148 www.elsevier.com/ locte/ econbse Prticiption nd investment decisions in retirement pln: the influence of collegues choices Esther Duflo,b, *, Emmnuel Sez MIT,
More informationSimulation of operation modes of isochronous cyclotron by a new interative method
NUKLEONIKA 27;52(1):29 34 ORIGINAL PAPER Simultion of opertion modes of isochronous cyclotron y new intertive method Ryszrd Trszkiewicz, Mrek Tlch, Jcek Sulikowski, Henryk Doruch, Tdeusz Norys, Artur Srok,
More informationFactoring Polynomials
Fctoring Polynomils Some definitions (not necessrily ll for secondry school mthemtics): A polynomil is the sum of one or more terms, in which ech term consists of product of constnt nd one or more vribles
More informationQuality Evaluation of Entrepreneur Education on Graduate Students Based on AHP-fuzzy Comprehensive Evaluation Approach ZhongXiaojun 1, WangYunfeng 2
Interntionl Journl of Engineering Reserch & Science (IJOER) ISSN [2395-6992] [Vol-2, Issue-1, Jnury- 2016] Qulity Evlution of Entrepreneur Eduction on Grdute Students Bsed on AHP-fuzzy Comprehensive Evlution
More informationDeployment Strategy for Mobile Robots with Energy and Timing Constraints
Proceedings of the 2005 IEEE Interntionl Conference on Robotics nd Automtion Brcelon, Spin, April 2005 Deployment Strtegy for Mobile Robots with Energy nd Timing Constrints Yongguo Mei, Yung-Hsing Lu,
More informationJaERM Software-as-a-Solution Package
JERM Softwre-s--Solution Pckge Enterprise Risk Mngement ( ERM ) Public listed compnies nd orgnistions providing finncil services re required by Monetry Authority of Singpore ( MAS ) nd/or Singpore Stock
More informationPortfolio approach to information technology security resource allocation decisions
Portfolio pproch to informtion technology security resource lloction decisions Shivrj Knungo Deprtment of Decision Sciences The George Wshington University Wshington DC 20052 knungo@gwu.edu Abstrct This
More informationIntegration. 148 Chapter 7 Integration
48 Chpter 7 Integrtion 7 Integrtion t ech, by supposing tht during ech tenth of second the object is going t constnt speed Since the object initilly hs speed, we gin suppose it mintins this speed, but
More informationTrade liberalization and per capita income convergence: a difference-in-differences analysis
Journl of Interntionl Economics 55 (2001) 203 228 www.elsevier.nl/ locte/ econbse Trde liberliztion nd per cpit income convergence: difference-in-differences nlysis Mtthew J. Slughter* Drtmouth College
More informationMath 135 Circles and Completing the Square Examples
Mth 135 Circles nd Completing the Squre Exmples A perfect squre is number such tht = b 2 for some rel number b. Some exmples of perfect squres re 4 = 2 2, 16 = 4 2, 169 = 13 2. We wish to hve method for
More information** Dpt. Chemical Engineering, Kasetsart University, Bangkok 10900, Thailand
Modelling nd Simultion of hemicl Processes in Multi Pulse TP Experiment P. Phnwdee* S.O. Shekhtmn +. Jrungmnorom** J.T. Gleves ++ * Dpt. hemicl Engineering, Ksetsrt University, Bngkok 10900, Thilnd + Dpt.hemicl
More informationAppendix D: Completing the Square and the Quadratic Formula. In Appendix A, two special cases of expanding brackets were considered:
Appendi D: Completing the Squre nd the Qudrtic Formul Fctoring qudrtic epressions such s: + 6 + 8 ws one of the topics introduced in Appendi C. Fctoring qudrtic epressions is useful skill tht cn help you
More informationHealth insurance exchanges What to expect in 2014
Helth insurnce exchnges Wht to expect in 2014 33096CAEENABC 02/13 The bsics of exchnges As prt of the Affordble Cre Act (ACA or helth cre reform lw), strting in 2014 ALL Americns must hve minimum mount
More informationA Network Management System for Power-Line Communications and its Verification by Simulation
A Network Mngement System for Power-Line Communictions nd its Verifiction y Simultion Mrkus Seeck, Gerd Bumiller GmH Unterschluerscher-Huptstr. 10, D-90613 Großhersdorf, Germny Phone: +49 9105 9960-51,
More informationc. Values in statements are broken down by fiscal years; many projects are
Lecture 18: Finncil Mngement (Continued)/Csh Flow CEE 498 Construction Project Mngement L Schedules A. Schedule.of Contrcts Completed See Attchment # 1 ll. 1. Revenues Erned 2. Cost of Revenues 3. Gross
More informationEQUATIONS OF LINES AND PLANES
EQUATIONS OF LINES AND PLANES MATH 195, SECTION 59 (VIPUL NAIK) Corresponding mteril in the ook: Section 12.5. Wht students should definitely get: Prmetric eqution of line given in point-direction nd twopoint
More informationCollege Admissions with Entrance Exams: Centralized versus Decentralized
Is E. Hflir Rustmdjn Hkimov Dorothe Kübler Morimitsu Kurino College Admissions with Entrnce Exms: Centrlized versus Decentrlized Discussion Pper SP II 2014 208 October 2014 (WZB Berlin Socil Science Center
More informationAutomated Resource Management in Virtualized Data Centers
Automted Resource Mngement in Virtulized Dt Centers Shrd Singhl Xioyun Zhu Hewlett Pcrd Lbortories VMwre Inc. IM 9 Tutoril: Recent Advnces in the Appliction of Control Theory to Networ nd Service Mngement
More informationApplication-Level Traffic Monitoring and an Analysis on IP Networks
Appliction-Level Trffic Monitoring nd n Anlysis on IP Networks Myung-Sup Kim, Young J. Won, nd Jmes Won-Ki Hong Trditionl trffic identifiction methods bsed on wellknown port numbers re not pproprite for
More informationUnit 29: Inference for Two-Way Tables
Unit 29: Inference for Two-Wy Tbles Prerequisites Unit 13, Two-Wy Tbles is prerequisite for this unit. In ddition, students need some bckground in significnce tests, which ws introduced in Unit 25. Additionl
More informationCredit Ratings, Collateral, and Loan Characteristics: Implications for Yield*
Kose John New York University Anthony W. Lynch New York University nd Ntionl Bureu of Economic Reserch Mnju Puri Stnford University nd Ntionl Bureu of Economic Reserch Credit Rtings, Collterl, nd Lon Chrcteristics:
More informationIntroducing Kashef for Application Monitoring
WextWise 2010 Introducing Kshef for Appliction The Cse for Rel-time monitoring of dtcenter helth is criticl IT process serving vriety of needs. Avilbility requirements of 6 nd 7 nines of tody SOA oriented
More informationSection 7-4 Translation of Axes
62 7 ADDITIONAL TOPICS IN ANALYTIC GEOMETRY Section 7-4 Trnsltion of Aes Trnsltion of Aes Stndrd Equtions of Trnslted Conics Grphing Equtions of the Form A 2 C 2 D E F 0 Finding Equtions of Conics In the
More informationExample A rectangular box without lid is to be made from a square cardboard of sides 18 cm by cutting equal squares from each corner and then folding
1 Exmple A rectngulr box without lid is to be mde from squre crdbord of sides 18 cm by cutting equl squres from ech corner nd then folding up the sides. 1 Exmple A rectngulr box without lid is to be mde
More informationJ4.12 REGIONAL HYDROLOGICAL CYCLE AND WEATHER AND CLIMATE IN THE CONTIGUOUS UNITED STATES
J4.12 REGIONAL HYDROLOGICAL CYCLE AND WEATHER AND CLIMATE IN THE CONTIGUOUS UNITED STATES 1. INTRODUCTION i Hu 1 nd Song Feng Climte nd Bio-Atmospheric Sciences rogrm School of Nturl Resource Sciences
More informationCHAPTER 11 Numerical Differentiation and Integration
CHAPTER 11 Numericl Differentition nd Integrtion Differentition nd integrtion re bsic mthemticl opertions with wide rnge of pplictions in mny res of science. It is therefore importnt to hve good methods
More informationThis paper considers two independent firms that invest in resources such as capacity or inventory based on
MANAGEMENT SCIENCE Vol. 5, No., December 006, pp. 93 99 issn 005-909 eissn 56-550 06 5 93 informs doi 0.87/mnsc.060.0574 006 INFORMS Strtegic Investments, Trding, nd Pricing Under Forecst Updting Jiri
More informationT H E S E C U R E T R A N S M I S S I O N P R O T O C O L O F S E N S O R A D H O C N E T W O R K
Z E S Z Y T Y N A U K O W E A K A D E M I I M A R Y N A R K I W O J E N N E J S C I E N T I F I C J O U R N A L O F P O L I S H N A V A L A C A D E M Y 2015 (LVI) 4 (203) A n d r z e j M r c z k DOI: 10.5604/0860889X.1187607
More informationDynamic TDMA Slot Assignment in Ad Hoc Networks
Dynmic TDMA Slot Assignment in Ad Hoc Networks Akimitsu KANZAKI, Toshiki UEMUKAI, Tkhiro HARA, Shojiro NISHIO Dept. of Multimedi Eng., Grd. Sch. of Informtion Science nd Technology, Osk Univ. Dept. of
More informationProtocol Analysis. 17-654/17-764 Analysis of Software Artifacts Kevin Bierhoff
Protocol Anlysis 17-654/17-764 Anlysis of Softwre Artifcts Kevin Bierhoff Tke-Awys Protocols define temporl ordering of events Cn often be cptured with stte mchines Protocol nlysis needs to py ttention
More informationffiiii::#;#ltlti.*?*:j,'i#,rffi
5..1 EXPEDTNG A PROJECT. 187 700 6 o 'o-' 600 E 500 17 18 19 20 Project durtion (dys) Figure 6-6 Project cost vs. project durtion for smple crsh problem. Using Excel@ to Crsh Project T" llt ffiiii::#;#ltlti.*?*:j,'i#,rffi
More information