GrenchMark : a framework for analyzing, testing, and comparing grids Iosup, A.; Epema, D.H.J.

Size: px
Start display at page:

Download "GrenchMark : a framework for analyzing, testing, and comparing grids Iosup, A.; Epema, D.H.J."

Transcription

1 GrnMr : rmwor or nlyzn, tstn, n omprn rs Iosup, A.; Epm, D.H.J. Puls n: Prons o t 6t Intrntonl Symposum on Clustr Computn n t Gr (CCGr 26, Snpor, My 16-19, 26) DOI: 1.119/CCGRID Puls: 1/1/26 Doumnt Vrson Pulsr s PDF, lso nown s Vrson o Ror (nlus nl p, ssu n volum numrs) Pls t oumnt vrson o ts pulton: A sumtt mnusrpt s t utor's vrson o t rtl upon sumsson n or pr-rvw. Tr n mportnt rns twn t sumtt vrson n t ol puls vrson o ror. Popl ntrst n t rsr r vs to ontt t utor or t nl vrson o t pulton, or vst t DOI to t pulsr's wst. T nl utor vrson n t lly proo r vrsons o t pulton tr pr rvw. T nl puls vrson turs t nl lyout o t ppr nlun t volum, ssu n p numrs. Ln to pulton Ctton or puls vrson (APA): Iosup, A., & Epm, D. H. J. (26). GrnMr : rmwor or nlyzn, tstn, n omprn rs. In Prons o t 6t Intrntonl Symposum on Clustr Computn n t Gr (CCGr 26, Snpor, My 16-19, 26) (pp ). IEEE Computr Soty Prss. DOI: 1.119/CCGRID Gnrl rts Copyrt n morl rts or t pultons m ssl n t pul portl r rtn y t utors n/or otr opyrt ownrs n t s onton o ssn pultons tt usrs rons n y t ll rqurmnts ssot wt ts rts. Usrs my ownlo n prnt on opy o ny pulton rom t pul portl or t purpos o prvt stuy or rsr. You my not urtr strut t mtrl or us t or ny prot-mn tvty or ommrl n You my rly strut t URL ntyn t pulton n t pul portl? T own poly I you lv tt ts oumnt rs opyrt pls ontt us provn tls, n w wll rmov ss to t wor mmtly n nvstt your lm. Downlo t: 22. Nov. 217

2 GRENCHMARK: A Frmwor or Anlyzn, Tstn, n Comprn Grs Alxnru Iosup n D Epm Dlt Unvrsty o Tnoloy, Fulty o Eltrl Ennrn, Mtmts, n Computr Sn Astrt Gr omputn s omn t nturl wy to rt n sr lr sts o tronous rsours. Wt t nrstrutur omn ry or t lln, urrnt r vlopmnt n ptn n on provn tt rs rlly support rl ppltons, n on rtn qut nmrs to qunty ts support. Howvr, r ppltons r ust nnn to mr, n trtonl nmrs v yt to prov rprsnttv n r nvronmnts. To rss ts n-n- prolm, w propos ml-wy ppro: rt n run syntt r worlos omprsn ppltons rprsnttv or toy s rs. For ts purpos, w v sn n mplmnt GRENCHMARK, rmwor or syntt worlo nrton n sumsson. T rmwor rtly ltts syntt worlo moln, oms wt ovr 35 syntt n rl ppltons, n s xtnsl n lxl. W sow ow t rmwor n us or r systm nlyss, untonlty tstn n r nvronmnts, n or omprn rnt r sttns, n prsnt t rsults otn wt GRENCHMARK n our mult-lustr r, t DAS. 1 Introuton In t lon trm, Gr omputn systms (Grs) m t omn t stnr wy o srn tronous rsours, n o rtn tm nto vrtul pltorms, to us y multpl ornztons n npnnt usrs l. Wt t r nrstrutur strtn to mt t rqurmnts o su n mtous ol [3], t urrnt voluton o rs ns on provn tt t n run rl ppltons, rom trtonl squntl n prlll ppltons to nw, r-only, ppltons. As onsqun, tr s lr n or nrtn n runnn worlos omprsn r ppltons or monstrton n tstn purposs. In ts ppr w prsnt GRENCHMARK, rmwor or syntt worlo nrton n sumsson. Wt GRENCHMARK, w try to n ommon roun or r prormn nlyss n, n t lvor o t Prlll Worlos Arv 1, w or t prormn-ornt Gr 1 T Prlll Worlo Arvs ms vrous worlo trs rom rl prlll prouton nvronmnts vll t ttp:// P.O. Box 531, 26 GA Dlt, T Ntrlns Eml: {A.Iosup,D.H.J.Epm}@w.tult.nl ommunty tool tt n lp to rn totr Gr prormn vluton ppros, towrs t ol o uln stnr Gr nmrs. Our mn ontrutons r: Moln n sltn st o rprsnttv rl n syntt r ppltons (Ston 2), nlun ppltons tt rqur o-lloton (Ston 2.2); A systmt ppro to n st o tools or nrtn syntt r worlos or nlyzn, tstn, n omprn ommon r sttns (Ston 3); An xprmntl vlton o our ppro (Ston 4). In our sttn, w us mult-lustr nvronmnt, t DAS [2], t KOALA 2 o-llotn r sulr [11], n t rl ppltons nlu n t Is 3 Jv-s Gr prormmn nvronmnt [13]. 2 A Mol or Syntt Gr Worlos Ts ston prsnts mol or syntt r worlos. 2.1 Gr st n mn mol W ssum r systms omprsn svrl omputn sts. Sts r prov n mntn y nvuls or nsttutons, n r t to r us. Sts my v rnt us pols,.., on st my t 1% rsours or runnn ts lol usrs os, n only sr t rsours to t lol r ommunty no su os xst, wl, t t otr xtrm, notr st my or ll ts rsours t ny tm to nyoy lonn to t lol r ommunty, wtout srmntn twn lol n rmot usrs. E st ontns svrl omputn rsours,.., st s lustr o rsours. Rsours n omputtonl n stor rsours or ot t t sm tm. On st, tr s only on twy ( mn us s n ntry pont to t systm, rom w os n lun n ls n trnsrr to n rom t lustr). 2 KOALA s vlop t TU Dlt, NL; mor normton out KOALA s vll t ttp:// 3 Is s vlop t VU Amstrm, NL, n s rly vll rom ttp:// Prons o t Sxt IEEE Intrntonl Symposum on Clustr Computn n t Gr (CCGRID'6)

3 2.2 Gr ppltons mol In our mol, w onsr two typs o ppltons tt n run n rs, n my nlu n syntt r worlos. Untry ppltons Ts tory nlus snl, untry, ppltons. At most t o prormmn mol must tn nto ount wn runnn n rs (.., lunn nm srvr or lunn n Is o). Typl xmpls nlu squntl n prlll (.., MPI, Jv RMI, Is) ppltons. Compost ppltons Ts tory nlus ppltons ompos o svrl untry or ompost ppltons. T r sulr ns to t nto ount ssus l ts ntr-pnns, vn rsrvton n xtn ult-tolrn, ss t omponnts o prormmn mol. Typl xmpls nlu s o tss, ns o tss, DAG-s ppltons, n ppltons s on nr rps (s Fur 1 or smpl ompost ppltons nrt wt GRENCHMARK). W lso onsr n our mol t noton o olloton: t smultnous lloton o rsours lot n rnt r sts to snl ppltons w onsst o multpl omponnts. T omponnts o o-llot os usully ntrt wt otr (.., onsr t s o ttly-oupl prlll pplton w ppns to run on rsours lot n svrl r sts). Untry n ompost os n ot o-llot. 2.3 Gr worlos mol W ru tt mny o t potntl Gr usrs r urrnt HPC usrs, or r urrntly runnn lr ts o os. For mny worn nvronmnts, n splly or t DAS, t mount o squntl os s snnt or vn omnnt. Tror, untry ppltons wt squntl or prlll strutur, n ompost ppltons wt o tss strutur r to prrr wn rtn r worlos. T worlo strutur s ult usn wll-nown sttstl strutons or moln rsour rqurmnts, wt vlus xtrt rom rl trs or slt rom sts prn y t worlo snr. Jos rrv ynmlly n t systm, n t ntr-rrvl tm o t morty o os n mol wt sttstl struton. Jos rrvl n lso ursty, tt s, mny os my rrv n vry sort tm ntrvl. 3 T GRENCHMARK rmwor Ts ston prsnts t GRENCHMARK rmwor. 3.1 Ovrvw GRENCHMARK s syntt r worlo nrtor n sumttr. It s xtnsl, n tt t llows nw typs o r ppltons to nlu n t worlo nrton, prmtrzl, s t llows t usr to prmtrz t worlos nrton n sumsson, n portl, s ts rrn mplmntton s wrttn n Pyton. T worlo nrtor s s on t onpts o unt nrtors n o o srpton ls (JDF) prntrs. T unt nrtors prou tl srptons on runnn st o ppltons (worlo unt), orn to t worlo srpton prov y t usr. In prnpl, tr s on unt or support pplton typ. T prntrs t t nrt worlo unts n rt o srpton ls sutl or r sumsson. In ts wy, multpl unt nrtors n oupl to prou worlo tt n sumtt to ny r rsour mnr, s lon s t rsour mnr supports tt typ o ppltons. T r ppltons urrntly support y GRENCH- MARK r squntl os, os w us MPI, n Is os. GRENCHMARK nlus st o ovr 35 syntt n rl ppltons. W v mplmnt our syntt ppltons: ssr, squntl pplton wt prmtrzl omputton n mmory rqurmnts, ssro, squntl pplton wt prmtrzl omputton n I/O rqurmnts, smp1, n MPI pplton wt prmtrzl omputton, ommunton, mmory, n I/O rqurmnts, n sw, n pplton mplmntn t o mol us n t Stnr Worlos Formt, rom t Prlll Worlos Arvs (PWA). W us ll t rl ppltons n som o t syntt ppltons nlu n t ult Is struton p. T rson s trol: t Is ppltons losly rsml or r rl-l prlll ppltons, ty v n provn to run on vrty o r sttns, n ty v n torouly sr 4. T Is ppltons om rom t rs o pysl smultons, prlll rnrn, omputtonl mtmts, stt sp sr, onormts, t omprsson, r mtos, n optmzton. Currntly, GRENCH- MARK n sumt os to KOALA, Glous GRAM, n Conor. T worlo sumttr nrts tl rports o t sumsson pross. T rports nlu ll o sumsson ommns, t turnroun tm o o, nlun t r ovr, t totl turnroun tm o t worlo, n vrous sttstl normton. 3.2 Rplyn trs wt GRENCHMARK GRENCHMARK n rply trs rom vrous prouton nvronmnts. Frst, t usr n lo trs n t 4 For t omplt lst o pultons rlt to Is ppltons, pls vst ttp:// Prons o t Sxt IEEE Intrntonl Symposum on Clustr Computn n t Gr (CCGRID'6)

4 Lvl Lvl Lvl Lvl 1 Lvl 2 Lvl 3 Lvl 4 Lvl 5 Lvl 6 Lvl 7 Lvl 8 Lvl 9 #36 #42 #27 #37 #33 #41 #48 #34 #44 #31 #39 #6 #16 #21 #24 #28 #46 #47 #5 #1 #13 #22 #25 #3 #38 #5 #12 #19 #26 #32 #4 #9 #1 #29 #43 #49 # #3 #15 #35 #45 #4 #14 #2 #2 #17 #23 #8 #11 #7 #18 Lvl Lvl 1 Lvl 2 Lvl 3 Lvl 4 Lvl 5 Lvl 6 Lvl 7 Lvl 8 Lvl 9 Lvl 1 Lvl 11 Lvl 12 Lvl 13 Lvl 14 Lvl 15 Lvl 16 #334 #65 #66 #87 #75 #88 #71 #79 #76 #83 #327 #89 #67 #68 #326 #7 #74 #84 #9 #72 #325 #85 #91 #77 #92 #78 #8 #69 #86 #81 # #82 #73 #56 #49 #29 #51 #53 #28 #27 #55 #58 #96 #57 #97 #98 #52 #5 #54 #35 #36 #172 #171 #37 #38 #42 #17 #39 #256 #283 #34 #1 #247 #99 #11 #294 #258 #4 #31 #118 #33 #112 #24 #115 #267 #41 #122 #249 #312 #134 #285 #33 #292 #298 #265 #128 #262 #13 #25 #17 #268 #125 #31 #286 #295 #137 #34 #259 #244 #316 #289 #37 #123 #241 #129 #271 #135 #276 #16 #253 #277 #266 #131 #248 #121 #239 #257 #11 #293 #275 #18 #127 #284 #9 #12 #32 #133 #242 #157 #141 #159 #1 #114 #139 #21 #113 #148 #19 #15 #15 #111 #145 #14 #163 #15 #142 #46 #151 #47 #16 #48 #3 #32 #154 #31 #14 #166 #1 #331 #3 #149 #319 #2 #63 #14 #158 #332 #22 #62 #147 #11 #333 #64 #12 #24 #143 #144 #4 #146 #161 #2 #153 #194 #178 #27 #176 #196 #185 #17 #187 #182 #2 #179 #188 #197 #191 #177 #173 #155 #156 #186 #328 #195 #23 #184 #329 #18 #33 #313 #28 #26 #21 #211 #212 #174 #18 #175 #16 #23 #162 #152 #164 #165 #124 #238 #181 #25 #183 #13 #19 #198 #274 #19 #192 #199 #193 #189 #21 #22 #296 #32 #311 #314 #246 #335 #321 #26 #126 #243 #252 #119 #245 #269 #272 #13 #254 #35 #132 #279 #261 #287 #255 #38 #138 #29 #299 #136 #263 #36 #288 #297 #281 #117 #315 #116 #317 #273 #251 #264 #3 #282 #39 #278 #12 #291 #318 #25 #323 #94 #168 #213 #6 #234 #229 #224 #44 #23 #235 #223 #226 #232 #28 #228 #236 #7 #222 #22 #5 #221 #231 #214 #215 #8 #225 #227 #233 #6 #216 #218 #217 #29 #237 #219 #45 #27 #43 #61 #95 #169 #26 #324 #59 #93 #167 #24 #322 #1 #2 #3 #4 #5 #6 #7 #8 #9 #1 #11 #1 #2 #3 #4 #5 #6 () () () () Fur 1. Compost ppltons nrt wt GRENCHMARK: () rnomly nrt o os; () rnomly nrt n o os; () DAG-s worlow nrt wt rnom mto rom t Stnr Ts Grp St (ttp:// () DAGs worlow nrt rom t SPEC nmr pppp, nlu n t Stnr Ts Grp St. Stnr Worlo Formt. Son, sn rl tr ontns tns o tousns o os, ltrn out os n sltn t rst-n os orn to vrous rtr s ssntl or sltn usl worlo; GRENCHMARK n us to sp n t rl worlo tr. Tr, rl trs nnot usully rply on notr systm tn t on on w ty wr qur, n vn on t sm systm t s n. T lttr ppns mor otn n t s o rs, w r nturlly volvn wt tr mlwr, n tror r vry ynm. GRENCHMARK n sl vrous spts o t worlo,.., t rqust rsours, or t o runtms, n n lp llvt ts prolm [7]. 3.3 Moln worlos wt GRENCHMARK GRENCHMARK ors support or t ollown worlo moln spts. Frst, t supports untry n ompost ppltons, n snl-st n o-llot os. Son, t llows t usr to n vrous o ntr-rrvl tms s on wll-nown sttstl strutons. Bss t Posson struton, us trtonlly n quu-s systms smulton, GRENCHMARK lso supports unorm, norml, xponntl n ypr-xponntl, Wull, lo norml, n mm strutons. Tr, t llows t worlo snr to omn svrl worlos nto snl on (mxn). Ts llows or nstn t nluson o ursts, y omnn sort worlo wt mny os pr tm unt wt lonr on, omprsn wr os pr tm unt. An tonl us o worlo mxn s n wt- nlyss tt vluts wt wll ppn to r ommunty ts rsours woul sr wt notr roup o usrs. In ts s, t worlo molr n mx t typl worlo o t two ommunts n vlut wtr t systm n support ot, unr vrous o ptn n xuton pols. 3.4 T GRENCHMARK pross W n two us ss or t GRENCHMARK rmwor: n rl worl n n smultons. A worlo nr- 1 Post-prouton Anlyz rsults Inr mtrs Rport prormn Worlo srpton Applton typ 1 Syntt Gnrt Worlo 5 r srpton 2 Worlo Dt Applton typ n Is strr, stout St output JoSumt stts strr, stout Worlo Output 4 Jo 1 JoSumt runnr RM St 1 Sumt Worlo Jo 2 JoSumt onor-o-sumt RM St n St 2 RM Gr Rsour Mnr SGE,PBS,... Jos rt Jo n Fur 2. T GRENCHMARK pross. # Fl-typ: txt/wl-sp #Jos Typ StTyp Totl StIno ArrvlTmDstr OtrIno 25 ssr snl 1 *:? Posson(12s) StrtAt=s 25 ssro snl 1 *:? Posson(12s) StrtAt=6s 25 smp1 snl 1 *:? Posson(12s) StrtAt=3s,ExtrnlFl=smp1.xn 25 smp1 snl 1 *:? Posson(12s) StrtAt=9s,ExtrnlFl=smp2.xn Fur 3. A GRENCHMARK worlo srpton xmpl. t y GRENCHMARK usn only syntt n wll stu ppltons n qully us n ot ss. Fur 2 pts t typl pross o usn t GRENCHMARK rmwor n rl nvronmnt. Frst, t usr srs t worlo to nrt, s ormtt txt l (1). Bs on t usr srpton, on t nown pplton typs, n on normton out t r sts, worlo s tn nrt y GRENCHMARK (2), n sumtt to t r (3). T r nvronmnt s rsponsl or xutn t os n rturnn tr rsults (4). T rsults nlu not only o outoms, ut lso tl sumsson rports. Fnlly, t usr prosss ll rsults n post-prouton stp (5). T us o GRENCHMARK or smultons s smlr, wt stps (3) n (4) possly omn. T most ult stp n usn GRENCHMARK s stp (1): srn t worlo. To s ts ts, w v sn smpl n xtnsl lnu; t worlo snr s only onrn wt t ulty o sn- Gr Prons o t Sxt IEEE Intrntonl Symposum on Clustr Computn n t Gr (CCGRID'6)

5 StTypsWtWts=nonx/3;x/5 StsWtWts=s1;s2;s3;s4 NComponntsWtWts=1/5.;3/16.2;5/5.;1;15;2/1.;4/1.;8 TotlCPUsWtWts=2/2.;4/3.;5;8;1;16;2;32... Fur 4. A GRENCHMARK worlo spton lnu xtnson. n rprsnttv worlos, rtr tn ow to sr tm. Fur 3 sows t worlo srpton or nrtn t mr+ tst, omprsn 1 os o our rnt typs. T rst two lns r ommnts. T nxt two lns r us to nrt squntl os o typs ssr n ssro, wt ult prmtrs. T nl two lns r us to nrt MPI os o typ smp1, wt prmtrs sp n xtrnl ls smp1.xn n smp2.xn. All our o typs ssum n rrvl pross wt Posson struton, wt n vr rt o 1 o vry 12 sons. T rst o o typ strts t tm sp n t worlo srpton wt t lp o t StrtAt t. For MPI os, t sp xtrnl l (t ExtrnlFl) ontns otr pplton-sp prmtrs (s lso Ston 3.5 n Fur 4). 3.5 Extnn t GRENCHMARK rmwor GRENCHMARK s n sn wt n nrmntl ppro n mn, n ltts utur xtnsons. T rmwor sn n sly xtn, or nstn y n vrous worlo nrton notons (.., usrs, vrtul ornztons). GRENCHMARK lso ors smpl plu-n systm, w n us to unt nrtors (nw pplton typs) n prntrs (support or otr r rsour mnrs). To xtn t worlo nrton pross, t usr s rst to xtn worlo spton lnu, n tn to wrt plu-n tt uss t lnu xtnson; t only rqurmnt s tt t xtnson lnu s s on Ky=Vlu sttmnts. A l wrttn n n xtnson lnu s utomtlly prs, n t t s vll to t usr wn t plu-n s nvo. For t lnu xtnson, GRENCHMARK ors mnsms to prs smpl vlus (.., oolns, strns, ntrs, n lots), n mor omplt onstruts (.., lsts, n lsts wt wts); t usr n lso to prs t xtnson lnu sttmnts rtly. Fur 4 sows n xmpl o l wrttn n n xtn lnu, or nrtn worlo wt ollot os. Ln 1 ns t typ o o-llot os to nrt s lst wt wts; nonx os (multst os wt unsp xuton sts) v lowr wt tn x os (mult-st os wt sp xuton sts). Ln 2 ns t possl xuton sts, s lst wt wts. A ult wt o 1. s utomtlly ssn to t lmnts or w t usr s not sp t wt. Lns 3 n 4 us lsts wt wts to n t numr o omponnts n t numr o prossors or nrt os. Jos wt 1 omponnt n 4 prossors r prrr. 4 T rsults Ts ston prsnts t rsults otn wt GRENCH- MARK. T xprmnts r not u to sow ull nlyss o rtn tur; nst, w try to sow ow GRENCHMARK n us or vrous ols. T mor rn twn t two ppros s n t wy rsults r nlyz, u to t rn n ols;.., n Tl 2 w sow summry o runtms or tr ppltons (prormn tstn), ut not t tl nlyss rqur or t omplt prormn rtrzton o ts ppltons (prormn nlyss). W n sussul o to o tt qurs ts rqust rsours, runs, nss, n rturns ll rsults wtn t tm llow or t worlo. Unlss otrws stt, w us t suss rt o t os s t prormn mtr or our xprmnts. T rson s twool: w n tt or urrnt rs t lty to rlly run os s vn mor mportnt tn rw prormn, n w ru (s on t rsults sown n Tl 2) tt GRENCHMARK rsults n lso us to xtrt otr mtrs (rom t mny vll, s or nstn [8]). 4.1 Exprmntl stup W us t DAS systm 5 s n xprmntl nvronmnt. T DAS systm omprss 5 lustrs, wt 32 up to 72 ul-prossor SMP nos. A sr l systm (NFS) s us wtn lustr. E lustr s on ntry pont (twy), on w usrs n lo n sumt os, or rtrv tr os output. T DAS systm os not srmnt twn lol n rmot usrs, ut s rnt rsour lloton pols pnn on t os rqust runtms. GRENCHMARK ws us to nrt n sumt t worlos. W us ot mol n rl (tr-s) worlos to nrt t tst worlos. E worlo ws sumtt n t norml DAS worn nvronmnt, tus n nlun y t roun lo nrt y otr DAS usrs. Som os oul not ns n t tm or w ty rqust rsours, n wr stopp utomtlly y t KOALA sulr. Ts stuton orrspons to usrs unr-stmtn ppltons runtms. E worlo rn twn t sumsson strt tm n 2 mnuts tr t sumsson o t lst o. Tus, som os not run, s not nou r rsours wr vll urn t tm twn tr sumsson n t n o t worlo run. Ts stuton s typl or rl worn nvronmnts, n n l to run n stop t wor- 5 Dstrut ASCI Supromputr, ttp:// Prons o t Sxt IEEE Intrntonl Symposum on Clustr Computn n t Gr (CCGRID'6)

6 Tl 1. T prormn tstn rsults. Typs o #o Componnt Suss Worlo Appltons CPUs # sz Rt mr1 syntt, sq % smp1 syntt, MPI % s1 N Quns, Is % lo orn to t usr sptons sows som o t plts o GRENCHMARK. 4.2 Gr systm nlyss Ts ston sows ow GRENCHMARK n us or two typs o systm nlyss: prormn tstn (n nlyss), n wt- nlyss Prormn tstn W onsr prormn tstn s n w t usr wnts to tst t prormn o on or mor o s ppltons. Ts stuton ours wn vlopn n pplton, wn tstn on or mor systm sn optons. In ll o ts stutons, t usr wnts to nrt t worlo wt s lttl nput s possl, sumt t nrt worlos, n v tl rport on t otn rsults wtn rtn tm-rm. Tl 1 sows t strutur o t tr nrt worlos, n t tl suss rt or runnn tm. W us tr typs o ppltons: ssr (syntt squntl), smp1 (syntt prlll, MPI), n n N Quns solvr (syntt prlll, Is). E nrt worlo ontns on pplton typ, n omprss 1 rnt nstns. For syntt ppltons, w us omntons o prmtrs tt woul p t run-tm o t ppltons unr 3 mnuts, unr optml ontons. For t Is os (worlo s1), 1-2% o t ppltons v svrly unrstmt runtm rqusts; ts orrspons to t stuton wr som usrs svrly unrstmt t runtms o omplx ppltons [14]. E o rqusts rsours or tm low 15 mnuts. T omnton o run-tm n rsour rqust sttns nsurs tt som ppltons woul l u to t usr s own ult. T totl sumsson tm o ny worlo s pt unr two ours, to sow ow GRENCHMARK n us n tm-onstrn tst stuton. To stsy typl r stutons, os rqust rsours or 1 to 15 omponnts. As t DAS s only 5 sts, os wt mor tn 5 omponnts wll v svrl omponnts runnn t t sm st. For prlll os, tr s prrn or 2 n 4 omponnts. For mult-omponnt os tr s prrn or 2, 4, n 16 prossors. Vrous ntr-rrvl tm strutons r us to nrt t sumsson tm o worlo os. Componnt rqusts r tr x (spyn t nm o r st) or nonx (lvn t sulr to ). Tl 2. A summry o tm n run/suss prnts or rnt o typs. Jo Turnroun [s] Runtm [s] Run+ nm Av Rn Av Rn Run Su ssr % 97% smp % 81% NQuns % 85% Tl 3. T rsults or t rst s o wt nlyss. Sumt Jo sz rt vs. #o (# o Sumt Worlo ornl os CPUs) Errors DAS2-FS3-1x 1x % DAS2-FS3-1x 1x % DAS2-FS3-25x 25x % DAS2-FS3-5x 5x % DAS2-FS3-1x 1x % T lowr prormn o prlll os (worlos smp1 n s1) wn ompr to on-prossor os (worlo mr1), s us y t prlll os n to llot rsour sts, s oppos to llotn snl rsours. Is os lso sur rom t smll tm lmt oupl wt nurt stmtons. T turnroun tm o n pplton n vry rtly (s Tl 2), u to rnt prmtr sttns, or to vryn systm lo. T vrtons n t pplton runtms r u to rnt prmtr sttns. As xpt, t prnt o t ppltons tt r tully run (Tl 2, olumn Run) pns vly on t o sz n systm lo. T suss rt o os tt run sows lttl vrton (Tl 2, olumn Run+Suss) Wt- nlyss W onsr tr us ss or llustrtn GRENCH- MARK s plts or wt- nlyss : systm n, r ntr-oprlty, n spl stutons. In t rst two ss w ssum tt t nvronmnts unr srutny v n torouly stu n tr worlos mol. Frst, w onsr t s wr tstn nvronmnt woul pl unr (mu) mor strn. Our tstn nvronmnt, t DAS systm, s tully ot-swpp ts rsour mnr, us t oul not op wt t nrsn numr o o sumssons. T wor o ll t DAS ommunty ws ntvly t or pro o two ws. Su n oul v n prvnt t quston Wt t urrnt usrs woul sumt 1 tms mor os n t sm mount o tm? Or 5 tms, or 1 tms... woul v n nswr t t systm nstllton, or urn qut pro. Furtrmor, t prot sponsorn ts rsr (s Anowlmnts) s s ts Prons o t Sxt IEEE Intrntonl Symposum on Clustr Computn n t Gr (CCGRID'6)

7 Tl 4. T rsults or t son s o wt nlyss. #o Componnt Suss Worlo os no. sz Rt DAS2-FS3 + OSC % DAS2-FS3 + CTC % DAS2-FS3 + SDSC % Systm utlzton [%] Lo on t DAS2 - s4 Totl utlston % G RENCHMARK % Av. Utlston % mn otv mn t DAS nrstrutur sly vll to t Dut ms, n rqurs ts wt- quston to nswr or t nw sttns r rls to t pul. W t torouly stu tr [1] o t DAS systm n r-run t n t nw nvronmnt. T tr ws ror wn t prvous rsour mnr ws stll n pl, n ontns ovr 425, os run trouout 23. To lmt t tstn pro, w onsr only t os sumtt to on o t v DAS lustrs (ovr 65,), lmt t worlos to t most 1 os, n nsur tt t rsultn worlos v sumsson spn o mxmum tr ours. All ts rqurmnts wr mt trou t worlo nton lnu; no tool xtrnl to GRENCH- MARK,.., MySQL, ws us. W lso sl t os sumsson tms to m tm 1, 25, 5, n 1 tms smllr tn t ornl sumsson tms. Tl 3 tls t ltr n sl trs n sows t prnt o t sumt rrors, rom t totl numr o sumtt os. W onlu tt t nw rsour mnmnt systm (nlun KOALA) n nl n up to 1 tms nrs n t sumsson rt, or t usr s rtrz y t nput trs. Son, w onsr t s wr our tstn nvronmnt woul lso us y t usrs o notr nvronmnt n w wnt to n out wt s t suss rt o t os sumtt y ts omn ommunts?. Ts stuton ours wn rom two xstn prouton nvronmnts on nvronmnt s put tmporrly or prmnntly out o prouton, n only on nvronmnt rmns to run t sumssons o os rom ot usr ommunts. For t xtn us s n w two nvronmnts sr tr rsours, sus or t usr to run t nrt worlo on ot systms t t sm tm; or ts purpos, GRENCHMARK llows nrt worlo to urtly rply on rnt systms (vn tos systms r smult). W too t sm tr s n t rst wt- nlyss s, n omn t wt tr o t OSC, t CTC, or t SDSC 96 trs rom t Prlll Worlos Arv (PWA). W slt ust t os wt runtms low 9 sons. W n tr o st s st onsutv os rom tr or w t sumsson ntrvl s 3 ours. To solv t prolm o not sltn t most mnn, nor t lst mnn tr o st, w rst slt t top 1 sts, sort y tr numr o os (sz). Tn, w omput t vr numr o os or t top 2 Sp 1 Sp Tm [s] Fur 5. T utlzton o t DAS s4 lustr or ursty sumssons. 1 sts, n w oos t st wos sz s t losst to ts vr. Tl 4 sows t tl strutur o t nrt worlos, n t suss rt or runnn tm. T osrv suss rt ws ov 7% or ll tsts. W onlu tt t nw DAS (nlun KOALA) n nl t propos omntons o ommunts, wt rsonl suss rt or sumtt os. Tr, w onsr t s wr t usr wnts to tst t outom o t systm n sunly sut to lr numr o sumtt os (ursts). Usn worlos s on syntt ppltons, w nrt two ursts, n or roun lo, lln 25% n 5% o t systm s pty, rsptvly. Durn t tsts, t roun lo nrt y otr usrs ws twn % n 5%. W rstrt our tsts to on o t DAS lustrs (s4). Fur 5 sows t systm utlzton rp urn t pro wn t two urst worlos r sumtt. T systm prorm orrtly unr strn; t mxmum systm utlzton s 95%, o w 9% s nrt y t urst worlos. Two sps n lrly nt on t utlzton rp. As xpt, runnn t rst urst worlo (sp 1) ts lonr, u to t r roun utlzton o t systm. 4.3 Funtonlty tstn n r nvronmnts Ts ston prsnts two ss or sown ow GRENCHMARK n us or untonlty tstn: systm untonlty tstn, n pro systm tstn Systm untonlty tstn W onsr t s wr t usr wnts to tst t systm s plty to rlly run vrous typs o os t t sm tm. W omn t worlos us n t s o prormn tstn n otn mx worlos. Prons o t Sxt IEEE Intrntonl Symposum on Clustr Computn n t Gr (CCGRID'6)

8 Tl 5. T rsults or systm untonlty tstn. Typs o #o Componnt Su Worlo ppltons CPUs no. sz Rt mr+ syntt, sq.&mpi % s+ vrous, Is % untry mr+ & s % Tl 6. Rsults o t omprson o suss rts or snl-st vs. o-llot os. #o Componnt Suss Worlo CPUs no. sz Rt snl-st % ollot % ollot % Tl 5 splys t omposton o t two xprmntl worlos, n t suss rts or tr xuton. T mr+ worlo omprss mx o prlll n squntl syntt ppltons lso us n worlos mr1 n smp1 (s Tl 1). As xpt, t suss rt o mr+ s lowr tn or mr1, ut r tn or smp1. T suss rt lututs wt t numr o smp1 os: t lowr ts numr, t lowr t lur rt (squntl os r mor stl). T sm onsrtons n ppl or t s+ n untry worlos. For t s+ worlo, t suss rt s 15% lowr tn norml u to svr runtm unrstmtons (s lso Ston 4.2.1). W onlu tt t DAS n KOALA n rlly run t GRENCHMARK os Pro systm tstn W onsr s wr t usr wnts to prolly tst systm. Ts typ o tstn lps ntyn systm prolms, or n us or otnn t urrnt prormn o vrous systm omponnts. W sul st o smpl tst worlos or ly sumsson, rom vrous DAS twys. Ts lp to quly nty n solv rtl ploymnt prolm: t onurton l o KOALA on on o t twys ws norrt n us t sumsson tst to l; lt unorrt, usrs sumttn os rom tt twy woul v n unl to sumt som o tr os trou tt twy. 4.4 Comprn r sttns Ts ston prsnts two stutons n w GRENCH- MARK n us or omprn r sttns Snl st vs. o-llot os W onsr omprson twn t suss rts o snl-st n o-llot os n r nvronmnt Tl 7. Comprson o suss rts or untry vs. ompost os wt or wtout xuton ult tolrn. # o Jos/ Suss rt wn ult tolrn s Worlo Su-Jos OFF ON untry 1/1 9% 1% ompost 1/18 7-9% 1% wtout rsrvton plts. W vs tr worlos, on wt snl-st os, on wt t sm os o-llot t vrous sts, n on wt lrr os o-llot t vrous sts. Tl 6 sows t tl strutur n t suss rt or t tr worlos. T worlos omprs only syntt MPI ppltons. T snl-st os (worlo snl-st) v r suss rt tn o-llot os (worlos ollot n ollot+), n ts s y ovr 2%. Ts s u to t tom rsrvton prolms o o-lloton: lol usrs n qur rsours slt or o-lloton ust or ty r lm y t o-llotn sulr. Sn t vr lo n t DAS systm s low (.., low 25% [1]), smll n lr ollot os v lmost t sm suss rt (nou mns r vll) Untry vs. ompost os W onsr omprson twn t suss rt o untry n ompost ppltons n r nvronmnt wtout rsrvton plts, n wt or wtout ult tolrn. W onsr only DAG-s ompost ppltons or w t su-os r untry ppltons. W n o tt n run s o or w ll ts pnns v n mt. Sn KOALA os not support t xuton o ompost os, w ult smpl xuton tool, w xuts os tt n run s soon s possl. T xuton tool lso llows or lxl ult tolrn sms; w us r smpl rtry l mnsm wt su-o rnulrty. For rnt worlow typs, xuton tools, n mnsms, w rr to [15]. Tl 7 sows t suss rt or untry n ompost os, wt or wtout ult tolrn. Wtout ult tolrn, t suss rt o ompost os rops rmtlly t rst su-os n t DAG s topolol sort l. Wt ult tolrn, or systm wt suss rt or os,.., t DAS, t smpl rtry mnsm yls omplt rllty n runnn orrt os. 5 Rlt wor A snnt numr o prots v tr to tl t Gr prormn ssssmnt prolm rom rnt nls: moln worlos n smultn tr run unr vrous nvronmnt ssumptons [14, 6, 4], ttmptn to Prons o t Sxt IEEE Intrntonl Symposum on Clustr Computn n t Gr (CCGRID'6)

9 prou rprsnttv st o r ppltons l t NAS Gr Bnmrs [9], rtn syntt ppltons tt n ssss t sttus o r srvs l t GRASP prot [5], n rtn tools or lunn nmrs n rportn rsults l t GrBn prot [12]. Compr to ts ppros, GRENCHMARK s rnt sn prnpls: () t os not ttmpt to mpos r nmr, only t mns trou w su nmr my ult; () t trs to or lr st o ppltons, vn worlo moln turs, n t lty to rply xstn worlo trs; n () t s n splly ult so tt t n us or mor spts tn ust r prormn vluton (s Ston 4). From t non-r worl, GRENCHMARK rsmls t Ap JMtr [1], worlo nrtor, sumttr, n nlyzr or w n ts ppltons. 6 Conluson n utur wor Ts ppr s prsnt GRENCHMARK, rmwor or syntt r worlos nrton n sumsson. T rmwor supports vrous worlo moln prmtvs, oms wt ovr 35 syntt n rl ppltons, n s portl, lxl, n xtnsl. W v sn n mplmnt GRENCHMARK, n v ploy t n t DAS, our 4-prossors r nvronmnt. W v sown vn tt GRENCHMARK n sussully us or r systm nlyss, untonlty tstn n r nvronmnts, n omprn rnt r sttns. W v prsnt vrous xmpls o ow GRENCHMARK n us or prormn tsts, wt nlyss, systm untonlty tsts, pro systm tsts, snl vs. o-llot os omprson, n untry vs. ompost os omprson. W v sown ow ts tsts n xtn or rnt ols tn tos o ts ppr,.., otr prormn mtrs n otr typs o tsts. Lst, ut rtnly not lst, GRENCHMARK ws nstrumntl n mn t KOALA r sulr rll on t DAS, n rlsn t or t DAS usr ommunty. W r urrntly xtnn GRENCHMARK wt support or mlll os. For t utur, w pln to us GRENCH- MARK or tstn n omprn mor r sttns, ot n smultons n rl stutons. Avllty T ol GRENCHMARK w st, nlun oumntton n rly vll struton, s lot t: ttp://rnmr.st.w.tult.nl/. Anowlmnts Ts wor ws rr out n t ontxt o t Vrtul Lortory or -Sn prot ( w s support y BSIK rnt rom t Dut Mnstry o Euton, Cultur n Sn (OC&W), n w s prt o t ICT nnovton prorm o t Dut Mnstry o Eonom Ars (EZ). Rrns [1] Ap Dvlopmnt Tm. Ap JMtr. URL ttp://rt.p.or/mtr/, 26. [2] H. E. Bl t l. T strut ASCI supromputr prot. Oprtn Systms Rvw, 34(4):76 96, Otor 2. [3] F. Brmn, A. Hy, n G. Fox. Gr Computn: Mn T Glol Inrstrutur Rlty. Wly Pulsn Hous, 23. [4] A. I. D. Buur n D. H. J. Epm. Tr-s smultons o prossor o-lloton pols n multlustrs. In Pro. o t 12t IEEE HPDC, ps 7 79, 23. [5] G. Cun, H. Dl, H. Csnov, n A. Snvly. Bnmr pros or r ssssmnt. In IPDPS, 24. [6] C. Ernmnn, V. Hmsr, U. Swlson, R. Yypour, n A. Strt. On vnts o r omputn or prlll o suln. In CCGRID, ps 39 49, 22. [7] C. Ernmnn, B. Son, n R. Yypour. Sln o worlo trs. In D. G. Ftlson, L. Ruolp, n U. Swlson, tors, JSSPP, volum 2862 o LNCS, ps Sprnr, 23. [8] D. G. Ftlson n L. Ruolp. Mtrs n nmrn or prlll o suln. In D. G. Ftlson n L. Ruolp, tors, JSSPP, volum 1459 o LNCS, ps Sprnr, [9] M. Frumn n R. F. V. r Wnrt. Ns r nmrs: A tool or r sp xplorton. Clustr Computn, 5(3): , 22. [1] H. L, D. Grop, n L. Woltrs. Worlo rtrsts o mult-lustr supromputr. In D. G. Ftlson, L. Ruolp, n U. Swlson, tors, JSSPP, LNCS, vol.3277, ps Sprnr, 24. [11] H. Mom n D. Epm. Exprns wt t ol o-llotn sulr n multlustrs. In Pro. o t 5t IEEE/ACM Int l Symp. on Clustr Computn n t GRID (CCGr25), My 25. [12] G. Tsouloups n M. D. Dos. GrBn: A worn or r nmrn. In P. M. A. Sloot, A. G. Hostr, T. Prol, A. Rnl, n M. Bu, tors, EGC, volum 347 o LNCS, ps Sprnr, 25. [13] R. V. vn Nuwpoort, J. Mssn, G. Wrzsns, R. Homn, C. Jos, T. Klmnn, n H. E. Bl. Is: lxl n nt v-s r prormmn nvronmnt. Conurrny & Computton: Prt & Exprn., 17(7-8): , Jun-July 25. [14] A. M. Wl n D. G. Ftlson. Utlzton, prtlty, worlos, n usr runtm stmts n suln t IBM SP2 wt lln. IEEE Trns. Prlll Dstr. Syst., 12(6): , 21. [15] J. Yu n R. Buyy. A txonomy o snt worlow systms or r omputn. ACM SIGMOD R., 34(3):44 49, 25. Prons o t Sxt IEEE Intrntonl Symposum on Clustr Computn n t Gr (CCGRID'6)

Delft University of Technology Parallel and Distributed Systems Report Series. GrenchMark: A Framework for Analyzing, Testing, and Comparing Grids

Delft University of Technology Parallel and Distributed Systems Report Series. GrenchMark: A Framework for Analyzing, Testing, and Comparing Grids Dlt Unvrsty o Tnoloy Prlll n Dstrut Systms Rport Srs GrnMr: A Frmwor or Anlyzn, Tstn, n Comprn Grs A. Iosup n D.H.J. Epm {A.Iosup,D.H.J.Epm}@w.tult.nl rport numr PDS-2005-007 PDS ISSN 1387-2109 Puls n

More information

5/1/2018. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees

5/1/2018. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees /1/018 W usully no strns y ssnn -lnt os to ll rtrs n t lpt (or mpl, 8-t on n ASCII). Howvr, rnt rtrs our wt rnt rquns, w n sv mmory n ru trnsmttl tm y usn vrl-lnt non. T s to ssn sortr os to rtrs tt our

More information

Lecture 20: Minimum Spanning Trees (CLRS 23)

Lecture 20: Minimum Spanning Trees (CLRS 23) Ltur 0: Mnmum Spnnn Trs (CLRS 3) Jun, 00 Grps Lst tm w n (wt) rps (unrt/rt) n ntrou s rp voulry (vrtx,, r, pt, onnt omponnts,... ) W lso suss jny lst n jny mtrx rprsntton W wll us jny lst rprsntton unlss

More information

Weighted Graphs. Weighted graphs may be either directed or undirected.

Weighted Graphs. Weighted graphs may be either directed or undirected. 1 In mny ppltons, o rp s n ssot numrl vlu, ll wt. Usully, t wts r nonntv ntrs. Wt rps my tr rt or unrt. T wt o n s otn rrr to s t "ost" o t. In ppltons, t wt my msur o t lnt o rout, t pty o ln, t nry rqur

More information

The University of Sydney MATH 2009

The University of Sydney MATH 2009 T Unvrsty o Syny MATH 2009 APH THEOY Tutorl 7 Solutons 2004 1. Lt t sonnt plnr rp sown. Drw ts ul, n t ul o t ul ( ). Sow tt s sonnt plnr rp, tn s onnt. Du tt ( ) s not somorp to. ( ) A onnt rp s on n

More information

In which direction do compass needles always align? Why?

In which direction do compass needles always align? Why? AQA Trloy Unt 6.7 Mntsm n Eltromntsm - Hr 1 Complt t p ll: Mnt or s typ o or n t s stronst t t o t mnt. Tr r two typs o mnt pol: n. Wrt wt woul ppn twn t pols n o t mnt ntrtons low: Drw t mnt l lns on

More information

Depth First Search. Yufei Tao. Department of Computer Science and Engineering Chinese University of Hong Kong

Depth First Search. Yufei Tao. Department of Computer Science and Engineering Chinese University of Hong Kong Dprtmnt o Computr Sn n Ennrn Cns Unvrsty o Hon Kon W v lry lrn rt rst sr (BFS). Toy, w wll suss ts sstr vrson : t pt rst sr (DFS) lortm. Our susson wll on n ous on rt rps, us t xtnson to unrt rps s strtorwr.

More information

CMSC 451: Lecture 4 Bridges and 2-Edge Connectivity Thursday, Sep 7, 2017

CMSC 451: Lecture 4 Bridges and 2-Edge Connectivity Thursday, Sep 7, 2017 Rn: Not ovr n or rns. CMSC 451: Ltr 4 Brs n 2-E Conntvty Trsy, Sp 7, 2017 Hr-Orr Grp Conntvty: (T ollown mtrl ppls only to nrt rps!) Lt G = (V, E) n onnt nrt rp. W otn ssm tt or rps r onnt, t somtms t

More information

Spanning Trees. BFS, DFS spanning tree Minimum spanning tree. March 28, 2018 Cinda Heeren / Geoffrey Tien 1

Spanning Trees. BFS, DFS spanning tree Minimum spanning tree. March 28, 2018 Cinda Heeren / Geoffrey Tien 1 Spnnn Trs BFS, DFS spnnn tr Mnmum spnnn tr Mr 28, 2018 Cn Hrn / Gory Tn 1 Dpt-rst sr Vsts vrts lon snl pt s r s t n o, n tn ktrks to t rst junton n rsums own notr pt Mr 28, 2018 Cn Hrn / Gory Tn 2 Dpt-rst

More information

Divided. diamonds. Mimic the look of facets in a bracelet that s deceptively deep RIGHT-ANGLE WEAVE. designed by Peggy Brinkman Matteliano

Divided. diamonds. Mimic the look of facets in a bracelet that s deceptively deep RIGHT-ANGLE WEAVE. designed by Peggy Brinkman Matteliano RIGHT-ANGLE WEAVE Dv mons Mm t look o ts n rlt tt s ptvly p sn y Py Brnkmn Mttlno Dv your mons nto trnls o two or our olors. FCT-SCON0216_BNB66 2012 Klm Pulsn Co. Ts mtrl my not rprou n ny orm wtout prmsson

More information

4.1 Interval Scheduling. Chapter 4. Greedy Algorithms. Interval Scheduling: Greedy Algorithms. Interval Scheduling. Interval scheduling.

4.1 Interval Scheduling. Chapter 4. Greedy Algorithms. Interval Scheduling: Greedy Algorithms. Interval Scheduling. Interval scheduling. Cptr 4 4 Intrvl Suln Gry Alortms Sls y Kvn Wyn Copyrt 005 Prson-Ason Wsly All rts rsrv Intrvl Suln Intrvl Suln: Gry Alortms Intrvl suln! Jo strts t s n nss t! Two os omptl ty on't ovrlp! Gol: n mxmum sust

More information

Improving Union. Implementation. Union-by-size Code. Union-by-Size Find Analysis. Path Compression! Improving Find find(e)

Improving Union. Implementation. Union-by-size Code. Union-by-Size Find Analysis. Path Compression! Improving Find find(e) POW CSE 36: Dt Struturs Top #10 T Dynm (Equvln) Duo: Unon-y-Sz & Pt Comprsson Wk!! Luk MDowll Summr Qurtr 003 M! ZING Wt s Goo Mz? Mz Construton lortm Gvn: ollton o rooms V Conntons twn t rooms (ntlly

More information

Closed Monochromatic Bishops Tours

Closed Monochromatic Bishops Tours Cos Monoromt Bsops Tours Jo DMo Dprtmnt o Mtmts n Sttsts Knnsw Stt Unvrsty, Knnsw, Gor, 0, USA mo@nnsw.u My, 00 Astrt In ss, t sop s unqu s t s o to sn oor on t n wt or. Ts ms os tour n w t sop vsts vry

More information

Having a glimpse of some of the possibilities for solutions of linear systems, we move to methods of finding these solutions. The basic idea we shall

Having a glimpse of some of the possibilities for solutions of linear systems, we move to methods of finding these solutions. The basic idea we shall Hvn lps o so o t posslts or solutons o lnr systs, w ov to tos o nn ts solutons. T s w sll us s to try to sply t syst y lntn so o t vrls n so ts qutons. Tus, w rr to t to s lnton. T prry oprton nvolv s

More information

The R-Tree. Yufei Tao. ITEE University of Queensland. INFS4205/7205, Uni of Queensland

The R-Tree. Yufei Tao. ITEE University of Queensland. INFS4205/7205, Uni of Queensland Yu To ITEE Unvrsty o Qunsln W wll stuy nw strutur ll t R-tr, w n tout o s mult-mnsonl xtnson o t B-tr. T R-tr supports ntly vrty o qurs (s w wll n out ltr n t ours), n s mplmnt n numrous ts systms. Our

More information

CMPS 2200 Fall Graphs. Carola Wenk. Slides courtesy of Charles Leiserson with changes and additions by Carola Wenk

CMPS 2200 Fall Graphs. Carola Wenk. Slides courtesy of Charles Leiserson with changes and additions by Carola Wenk CMPS 2200 Fll 2017 Grps Crol Wnk Sls ourtsy o Crls Lsrson wt ns n tons y Crol Wnk 10/23/17 CMPS 2200 Intro. to Alortms 1 Grps Dnton. A rt rp (rp) G = (V, E) s n orr pr onsstn o st V o vrts (snulr: vrtx),

More information

Platform Controls. 1-1 Joystick Controllers. Boom Up/Down Controller Adjustments

Platform Controls. 1-1 Joystick Controllers. Boom Up/Down Controller Adjustments Ston 7 - Rpr Prours Srv Mnul - Son Eton Pltorm Controls 1-1 Joystk Controllrs Mntnn oystk ontrollrs t t propr sttns s ssntl to s mn oprton. Evry oystk ontrollr soul oprt smootly n prov proportonl sp ontrol

More information

Minimum Spanning Trees (CLRS 23)

Minimum Spanning Trees (CLRS 23) Mnmum Spnnn Trs (CLRS 3) T prolm Rll t nton o spnnn tr: Gvn onnt, unrt rp G = (V, E), sust o s o G su tt ty onnt ll vrts n G n orm no yls s ll spnnn tr (ST) o G. Any unrt, onnt rp s spnnn tr. Atully, rp

More information

(Minimum) Spanning Trees

(Minimum) Spanning Trees (Mnmum) Spnnn Trs Spnnn trs Kruskl's lortm Novmr 23, 2017 Cn Hrn / Gory Tn 1 Spnnn trs Gvn G = V, E, spnnn tr o G s onnt surp o G wt xtly V 1 s mnml sust o s tt onnts ll t vrts o G G = Spnnn trs Novmr

More information

Exam 2 Solutions. Jonathan Turner 4/2/2012. CS 542 Advanced Data Structures and Algorithms

Exam 2 Solutions. Jonathan Turner 4/2/2012. CS 542 Advanced Data Structures and Algorithms CS 542 Avn Dt Stutu n Alotm Exm 2 Soluton Jontn Tun 4/2/202. (5 ont) Con n oton on t tton t tutu n w t n t 2 no. Wt t mllt num o no tt t tton t tutu oul ontn. Exln you nw. Sn n mut n you o u t n t, t n

More information

The Constrained Longest Common Subsequence Problem. Rotem.R and Rotem.H

The Constrained Longest Common Subsequence Problem. Rotem.R and Rotem.H T Constrn Lonst Common Susqun Prolm Rotm.R n Rotm.H Prsntton Outln. LCS Alortm Rmnr Uss o LCS Alortm T CLCS Prolm Introuton Motvton For CLCS Alortm T CLCS Prolm Nïv Alortm T CLCS Alortm A Dynm Prormmn

More information

Lecture II: Minimium Spanning Tree Algorithms

Lecture II: Minimium Spanning Tree Algorithms Ltur II: Mnmum Spnnn Tr Alortms Dr Krn T. Hrly Dprtmnt o Computr Sn Unvrsty Coll Cork Aprl 0 KH (/0/) Ltur II: Mnmum Spnnn Tr Alortms Aprl 0 / 5 Mnmum Spnnn Trs Mnmum Spnnn Trs Spnnn Tr tr orm rom rp s

More information

MINI POST SERIES BALUSTRADE SYSTEM INSTALLATION GUIDE PRODUCT CODE: MPS-RP

MINI POST SERIES BALUSTRADE SYSTEM INSTALLATION GUIDE PRODUCT CODE: MPS-RP MN POST SRS LUSTR SYSTM NSTLLTON U PROUT O: MPS-RP 0 R0 WLL LN 0 RONT LVTON VW R0 N P 0 T RUR LOK LOT ON LSS. SLON SL TYP. OT SS 000 LSS T 0 00 SRS LSS WT 00/00 (0mm NRMNTS VLL) MX. 000 00-0 (ROMMN) 00

More information

MATERIAL SEE BOM ANGLES = 2 FINISH N/A

MATERIAL SEE BOM ANGLES = 2 FINISH N/A 9 NOTS:. SSML N NSPT PR SOP 0-9... NSTLL K STKR N X L STKR TO NS O SROU WT TP. 3. PR-PK LNR RNS WT P (XTRM PRSSUR NL R ) RS OR NNRN PPROV QUVLNT. 4. OLOR TT Y T SLS ORR. RRN T MNS OM OR OMPONNTS ONTNN

More information

Isomorphism In Kinematic Chains

Isomorphism In Kinematic Chains Intrntonl Journl o Rsr n Ennrn n Sn (IJRES) ISSN (Onln): 0-, ISSN (Prnt): 0- www.rs.or Volum Issu ǁ My. 0 ǁ PP.0- Isomorpsm In Knmt Cns Dr.Al Hsn Asstt.Prossor, Dprtmnt o Mnl Ennrn, F/O- Ennrn & Tnoloy,

More information

COMP 250. Lecture 29. graph traversal. Nov. 15/16, 2017

COMP 250. Lecture 29. graph traversal. Nov. 15/16, 2017 COMP 250 Ltur 29 rp trvrsl Nov. 15/16, 2017 1 Toy Rursv rp trvrsl pt rst Non-rursv rp trvrsl pt rst rt rst 2 Hs up! Tr wr w mstks n t sls or S. 001 or toy s ltur. So you r ollown t ltur rorns n usn ts

More information

An Application to Search for High-Priority War Opponent in Spatial Games Using Dynamic Skyline Query

An Application to Search for High-Priority War Opponent in Spatial Games Using Dynamic Skyline Query Intrntonl Journl o Appl Ennrn Rsr ISSN 973-4562 Volum 13, Numr 2 (218) pp. 1496-15 An Applton to Sr or H-Prorty Wr Opponnt n Sptl Gms Usn Qury Jonwn Km Smt Lrl Arts Coll, Smyook Unvrsty, 815 Hwrn-ro, Nowon-u,

More information

DOCUMENT STATUS: RELEASE

DOCUMENT STATUS: RELEASE RVSON STORY RV T SRPTON O Y 0-4-0 RLS OR PROUTON 5 MM -04-0 NS TRU PLOT PROUTON -- S O O OR TLS 30 MM 03-3-0 3-044 N 3-45, TS S T TON O PROTTV RM OVR. 3 05--0 LT 3-004, NOT, 3-050 3 0//00 UPT ST ROM SN,

More information

Graph Search (6A) Young Won Lim 5/18/18

Graph Search (6A) Young Won Lim 5/18/18 Grp Sr (6A) Youn Won Lm Copyrt () 2015 2018 Youn W. Lm. Prmon rnt to opy, trut n/or moy t oumnt unr t trm o t GNU Fr Doumntton Ln, Vron 1.2 or ny ltr vron pul y t Fr Sotwr Founton; wt no Invrnt Ston, no

More information

d e c b a d c b a d e c b a a c a d c c e b

d e c b a d c b a d e c b a a c a d c c e b FLAT PEYOTE STITCH Bin y mkin stoppr -- sw trou n pull it lon t tr until it is out 6 rom t n. Sw trou t in witout splittin t tr. You soul l to sli it up n own t tr ut it will sty in pl wn lt lon. Evn-Count

More information

PRECAST APPROACH SLAB NOTES

PRECAST APPROACH SLAB NOTES ULNS TS ULN RWNS RPRSNT TYPL TLS OR T SN N TLN O PRST PPRO SLS. TS STS R NLU TO PROV N XMPL O T RTN LYOUT O TYPL PRST PPRO SL. TWO RNT PPRO SL SYSTMS R SOWN: SUR PPRO SLS: SLS TT R PL WT T TOP SUR T OR

More information

CSE 332. Data Structures and Parallelism

CSE 332. Data Structures and Parallelism Am Blnk Ltur 20 Wntr 2017 CSE 332 Dt Struturs n Prlllsm CSE 332: Dt Struturs n Prlllsm Grps 1: Wt s Grp? DFS n BFS LnkLsts r to Trs s Trs r to... 1 Wr W v Bn Essntl ADTs: Lsts, Stks, Quus, Prorty Quus,

More information

CSE 332. Graphs 1: What is a Graph? DFS and BFS. Data Abstractions. CSE 332: Data Abstractions. A Graph is a Thingy... 2

CSE 332. Graphs 1: What is a Graph? DFS and BFS. Data Abstractions. CSE 332: Data Abstractions. A Graph is a Thingy... 2 Am Blnk Ltur 19 Summr 2015 CSE 332: Dt Astrtons CSE 332 Grps 1: Wt s Grp? DFS n BFS Dt Astrtons LnkLsts r to Trs s Trs r to... 1 A Grp s Tny... 2 Wr W v Bn Essntl ADTs: Lsts, Stks, Quus, Prorty Quus, Hps,

More information

16.unified Introduction to Computers and Programming. SOLUTIONS to Examination 4/30/04 9:05am - 10:00am

16.unified Introduction to Computers and Programming. SOLUTIONS to Examination 4/30/04 9:05am - 10:00am 16.unii Introution to Computrs n Prormmin SOLUTIONS to Exmintion /30/0 9:05m - 10:00m Pro. I. Kristin Lunqvist Sprin 00 Grin Stion: Qustion 1 (5) Qustion (15) Qustion 3 (10) Qustion (35) Qustion 5 (10)

More information

SAMPLE CSc 340 EXAM QUESTIONS WITH SOLUTIONS: part 2

SAMPLE CSc 340 EXAM QUESTIONS WITH SOLUTIONS: part 2 AMPLE C EXAM UETION WITH OLUTION: prt. It n sown tt l / wr.7888l. I Φ nots orul or pprotng t vlu o tn t n sown tt t trunton rror o ts pproton s o t or or so onstnts ; tt s Not tt / L Φ L.. Φ.. /. /.. Φ..787.

More information

Strongly connected components. Finding strongly-connected components

Strongly connected components. Finding strongly-connected components Stronly onnt omponnts Fnn stronly-onnt omponnts Tylr Moor stronly onnt omponnt s t mxml sust o rp wt rt pt twn ny two vrts SE 3353, SMU, Dlls, TX Ltur 9 Som sls rt y or pt rom Dr. Kvn Wyn. For mor normton

More information

DOCUMENT STATUS: MINTP0 E-ST5080, BASE, NO DISPLAY VENDOR: 15.5 INCH MATERIAL SEE BOM FINISH REVISION HISTORY ITEM NO. PART NUMBER DESCRIPTION

DOCUMENT STATUS: MINTP0 E-ST5080, BASE, NO DISPLAY VENDOR: 15.5 INCH MATERIAL SEE BOM FINISH REVISION HISTORY ITEM NO. PART NUMBER DESCRIPTION RV T RVSON STORY SRPTON O Y 0-0-0 PROUTON RLS K. N NOTS:. SRL LL NORMTON: a) VOLTS: V b) MPS:.0 c) YLS: N/ d) WTTS: W e) PS: N/ f) PX #: PX. RTTON LOOS: S / / LN R WT SOPROPYL LOLOL PROR TO PLN.. PK M:

More information

Minimum Spanning Trees (CLRS 23)

Minimum Spanning Trees (CLRS 23) Mnmum Spnnn Trs (CLRS 3) T prolm Gvn onnt, unrt rp G = (V, E), sust o s o G su tt ty onnt ll vrts n G n orm no yls s ll spnnn tr (ST) o G. Clm: Any unrt, onnt rp s spnnn tr (n nrl rp my v mny spnnn trs).

More information

Dental PBRN Study: Reasons for replacement or repair of dental restorations

Dental PBRN Study: Reasons for replacement or repair of dental restorations Dntl PBRN Stuy: Rsons or rplmnt or rpr o ntl rstortons Us ts Dt Collton Form wnvr stuy rstorton s rpl or rpr. For nrollmnt n t ollton you my rpl or rpr up to 4 rstortons, on t sm ptnt, urn snl vst. You

More information

Theorem 1. An undirected graph is a tree if and only if there is a unique simple path between any two of its vertices.

Theorem 1. An undirected graph is a tree if and only if there is a unique simple path between any two of its vertices. Cptr 11: Trs 11.1 - Introuton to Trs Dnton 1 (Tr). A tr s onnt unrt rp wt no sp ruts. Tor 1. An unrt rp s tr n ony tr s unqu sp pt twn ny two o ts vrts. Dnton 2. A root tr s tr n w on vrtx s n snt s t

More information

A Scalable Double In-memory Checkpoint and Restart Scheme towards Exascale

A Scalable Double In-memory Checkpoint and Restart Scheme towards Exascale A Sll Doul In-mmory Ckpont n Rstrt Sm towrs Exsl Gnn Zn, Xn N, Lxmknt V. Klé Dprtmnt o Computr Sn Unvrsty o Illnos t Urn-Cmpn Urn, IL 6181, USA E-ml: {zn, xnn2, kl}@llnos.u Astrt As t sz o supromputrs

More information

Face Detection and Recognition. Linear Algebra and Face Recognition. Face Recognition. Face Recognition. Dimension reduction

Face Detection and Recognition. Linear Algebra and Face Recognition. Face Recognition. Face Recognition. Dimension reduction F Dtto Roto Lr Alr F Roto C Y I Ursty O solto: tto o l trs s s ys os ot. Dlt to t to ltpl ws. F Roto Aotr ppro: ort y rry s tor o so E.. 56 56 > pot 6556- stol sp A st o s t ps to ollto o pots ts sp. F

More information

CSE 332. Graphs 1: What is a Graph? DFS and BFS. Data Abstractions. CSE 332: Data Abstractions. A Graph is a Thingy... 2

CSE 332. Graphs 1: What is a Graph? DFS and BFS. Data Abstractions. CSE 332: Data Abstractions. A Graph is a Thingy... 2 Am Blnk Ltur 0 Autumn 0 CSE 33: Dt Astrtons CSE 33 Grps : Wt s Grp? DFS n BFS Dt Astrtons LnkLsts r to Trs s Trs r to... A Grp s Tny... Wr W v Bn Essntl ADTs: Lsts, Stks, Quus, Prorty Quus, Hps, Vnll Trs,

More information

Priority Search Trees - Part I

Priority Search Trees - Part I .S. 252 Pro. Rorto Taassa oputatoal otry S., 1992 1993 Ltur 9 at: ar 8, 1993 Sr: a Q ol aro Prorty Sar Trs - Part 1 trouto t last ltur, w loo at trval trs. or trval pot losur prols, ty us lar spa a optal

More information

CS September 2018

CS September 2018 Loil los Distriut Systms 06. Loil los Assin squn numrs to msss All ooprtin prosss n r on orr o vnts vs. physil los: rport tim o y Assum no ntrl tim sour Eh systm mintins its own lol lo No totl orrin o

More information

Distributed Memory Allocation Technique for Synchronous Dataflow Graphs

Distributed Memory Allocation Technique for Synchronous Dataflow Graphs Dstrut Mmory Alloton Tnqu or Synronous Dtlow Grps Krol Dsnos, Mxm Plt, Jn-Frnços Nzn, Sln Ar To t ts vrson: Krol Dsnos, Mxm Plt, Jn-Frnços Nzn, Sln Ar. Dstrut Mmory Alloton Tnqu or Synronous Dtlow Grps.

More information

Distributed Caching of Multi-dimensional Data in Mobile Environments

Distributed Caching of Multi-dimensional Data in Mobile Environments Dstrut Cn o Mut-mnson Dt n Mo Envronmnts Bn Lu Wn-Cn L D Lun L Dprtmnt o Computr Sn Hon Kon Unvrst o Sn n Tnoo Crwtr B, Hon Kon {un, }@s.ust. Dprtmnt o Computr Sn n Ennrn Pnnsvn Stt Unvrst Unvrst Pr, PA

More information

Telecommunications 1-1/4" RACEWAY WITH DOUBLE-GANG ADAPTER PLATE AND A/V CABLING.

Telecommunications 1-1/4 RACEWAY WITH DOUBLE-GANG ADAPTER PLATE AND A/V CABLING. 2 3 2 TNOOY SYMO ST NR TNOOY NOTS: NOT: This is a standard symbol list and not all items listed may be used. bbreviations () XSTN OV NS OOR NMW - UNRROUN ONUT T TORY ONTRTOR URNS ONTRTOR NST O ONTRTOR

More information

(4, 2)-choosability of planar graphs with forbidden structures

(4, 2)-choosability of planar graphs with forbidden structures (4, )-ooslty o plnr rps wt orn struturs Znr Brkkyzy 1 Crstopr Cox Ml Dryko 1 Krstn Honson 1 Mot Kumt 1 Brnr Lký 1, Ky Mssrsmt 1 Kvn Moss 1 Ktln Nowk 1 Kvn F. Plmowsk 1 Drrk Stol 1,4 Dmr 11, 015 Astrt All

More information

DOCUMENT STATUS: LA-S5302-XXXXS LA, SSS, TRICEPS EXTENSION VERY

DOCUMENT STATUS: LA-S5302-XXXXS LA, SSS, TRICEPS EXTENSION VERY RVSON STORY RV T SRPTON O Y //0 RLS OR PROUTON T LN MR ----- L /0/0 UPT SN N OMPONNTS US: S 3-03 (*N TWO PLS ONLY) WS 3-5, PRT 3-00 TO SSMLY. T OLLOWN UPT: 3-30, 3-403, 3-403, 3-40, 3-45, 3-4, 3-5. 30

More information

L.3922 M.C. L.3922 M.C. L.2996 M.C. L.3909 M.C. L.5632 M.C. L M.C. L.5632 M.C. L M.C. DRIVE STAR NORTH STAR NORTH NORTH DRIVE

L.3922 M.C. L.3922 M.C. L.2996 M.C. L.3909 M.C. L.5632 M.C. L M.C. L.5632 M.C. L M.C. DRIVE STAR NORTH STAR NORTH NORTH DRIVE N URY T NORTON PROV N RRONOUS NORTON NVRTNTY PROV. SPY S NY TY OR UT T TY RY OS NOT URNT T S TT T NORTON PROV S ORRT, NSR S POSS, VRY ORT S N ON N T S T TY RY. TS NORTON S N OP RO RORS RT SU "" YW No.

More information

Planar convex hulls (I)

Planar convex hulls (I) Covx Hu Covxty Gv st P o ots 2D, tr ovx u s t sst ovx oyo tt ots ots o P A oyo P s ovx or y, P, t st s try P. Pr ovx us (I) Coutto Gotry [s 3250] Lur To Bowo Co ovx o-ovx 1 2 3 Covx Hu Covx Hu Covx Hu

More information

Single Source Shortest Paths (with Positive Weights)

Single Source Shortest Paths (with Positive Weights) Snl Sour Sortst Pts (wt Postv Wts) Yuf To ITEE Unvrsty of Qunslnd In ts ltur, w wll rvst t snl sour sortst pt (SSSP) problm. Rll tt w v lrdy lrnd tt t BFS lortm solvs t problm ffntly wn ll t ds v t sm

More information

On Hamiltonian Tetrahedralizations Of Convex Polyhedra

On Hamiltonian Tetrahedralizations Of Convex Polyhedra O Ht Ttrrzts O Cvx Pyr Frs C 1 Q-Hu D 2 C A W 3 1 Dprtt Cputr S T Uvrsty H K, H K, C. E: @s.u. 2 R & TV Trsss Ctr, Hu, C. E: q@163.t 3 Dprtt Cputr S, Mr Uvrsty Nwu St. J s, Nwu, C A1B 35. E: w@r.s.u. Astrt

More information

Sheet Title: Building Renderings M. AS SHOWN Status: A.R.H.P.B. SUBMITTAL August 9, :07 pm

Sheet Title: Building Renderings M. AS SHOWN Status: A.R.H.P.B. SUBMITTAL August 9, :07 pm 1 2 3 4 5 6 7 8 9 1 11 12 13 14 15 16 17 18 19 orthstar expressly reserves its common law copyright and other property rights for all ideas, provisions and plans represented or indicated by these drawings,

More information

, each of which is a tree, and whose roots r 1. , respectively, are children of r. Data Structures & File Management

, each of which is a tree, and whose roots r 1. , respectively, are children of r. Data Structures & File Management nrl tr T is init st o on or mor nos suh tht thr is on sint no r, ll th root o T, n th rminin nos r prtition into n isjoint susts T, T,, T n, h o whih is tr, n whos roots r, r,, r n, rsptivly, r hilrn o

More information

Power-Aware Scheduling under Timing Constraints for Mission-Critical Embedded Systems

Power-Aware Scheduling under Timing Constraints for Mission-Critical Embedded Systems owr-wr Suln unr Tmn onstrnts or Msson-rtl Em Systms Jnn Lu, H. ou, Nr rz, F Kur Dpt. o Eltrl & omputr Ennrn Unvrsty o lorn Irvn, 92697-262 US jnnl, ou, nr, kur@.u.u Dpt. o Eltrl & omputr Ennrn Unvrsty

More information

Designing A Concrete Arch Bridge

Designing A Concrete Arch Bridge This is th mous Shwnh ri in Switzrln, sin y Rort Millrt in 1933. It spns 37.4 mtrs (122 t) n ws sin usin th sm rphil mths tht will monstrt in this lsson. To pro with this lsson, lik on th Nxt utton hr

More information

Math 166 Week in Review 2 Sections 1.1b, 1.2, 1.3, & 1.4

Math 166 Week in Review 2 Sections 1.1b, 1.2, 1.3, & 1.4 Mt 166 WIR, Sprin 2012, Bnjmin urisp Mt 166 Wk in Rviw 2 Stions 1.1, 1.2, 1.3, & 1.4 1. S t pproprit rions in Vnn irm tt orrspon to o t ollowin sts. () (B ) B () ( ) B B () (B ) B 1 Mt 166 WIR, Sprin 2012,

More information

MATERIAL SEE BOM ANGLES = 2 > 2000 DATE MEDIUM FINISH

MATERIAL SEE BOM ANGLES = 2 > 2000 DATE MEDIUM FINISH NOTS:. LN MTN SUR WT NTUR/SOPROPYL LOOL PROR TO RN L OR LOO. PPLY LOTT 4 ON TRS. TORQU TO. Nm / 00 lb-in 4. TORQU TO 45-50 Nm / - lb-ft 5. TORQU TO Nm / 4.5 lb-ft. TORQU TO 0 Nm / lb-in. TORQU TO 5.5 Nm

More information

B ADDED BADGE PN , CHANGED TO C SIZE FOR ASSY, ADDED NOTES DN J DETAIL A SCALE 1 : INCH MATERIAL

B ADDED BADGE PN , CHANGED TO C SIZE FOR ASSY, ADDED NOTES DN J DETAIL A SCALE 1 : INCH MATERIAL 0 RVSONS RV. T SRPTON O Y 0--0 PROUTON RLS N 0--0 PN 00-0, N TO SZ OR SSY, NOTS N TL SL :. N TM NO. PRT NUMR SRPTON QTY. NOT 00-0, PROUT, P-ST 0 NOTS:. SRL LL NORMTON: a) VOLTS: V b) MPS:.0 c) YLS: N/

More information

Grade 7/8 Math Circles March 4/5, Graph Theory I- Solutions

Grade 7/8 Math Circles March 4/5, Graph Theory I- Solutions ulty o Mtmtis Wtrloo, Ontrio N ntr or ution in Mtmtis n omputin r / Mt irls Mr /, 0 rp Tory - Solutions * inits lln qustion. Tr t ollowin wlks on t rp low. or on, stt wtr it is pt? ow o you know? () n

More information

New Biomaterials from Renewable Resources - Amphiphilic Block Copolymers from δ-decalactone. Figure S4 DSC plot of Propargyl PDL...

New Biomaterials from Renewable Resources - Amphiphilic Block Copolymers from δ-decalactone. Figure S4 DSC plot of Propargyl PDL... Eltron Supplmntry Mtrl (ESI) or Polymr Cmstry. Ts ournl s T Royl Soty o Cmstry 2015 Polymr Cmstry RSCPulsng Supportng Inormton Nw Bomtrls rom Rnwl Rsours - Amppl Blo Copolymrs rom δ-dlton Kulp K. Bnsl,

More information

DOCUMENT STATUS: CORE HEALTH & FITNESS, LLC IL-D2002-XXAAX IP,DUAL ADJUSTIBLE PULLEY MATERIAL SEE BOM FINISH N/A N/A SHEET SIZE: B SCALE: 1:33.

DOCUMENT STATUS: CORE HEALTH & FITNESS, LLC IL-D2002-XXAAX IP,DUAL ADJUSTIBLE PULLEY MATERIAL SEE BOM FINISH N/A N/A SHEET SIZE: B SCALE: 1:33. NOTS: RVSON STORY RV T SRPTON O Y //04 RLS OR PROUTON 433 P 34 55 033 OUMNT STTUS: NOT O PROPRTRY NORMTON TS OUMNT SLL NOT RPROU NOR SLL T NORMTON ONTN RN US Y OR SLOS TO OTR XPT S XPRSSLY UTORZ Y OR LT

More information

A Simple Method for Identifying Compelled Edges in DAGs

A Simple Method for Identifying Compelled Edges in DAGs A Smpl Mto or Intyn Compll Es n DAGs S.K.M. Won n D. Wu Dprtmnt o Computr Sn Unvrsty o Rn Rn Ssktwn Cn S4S 0A2 Eml: {won, nwu}@s.urn. Astrt Intyn ompll s s mportnt n lrnn t strutur (.., t DAG) o Bysn ntwork.

More information

Applications of trees

Applications of trees Trs Apptons o trs Orgnzton rts Attk trs to syst Anyss o tr ntworks Prsng xprssons Trs (rtrv o norton) Don-n strutur Mutstng Dstnton-s orwrng Trnsprnt swts Forwrng ts o prxs t routrs Struturs or nt pntton

More information

Problem solving by search

Problem solving by search Prolm solving y srh Tomáš voo Dprtmnt o Cyrntis, Vision or Roots n Autonomous ystms Mrh 5, 208 / 3 Outlin rh prolm. tt sp grphs. rh trs. trtgis, whih tr rnhs to hoos? trtgy/algorithm proprtis? Progrmming

More information

Label each of the following statements with either mitosis or meiosis. Fill in the gaps:

Label each of the following statements with either mitosis or meiosis. Fill in the gaps: AQA Boloy Unt 46: Inrtn, Vrton n Evoluton - Founton 1 Ll o t ollown sttmnts wt tr mtoss or moss Prous ntl lls Prous non-ntl lls Fll n t ps: Gmts on t to rstor t norml numr o romosoms T nw ll tt s prou

More information

2 Trees and Their Applications

2 Trees and Their Applications Trs n Tr Appltons. Proprts o trs.. Crtrzton o trs Dnton. A rp s ll yl (or orst) t ontns no yls. A onnt yl rp s ll tr. Quston. Cn n yl rp v loops or prlll s? Notton. I G = (V, E) s rp n E, tn G wll not

More information

Tangram Fractions Overview: Students will analyze standard and nonstandard

Tangram Fractions Overview: Students will analyze standard and nonstandard ACTIVITY 1 Mtrils: Stunt opis o tnrm mstrs trnsprnis o tnrm mstrs sissors PROCEDURE Skills: Dsriin n nmin polyons Stuyin onrun Comprin rtions Tnrm Frtions Ovrviw: Stunts will nlyz stnr n nonstnr tnrms

More information

An Introduction to Clique Minimal Separator Decomposition

An Introduction to Clique Minimal Separator Decomposition Alortms 2010, 3, 197-215; o:10.3390/3020197 Rvw OPEN ACCESS lortms ISSN 1999-4893 www.mp.om/ournl/lortms An Introuton to Clqu Mnml Sprtor Domposton Ann Brry 1,, Romn Poorln 1 n Gnvèv Smont 2 1 LIMOS UMR

More information

learning objectives learn what graphs are in mathematical terms learn how to represent graphs in computers learn about typical graph algorithms

learning objectives learn what graphs are in mathematical terms learn how to represent graphs in computers learn about typical graph algorithms rp loritms lrnin ojtivs loritms your sotwr systm sotwr rwr lrn wt rps r in mtmtil trms lrn ow to rprsnt rps in omputrs lrn out typil rp loritms wy rps? intuitivly, rp is orm y vrtis n s twn vrtis rps r

More information

A RANKING PROCEDURE FOR FUZZY DECISION-MAKING IN PRODUCT DESIGN

A RANKING PROCEDURE FOR FUZZY DECISION-MAKING IN PRODUCT DESIGN Ornl rtl rons o IDMME - Vrtl Conpt 2008 jn Cn Otor 8 0 2008 RNKING ROCEDURE FOR FUZZY DECISION-MKING IN RODUCT DESIGN Mro rjs r r 2 ): Déprtmnt Mtémtqs t Gén Instrl Éol olytnq Montrél C.. 6079 S. Cntr-vll

More information

Constructive Geometric Constraint Solving

Constructive Geometric Constraint Solving Construtiv Gomtri Constrint Solving Antoni Soto i Rir Dprtmnt Llngutgs i Sistms Inormàtis Univrsitt Politèni Ctluny Brlon, Sptmr 2002 CGCS p.1/37 Prliminris CGCS p.2/37 Gomtri onstrint prolm C 2 D L BC

More information

Catalytic S N Ar of Unactivated Aryl Chlorides ESI

Catalytic S N Ar of Unactivated Aryl Chlorides ESI Eltron Supplmntry Mtrl (ESI) or CmComm. Ts journl s T Royl Soty o Cmstry 2014 Ctlyt S Ar o Untvt Aryl Clors ESI Tl o Contnts 1. Prour n Full Tl o Contons - Prour S1 - Intl solvnt srn (no tlyst) - Solvnt

More information

A New Interface to Render Graphs Using Rgraphviz

A New Interface to Render Graphs Using Rgraphviz A Nw Intr to Rnr Grps Usn Rrpvz Florn Hn Otor 30, 2017 Contnts 1 Ovrvw 1 2 Introuton 1 3 Dult rnrn prmtrs 3 3.1 Dult no prmtrs....................... 4 3.2 Dult prmtrs....................... 6 3.3 Dult

More information

MAT3707. Tutorial letter 201/1/2017 DISCRETE MATHEMATICS: COMBINATORICS. Semester 1. Department of Mathematical Sciences MAT3707/201/1/2017

MAT3707. Tutorial letter 201/1/2017 DISCRETE MATHEMATICS: COMBINATORICS. Semester 1. Department of Mathematical Sciences MAT3707/201/1/2017 MAT3707/201/1/2017 Tutoril lttr 201/1/2017 DISCRETE MATHEMATICS: COMBINATORICS MAT3707 Smstr 1 Dprtmnt o Mtmtil Sins SOLUTIONS TO ASSIGNMENT 01 BARCODE Din tomorrow. univrsity o sout ri SOLUTIONS TO ASSIGNMENT

More information

b.) v d =? Example 2 l = 50 m, D = 1.0 mm, E = 6 V, " = 1.72 #10 $8 % & m, and r = 0.5 % a.) R =? c.) V ab =? a.) R eq =?

b.) v d =? Example 2 l = 50 m, D = 1.0 mm, E = 6 V,  = 1.72 #10 $8 % & m, and r = 0.5 % a.) R =? c.) V ab =? a.) R eq =? xmpl : An 8-gug oppr wr hs nomnl mtr o. mm. Ths wr rrs onstnt urrnt o.67 A to W lmp. Th nsty o r ltrons s 8.5 x 8 ltrons pr u mtr. Fn th mgntu o. th urrnt nsty. th rt vloty xmpl D. mm,.67 A, n N 8.5" 8

More information

ELECTRONIC SUPPLEMENTARY INFORMATION

ELECTRONIC SUPPLEMENTARY INFORMATION Elctronc Supplmntry Mtrl (ESI) or Polymr Cmstry. Ts ournl s T Royl Socty o Cmstry 2015 ELECTRONIC SUPPLEMENTARY INFORMATION Poly(lyln tcont)s An ntrstn clss o polystrs wt proclly loct xo-cn oul ons suscptl

More information

Data-Parallel Primitives for Spatial Operations Using PM. Quadtrees* primitives that are used to construct the data. concluding remarks.

Data-Parallel Primitives for Spatial Operations Using PM. Quadtrees* primitives that are used to construct the data. concluding remarks. Dt-rlll rmtvs or Sptl Oprtons Usn M Qutrs* Erk G. Hol Hnn Smt Computr Sn Dprtmnt Computr Sn Dprtmnt Cntr or Automton Rsr Cntr or Automton Rsr Insttut or Avn Computr Sns Insttut or Avn Computr Sns Unvrsty

More information

Graphs Depth First Search

Graphs Depth First Search Grp Dpt Frt Sr SFO 337 LAX 1843 1743 1233 802 DFW ORD - 1 - Grp Sr Aort - 2 - Outo Ø By unrtnn t tur, you ou to: q L rp orn to t orr n w vrt r ovr, xpor ro n n n pt-rt r. q Cy o t pt-rt r tr,, orwr n ro

More information

Using the Printable Sticker Function. Using the Edit Screen. Computer. Tablet. ScanNCutCanvas

Using the Printable Sticker Function. Using the Edit Screen. Computer. Tablet. ScanNCutCanvas SnNCutCnvs Using th Printl Stikr Funtion On-o--kin stikrs n sily rt y using your inkjt printr n th Dirt Cut untion o th SnNCut mhin. For inormtion on si oprtions o th SnNCutCnvs, rr to th Hlp. To viw th

More information

Instruction Scheduling, Register Allocation, Partial Redundancy Removal

Instruction Scheduling, Register Allocation, Partial Redundancy Removal CSC 255/455 Softwr Anlyss n Improvmnt Instruton Suln, Rstr Alloton, Prtl Runny Rmovl Lol Instruton Suln A Prmr for L 3 Comp 412 COMP 412 FALL 2008 Instrutor: Cn Dn Copyrt 2008, Kt D. Coopr & Ln Torzon,

More information

CIVIC CENTER: RAILING OVERALL FLOOR PLAN & DEMOLITION SIGHTLINE OVERALL FLOOR PLAN BALCONY HANDRAIL PLAN LOGE HANDRAIL PLAN BALCONY SIGHTLINE - NEW

CIVIC CENTER: RAILING OVERALL FLOOR PLAN & DEMOLITION SIGHTLINE OVERALL FLOOR PLAN BALCONY HANDRAIL PLAN LOGE HANDRAIL PLAN BALCONY SIGHTLINE - NEW 6 7 8 9 0 2 3 4 5 TSi V NTR: NRL & STLN RNOVTONS OVR -00-0 - -30-3 -32-33 NRL NORMTON ST RLN OVRLL LOOR PLN & MOLTON STLN OVRLL LOOR PLN LONY NRL PLN LO NRL PLN LONY STLN - MO LONY STLN - NW Project Number:

More information

Advanced Edit. ENGLISH OS Ver. 1.00

Advanced Edit. ENGLISH OS Ver. 1.00 E 1 Avn Et ENGLISH OS Vr. 1.00 Tl o Contnts 1 Tl o Contnts Soun oprtn mo......................... 2 T MIDI nnl.................................... 2 How to slt oslltors................................

More information

Mining API Patterns as Partial Orders from Source Code: From Usage Scenarios to Specifications

Mining API Patterns as Partial Orders from Source Code: From Usage Scenarios to Specifications Mnn API Pttrns s Prtl Orrs rom Sour Co: From Us Snros to Sptons Mthun Ahry 1 To X 1 Jn P 2 Jun Xu 1,3 1 Dprtmnt o Computr Sn, North Croln Stt Unvrsty, USA 2 Shool o Computn Sn, Smon Frsr Unvrsty, Cn 3

More information

Scheduling for Synthesizing Portable System with Energy Harvesting and Storage

Scheduling for Synthesizing Portable System with Energy Harvesting and Storage Shulng or Synthszng Portl Systm wth Enrgy Hrvstng n Storg Hsn-Ho Hung n Youn-Long Ln Dprtmnt o Computr Sn Ntonl Tsng Hu Unvrsty, TAIWAN s986@m98.nthu.u.tw; yln@s.nthu.u.tw Astrt Shulng s on o th most mportnt

More information

Decimals DECIMALS.

Decimals DECIMALS. Dimls DECIMALS www.mthltis.o.uk ow os it work? Solutions Dimls P qustions Pl vlu o imls 0 000 00 000 0 000 00 0 000 00 0 000 00 0 000 tnths or 0 thousnths or 000 hunrths or 00 hunrths or 00 0 tn thousnths

More information

A ' / 1 6 " 5 ' / 4 " A4.2 48' - 0" 3 12' - 7" 13' - 11" 10' - 0" 9' - 0" 2' - 6" 1. 2: 12 INDICATES SHOW MELT TYP ABV ABV

A ' / 1 6  5 ' / 4  A4.2 48' - 0 3 12' - 7 13' - 11 10' - 0 9' - 0 2' - 6 1. 2: 12 INDICATES SHOW MELT TYP ABV ABV 4. 4. 4. K ' - / " ' - / 4 " 0 ' - / " ' - 0 " ' - 0 " ' - / " 4 ' - 0 " 4. M U PPR 48' - 0" ' - ' - " 0' - 0" ' - 0" ' - ". : WOM ' - 0 " OT: PROV URROU TR OUT SVS OR UTUR SP UTTY T OR QUSTR MPUS OTO

More information

OpenMx Matrices and Operators

OpenMx Matrices and Operators OpnMx Mtris n Oprtors Sr Mln Mtris: t uilin loks Mny typs? Dnots r lmnt mxmtrix( typ= Zro", nrow=, nol=, nm="" ) mxmtrix( typ= Unit", nrow=, nol=, nm="" ) mxmtrix( typ= Int", nrow=, nol=, nm="" ) mxmtrix(

More information

FAMI-QS CODE VERSION 6

FAMI-QS CODE VERSION 6 Oprtor: FAMI-QS CODE VERSION 6 FAMI-QS Rstrton Numr: Dt o Aut: Autor: 4 Mnmnt Systm 4.1 Unrstnn t Oprtor n ts ontxt Ar xtrnl n ntrnl rsks trmn n oumnt? Ar xtrnl n ntrnl rsks rvw to nsur ontnul rlvn? Ar

More information

1 Introduction to Modulo 7 Arithmetic

1 Introduction to Modulo 7 Arithmetic 1 Introution to Moulo 7 Arithmti Bor w try our hn t solvin som hr Moulr KnKns, lt s tk los look t on moulr rithmti, mo 7 rithmti. You ll s in this sminr tht rithmti moulo prim is quit irnt rom th ons w

More information

Computer Graphics. Viewing & Projections

Computer Graphics. Viewing & Projections Vw & Ovrvw rr : rss r t -vw trsrt: st st, rr w.r.t. r rqurs r rr (rt syst) rt: 2 trsrt st, rt trsrt t 2D rqurs t r y rt rts ss Rr P usuy st try trsrt t wr rts t rs t surs trsrt t r rts u rt w.r.t. vw vu

More information

ENGLISH OS Ver Advanced Edit

ENGLISH OS Ver Advanced Edit E 1 ENGLISH OS Vr. 1.0 Avn Et Tl o Contnts Tl o Contnts Soun oprtn mo.........................1 T MIDI nnl..................................... 1 How to slt oslltors................................ 1 Souns,

More information

Fun sheet matching: towards automatic block decomposition for hexahedral meshes

Fun sheet matching: towards automatic block decomposition for hexahedral meshes DOI 10.1007/s00366-010-0207-5 ORIGINAL ARTICLE Fun st mtn: towrs utomt lok omposton or xrl mss Nols Kowlsk Frnk Loux Mttw L. Sttn Stv J. Own Rv: 19 Frury 2010 / Apt: 22 Dmr 2010 Ó Sprnr-Vrl Lonon Lmt 2011

More information

23 Minimum Spanning Trees

23 Minimum Spanning Trees 3 Mnmum Spnnn Trs Eltron rut sns otn n to mk t pns o svrl omponnts ltrlly quvlnt y wrn tm totr. To ntronnt st o n pns, w n us n rrnmnt o n wrs, onntn two pns. O ll su rrnmnts, t on tt uss t lst mount o

More information

Stronger Virtual Connections in Hex

Stronger Virtual Connections in Hex IEEE TRANSACTIONS ON COMPUTATIONAL INTELLIGENCE AND AI IN GAMES, VOL 7, NO 2, JUNE 2015, PAGES 156-166 156 Stronr Vrtul Conntons n Hx Ju Pwlwz n Ryn Hywr n Plp Hnrson n Bror Arnson Astrt For onnton ms

More information

ECE COMBINATIONAL BUILDING BLOCKS - INVEST 13 DECODERS AND ENCODERS

ECE COMBINATIONAL BUILDING BLOCKS - INVEST 13 DECODERS AND ENCODERS C 24 - COMBINATIONAL BUILDING BLOCKS - INVST 3 DCODS AND NCODS FALL 23 AP FLZ To o "wll" on this invstition you must not only t th riht nswrs ut must lso o nt, omplt n onis writups tht mk ovious wht h

More information

C CUYAHOGA COMMUNITY COLLEGE WEST SCIENCE & IT ADDITION & RENOVATION

C CUYAHOGA COMMUNITY COLLEGE WEST SCIENCE & IT ADDITION & RENOVATION 0 TS RWN S NOT NL N T NORMTON SOWN S SUT TO N. VRY TT YOU R USN T MOST URRNT STRUTON O TS RWN. NOTY WR MURPY OX O NY SRPNS TWN ONTRT RWNS OR OMPLT WOR OR PRON. - 00 UYO OLL PPNX - RVRSTON XSTN ONTONS SURVY

More information

EE1000 Project 4 Digital Volt Meter

EE1000 Project 4 Digital Volt Meter Ovrviw EE1000 Projt 4 Diitl Volt Mtr In this projt, w mk vi tht n msur volts in th rn o 0 to 4 Volts with on iit o ury. Th input is n nlo volt n th output is sinl 7-smnt iit tht tlls us wht tht input s

More information