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

Size: px
Start display at page:

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

Transcription

1 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 nrss, t prolty o systm lur rows sustntlly, posn n nrsnly snnt lln or sllty. It s mportnt to prov rsln or lon runnn ppltons. Ckpont-s ult tolrn mtos r tv ppros t ln wt ults. Wt ts mtos, t stt o t ntr prlll pplton s kpont to rll stor. Wn lur ours, t pplton s rstrt rom rnt kpont. In prvous work, w v monstrt n nt oul n-mmory kpont n rstrt ult tolrn sm, w lvrs Crm++ s prlll ots or kpontn. In ts ppr, w urtr optmz t sm y lmntn svrl ottlnks us y srlz ommunton. W xtn t n-mmory kpontn sm to work on MPI ommunton lyr, n monstrt t prormn on vry lr sl supromputrs. For xmpl, wn runnn mllon tom molulr ynms smulton on up to 64K ors o BluGn/P mn, t kpont tm ws n mllsons. T rstrt tms wr msur to lss tn.15 sons on 64K ors. I. INTRODUCTION On onrn o prormn omputn or xsl s t lty to tolrt ults. Evn tou toy s supromputrs r ompos o rll prts, t mn tm twn lur (MTBF) stll rops own s t numr o prossors nrss. Jur, t 3r rnk supromputr on top 5 toy, 2.33 vr lurs pr y urn t pro rom Auust 28 to Frury 21. For toy s snt smulton runnn or mny ys, su lurs r tstrop. On ommon soluton to support ult tolrn r t sk-s kpont/rstrt sms. In ts mtos, ppltons or HPC systm kpont t stt o t ntr prlll pplton n or rstrt to rll mum, typlly NFS ult r sp. Howvr, prol kpontn to su slow stor n xpnsv, or xmpl, t oul onsum up to 2% o t pplton tm [1]. Tr r two mn mtos to strt kpontn: systm or pplton ntt kpont. Systm s kpont my tk 2 to 4 mnuts to kpontn or t st mns on t top 5 lst (28) [2], [3]. Tror, systm lvl kpontn to t l systm s lrly mprtl t xsl. Applton-lvl kpontn n lp run kpont sz, ut s stll llnn n trms o t sllty t xsl, n pls tonl urn on pplton prormmr. A runtm-lvl kpontn sm rus t urn on t prormmr, splly y utomtn t protool or trrn kponts, n rryn out rovry. In our prvous work [4], [5], w xplor n n-mmory kpont/rstrt sm n ult tolrnt CHARM++ [6] n Aptv MPI [7] runtm systms. T protool os not rly on ny rll stor or kponts. T rstrt protool llows pplton to ontnu to run on t survvn prossors tr rs wtout ull stop. T protool uss lol mmory or sk or kponts, n n lvr t sp ommunton ntwork to sp up t kpontn pross. T s s to prolly rt two kponts or ps o pplton t npsult n CHARM++ ots. On kpont s stor n lol stor (mmory or lol sk), n t otr s stor on rnt no, ll uy no. On lur, t survvn nos rstors tr ot t rom t lol kponts, wrs t ots on osn spr no (to rpl t l on) r rstor usn kponts stor t uy no. Ts mto s pl o tolrtn ll snl lurs, n most multpl lurs, l nos r not uy to otr. Altou ts sm os not prov n nlll mto o ult tolrn, t soul sunt to pply to vry lr mns s snl lurs r t most ommon lur n toy s HPC systm. For xmpl, 95% o t lurs on TSUBAME r snl lur. T two kponts onsttut mmory ovr or ts sm, ut (somwt surprsnly) ts s tolrl or lr lss o ppltons: tos tt v smllr mmory ootprnt t kpont. Ts nlu molulr ynms, N- oy os, rtn quntum mstry (nnomtrls os), t. For otrs, t sm rls on utur lol stor (or o ours, lol l systm s ll k). In ts ppr, w stuy t tnqus rqur n t oul n-mmory kpont n rstrt sm or vry lr sl. W xmn t ovrs o t mplmntton tt oul potntlly lmt sllty, n urtr mprov t mplmntton y optmzn ommunton (splly t olltv ommunton). On ostl or monstrtn ult tolrn on MPI ppltons s tt t quun systm on supromputrs klls t ntr o wn pross ls. To work roun ts

2 lmtton, w vlop ult nton sm tt mms lur o pross wtout tully klln t. Ts llows us to monstrt t ult tolrn sm wt MPI on vry lr sl supromputrs. T rst o ts ppr s ornz s ollows. Ston II srs t oul n-mmory kpont/rstrt protool s kroun. T tnqu w us to monstrt t or MPI ppltons n urtr optmzton o t kpont/rstrt sm to xsl s prsnt n Ston III. Prormn rsults o t optmz ult tolrn sm on up to 64K ors r prov n Ston IV. W suss som rlt work n Ston V, n nlly, Ston VI onlus t ppr. II. BACKGROUND In ts ston, w summrz sn o sll nmmory kpont-s ult tolrn sm trtn vry lr sl prlll ppltons. T supportn prlll runtm systms r Crm++, mss rvn runtm systm, n Aptv MPI [7], n mplmntton o MPI on top o Crm++. Ts ult tolrnt runtms tk vnt o t mrtlty ots n trs. A. Runtm Support or Ckpont/Rstrt T ult tolrnt runtm systm supports kpontn o pplton t n two lvls: ully utomt kpontn or lxl usr-ontroll kpontn y tonl lpr untons. Aptv MPI [8] runs MPI prosss n lt-wt trs, w r sr or kpont n rstrt to nl ompr to prosss. Tr mrton urn rstrt woul rs t prolm o pontr rrn. Isomllo [8], [9] s us to solv ts prolm or ully utomt kpontn, smlr to t tnqu n t P M 2 systm [1]. Isomllo rsrvs rn o vrtul rss sp or ll t prossors. Durn kpontn, vrtul rsss o t MPI trs or ots n t t ssot wt tm r sv utomtlly. A ot or tr n tn rstor on ny prossor sn t llot t n rstor wtout nn ts rss. Anotr opton s tt usrs n wrt tr own lpr untons to pk n unpk p t or kpontn n rstorn n ot. Ts s somtms usul n run t sz o t nvolv n kpontn n rstorn. Applton vloprs oul us pplton sp knowl to pk only t lv vrls t t tm o kpontn, or us omplr to utomt ts [11]. Ts mto rus t t mount to kpont, n so kpontn oms str. B. Bs Doul In-Mmory Ckpont/Rstrt Sm Ckpont/rstrt sm rqurs nos to rquntly sv tr omplt stt to stl stor or t mmory o notr no. T optmum tm twn kponts s n nlyz lswr [12], [13]. T n-mmory kpontn sm [4] ntrou t o sklss kpontn tt kponts t n mmory. It uss oornt kpont strty, w rqurs PE PE1 PE2 PE3 F. 1: In-Mmory Snl Ckpont PE PE PE1 PE2 PE3 PE2 rs, lost on prossor PE1 PE3 ot kpont 1 kpont 2 rstor ot F. 2: In-Mmory Snl Ckpont ppltons to v synronzton pont wr ty oul strt lol olltv oprton to kpont. In orr to nl on lur t tm, ommon s snro, on kpont o t pplton stt n t mmory o rnt prossor s not sunt s llustrt n Fur 1. In ts snro wt 4 prossors, Crm++ ot (rprsnt s rl) kponts only on opy o ts kpont (rprsnt s trnl). Wn prossor 2 rss, t kponts or ot n n mmory o tt prossor r prmnntly lost, so w ouln t rovr rom t kpont. Ts susts tt t lst two ops o t kpont t rnt lotons r n. In prtulr, w opt n n-mmory oul-kpontn sm w n tolrt t lst on lur t tm. Fur 2 llustrts n xmpl o ts sm. T top l o t ur sows t snro or on prossor rss. E rl rprsnts n ot n kpont, wl trnl n squr rprsnts ts rst n son kponts. W ll ts two prossors uy prossors or t kpontn ot. Not tt on o t two uy prossors n t sm prossor wr t ot rss. Ts n lp ru t kpontn ovr, sn t

3 kpontn s slly lol mmory opy, w s mu str tn ssn mmory o rmot prossors. Ovrll, ompr to t trtonl on-sk kpontn, n-mmory kpontn sm uss mmory s stor n strut wy, tkn vnt o t sp ntronnt, w tns to mor nt. T rstrt prour s ntt y rs o pysl prossor. On lustrs, t rs ttor n t runtm systm tts t rs trou rokn pp sokt rrors. Wn t rstrt prour s ntt, ll survvn prossors xmn t kponts n tr mmory n k or mssn uy prossors. A nw prossor s osn (w n tr spr prossor, or runnn prossor) to rpl t rs prossor n t ltst kpont t s op to tt prossor to mntn t oul kponts. On o t two uy prossors s tn rsponsl or rstorn t orrsponn ots rom ts kponts n mmory. At rstrt, t rplmnt prossor s rom runnn prossor, tn lo mln my our sn tt prossor rstors mor kponts. Ts n x y lo lnn ps tr rstrt [4]. T ottom l o t Fur 2 llustrts snpsot o t ots n tr kponts strut on prossors tr rovry s omplt. T lost kponts on t rs prossor 2 r rovr to prossor 3 n prossor rsptvly. Prossor 3 s osn to rstor prossor 2 s ots(,) lolly to vo ommunton ovr, sn Prossor 3 s prossor 2 s ornl uy prossor. Our protool nsurs t rovry rom snl no lur n w n rovr rom multpl onurrnt lurs t rs prossors r not us to otr. III. OPTIMIZATIONS FOR SCALABILITY In prvous work [4], w v sown tt t s sm v oo prormn on lustrs o mor tn unr ors [4]. Howvr, wn w tst ts sm on Blu Gn/P mn wt tns o tousns o ors, w oun ot t kpontn n rstrtn tm nrss lmost lnrly s t numr o prossors nrss, s sown n Fur 3 n 6, w s not sll. Altou t solut prormn s stll surprsnly oo (or xmpl, rstrt on 64K prossors only took lss tn 4 sons), or xsl systms, t mt stll prolm wn tr r, or xmpl, mllons o ors. Ts motvts t work n ts ppr to urtr optmz t oul n-mmory kpont/rstrt sm or xsl mns. A. Optmzton Tnqus Stl mss nln: Sn t oul n-mmory sm rstrts pplton on t ly wtout tully rstrtn t prlll o, t t nnn o t rstrt ps, wn t pplton s rstor to rnt kponts, ol msss tt r snt or kponts r rstor r stll n trnsmsson or ur, n possly mx wt systm msss u to t onon prlll rstrt. Evn mor omplt, t s possl or t stl msss to vntully lvr on no tr kponts r rstor. Tror, t s rtl to sr ll stl msss rom t rs. To rntt t stl msss wt t ll msss snt tr rs, n po numr s us n our oul n-mmory kpont sm. Howvr, ult tton n ult nnounmnt to ll nos ours n prlll wt t ontnuous xuton o t survvn nos. Wn omputton only pns on norn ors, t omputton on tos ors my not t n kp on vn tr no s rs untl t ult notton mss nlly rrvs. Durn ts pro o tm, mor stl msss my nrt rom tos ors, w nrss t urn o srn ts stl msss. On vry lr sl mns, ln wt stl msss systm w my xpnsv, tror, t s rtl to trottl t xuton o t prorm s soon s possl tr rs s tt to prvnt propton o t stl msss. In t optmz sm, w ntrou nw ps n rstrt w s t to trottln t stl msss. Ts ps strts mmtly tr ult s tt. All nos ntr stt n w ty sr ll rv msss untl qusn s tt, w mns tr r no stl msss. T qusn tton s n nt tr-s lortm tt s t omplxty o O(loP ), wr P s t numr o nos. Optmzn smll msss usn strmn tnqus: Durn rstrt, mny smll ookkpn msss r snt to upt t runtm systm out t mrtl ots. For xmpl, or ot rstor, smll mss ontnn ts nw loton s snt to ts om prossor. On vry lr systms, ts xtrmly lr numr o smll msss om prolm - t uss tr m n rtly slows own t rstrt pross. In t optmz vrson, w ppl strmn optmzton tnqu tt omns smll msss snt to t sm stnton prossors nto on r mss. Optmzn olltv ommunton: In t ornl sm, svrl rrrs r n urn kpont n rstrt to nsur t orr o kpont/rstrt pss, or xmpl, t rovry o t rry lmnts rom kponts ppns only tr rmovn ll t stl ot t n mmory o ll prossors. Ts rrrs rt sllty lln. Altou, nt spnnn tr-s ruton mplmntton xst n CHARM++, t n not sly us n ts s. Ts s us t mplmntton n not nl t s wn tr s rs prossor n t tr n t nonsstnt ruton squn numr us y t lur. Tror, t ornl sm mplmnt smpl ult tolrnt rrr s on pont-to-pont ommunton synronz y ntrl prossor. Ts smpl mplmntton s sunt or mns wt unrs o nos, owvr, lrly, t os not sl. To optmz t ult tolrnt rrr, w r-mplmnt t s on t ronstrut spnnn tr urn rstrt. T nw rrr lso nors t ruton squn numr, w s only n wn tr r multpl onurrnt rutons. Durn kpont/rstrt, w only us rrr to sprt rnt

4 Ckpont Tm Intrp(lnMD) Ckpont Tm Intrp(lnMD) toms 1 mllon toms toms 1 mllon toms Tm (s) Tm (ms) #ors #ors F. 3: LnMD Ckpont tm or optmzton (tm n sons) F. 4: LnMD Ckpont tm tr Optmzton (Not: tm n mllsons) pss, tr s no multpl onurrnt rutons ourrn. W oun t nw optmz rrr snntly mprovs t kpont/rstrt prormn. For xmpl, on 64K ors, t rstrt tm s rmtlly ru rom 3.6s to.15s or n 1-mllon tom systm. T xprmnt rsult s tl n Ston IV. 1.8 Ckpont Tm Krkn(Jo AMPI) Jo(9 MB/or) B. Fult Tolrn or MPI Applton on Supromputrs On ostl or monstrtn ult tolrn on MPI ppltons s tt t o sulrs on supromputrs kll t ntr o wn pross ls. To llow ny o t ult tolrn sms to work wt t o quun systms, t woul rqur moton to t o sulr to lt ult tolrnt o rovr tsl. Howvr, su n to t o sulr s not sl on toy s supromputrs. Inst, w vlop sm tt mms lur o pross wtout tully klln t. Ts ult nton sm s mplmnt s DNow() unton, w s nsrt y t usr t ny pl n tr prorm to trr lur, typlly ontroll y rnom numr nrtor. Wn t DNow() unton s ll y pross, t pross wll or to n n stop rsponn to ny ommunton s t s. T ult tton sm s mplmnt s kp-lv protool. E MPI pross pns ts uy pross prolly to norm ts uy tt t s stll lv. I tr s no rspons rom pross or rtn pro o tm, t uy pross wll nos tt t pross s, n nnoun t pross s rnk to ll otr prosss. All prosss olltvly rspon to t lur n xut t rstrt protool. A pool o som spr MPI prosss r rt t t o strtup tm to us or rstrt. Ts prosss o not ntlly run usr pplton o. Durn rstrt, on spr MPI pross wll osn to rpl t l MPI rnk to xut t usr pplton. Compr to t rl snro, t only rn n our mult ult nton sm s tt t pross os Tm (s) K 4K 8K 16K 32K #ors F. 5: Ckpont tm or Jo (on Krkn) not rlly o wy. Howvr, t rst o t ult tolrn protool s t sm s t woul ppn n rl snro. Wn o sulr s xtn to llow l pross, our sm n mmtly tk vnt o t to prov tru ult tolrn support to MPI ppltons. IV. EXPERIMENTS W vlut t ovr o pro kpontn s wll s t prormn o rstrtn ppltons tr lur. Two ppltons r us n our xprmnts. On s LnMD, molulr ynms smulton prorm wrttn n CHARM++. As typl molulr ynm smulton prorms, ts pplton s mum mmory ootprnt. T otr nmrk s Jo, 7 pont stnl MPI prorm w uss 3D omposton. It s lrr mmory ootprnt. T xprmnts r on on Intrp t Aronn Ntonl

5 5 4 Rstrt Tm Intrp(lnMD) 125 toms 1 mllon toms.2.15 Rstrt Tm Intrp(lnMD) 125 toms 1 mllon toms Tm (s) 3 2 Tm (s) #ors #ors F. 6: Rstrt tm-lnmd (Bor Optmzton) F. 7: Rstrt tm-lnmd (Atr Optmzton) Lortory, n Krkn t t Ntonl Insttut or Computtonl Sn. Intrp onssts o 163, 84 ors, 8 tryts o RAM, wt pk prormn o 557 trlops. Krkn s 9, 48 omput nos n no ontns 12 ors, 16GB o mmory, wt pk prormn o 1.17 ptlops. A. Ckpont Tm Fur 3 sows t kpont tm o LnMD or optmzton, on rom 4K to 64K ors o Intrp. Two rnt sz molulr systms r uss n t xprmnts, on wt 125, toms, n t otr wt 1 mllon toms. As n sn n t ur, ltou t kpont ovr s rltvly smll us o our n-mmory sm, t nrss lnrly s t t numr o ors nrss. Ts ws lrly u to t nssty o usn n nnt olltvs protool urn rovry. In omprson, Fur 4 llustrts t tm to kpont LnMD tr pplyn t optmztons sr n Ston II. Inst o usn pont-to-pont mplmntton o ult-wr rrr, usn t spnnn tr-s rrr rus t tm to kpont. T t o t optmzton n osrv n Fur 4. W n s tt t kpont tm rmns lmost lt wn numr o or nrss rom 4K to 64K or ot molulr systms. In prtulr, t kpont tm on 64K ors or t 1 mllon molulr systm s only out 4.2 ms. In omprson, t smulton n LnMD woul tk tns o mllsons pr tm-stp. T son nmrk s Jo prorm wrttn n MPI, w s lrr mmory prnt or kpont. In ts xprmnt, w kp t kpont sz x s 9 myts pr or, n tst t kpont tm on Krkn supromputr, wt vryn numr o ors rom 248 to 32, 768. Not tt s t numr o ors ouls, t totl mount o kpont ross t ntr systm lso ouls. Ts Jo MPI prorm runs on our ult tolrnt MPI runtm, AMPI, n uss somllo or ully utomt kpontn. T rsult s llustrt n Fur 5. As w n s tt ltou t totl kpont sz ouls vry tm wn t numr o ors ouls, t kpont tm rmns onstnt n ts tsts, n s lss tn.6 son. Ts monstrts tt our n-mmory kpont sm s ly nt, n n potntlly sl to vn lrr systms. B. Rovry Prormn W us LnMD to vlut t rstrt prormn, wt t sm two rnt sz molulr systms. Rstrt s prorm on Krkn, usn t ult nton tnqus sr n Ston III-B. T rovry tm s msur rom t tm lur s tt to t pont wr t pplton s rovr n ry to ontnu ts xuton rom t lst kpont. T rs prossor s rpl y spr prossor, n ts stt s rstor rom t kpont on t rs prossor s uy urn ts pro o tm. T rsults or t optmzton n tr r sown n Fur 6 n 7 or omprson. Sn svrl rrrs r nvolv n ts pross to nsur onsstny untl t rs prossor s rovr. By usn rrr s on trnsnt spnnn tr onstrut urn rovry, t omplxty o t rovry ovr s rs rom O(P ) to O(loP ). Bor optmzton (Fur 6), t rstrt tm nrss lmost lnrly rom.2 son on 4K ors to 3.6 son on 64K ors or ot molulr systms, wl tr optmzton, t rstrt tm s rmtlly ru, w tks only.6 son on 4K ors up to.15 son on 64K ors or t 1 mllon tom systm. Ovrll, t rstrt pross o our n-mmory ult tolrn sm s vry nt, prtly u to t ult tolrn protool w llows t pplton to rstrt rom t lst kpont n t lol mmory. It lso nts rom t t tt t pplton n rstrt wtout ull stop, so t o turn-roun tm n nw o sumsson r vo. V. RELATED WORK Tr r tr mn mtos to kpont HPC pplton: unoornt kpontn, oornt kpontn

6 n ommunton-s kpontn. In unoornt kpontn, pross npnntly svs ts stt. T nt s tt kpont n tk pl wn t s most onvnnt n tus osn t rqur synronzton to ntt kpontn. Howvr, unoornt kpontn s susptl to rollk propton, t omno t [14] w oul us systms to rollk to t nnn o t omputton, rsultn n t wst o lr mount o usul work. Gurmou t l. [15] propos n unoornt kpontn wtout omno t wt t lp o lon usul pplton msss, w s ppll to Sn- Dtrmnst MPI ppltons. Coornt kpontn rqurs prosss to oornt tr kponts n orr to orm onsstnt lol stt. Coornt kpontn smpls rovrn rom lurs us t os not sur rom rollk proptons. FTI [1] s mult-lvl oornt kpont sm usn topoloy-wr RS non wt out 8% ovr. BLCR [16] mplmnts krnl lvl kpontn n s wly us n ppltons wt prouton qulty. In [17] Mooy t l. propos multlvl kpont n us Mrkov prolty mol to sr ts prormn. On rwk or tos mtos s tt t pplton ouln t rovr n t urrnt run ust tr t lur ppns ut woul rqur t usr to rrun t pplton, rn t kpont orm t sk. Communton-nu kpontn llows t prosss to tk som o tr kponts npnntly wl prvntn t omno t y orn t prossors to tk tonl kponts s on protool-rlt normton pyk on t pplton msss t rvs rom otr prossors [18]. Howvr t s sllty ssus on lr numrs o prossors. VI. CONCLUSION AND FUTURE WORK As t sz o supromputrs nrss, t prolty o systm lur rows sustntlly, posn n nrsnly snnt lln or sllty. Ts ppr prsnt svrl optmzton tnqus to sll oul n-mmory kpont/rstrt sm to mprov ts sllty towrs xsl. W monstrt ts prormn wt mllon tom molulr ynms smulton on up to 64K ors o BluGn/P mn, n sow kpont tm n mllsons. T rstrt tms wr msur to lss tn.15 sons on 64K ors. In utur, w pln to mplmnt nonlokn kpont n our sm. For ppltons wt lr mmory ootprnt runnn on multor mns, nonlokn kpont oul urtr ovrlp kponts wt omputton n tus ru t kpont ovr. ACKNOWLEDGMENTS Ts work ws prtlly support y t US Dprtmnt o Enry unr rnt DOE DE-SC1845, y NSF rnt OCI or Blu Wtrs, n y t Insttut or Avn Computn Appltons n Tnolos (IACAT) t t Unvrsty o Illnos t Urn-Cmpn. Ts work us mn rsours rom Trr unr wr ASC539N. REFERENCES [1] L. Butst-Gomz, S. Tsuo, D. Komtts, F. Cppllo, N. Mruym, n S. Mtsuok, FTI: H prormn ult tolrn ntr or yr systms, n H Prormn Computn, Ntworkn, Stor n Anlyss (SC), 211 Intrntonl Conrn or, nov. 211, pp [2] Top5 supromputn sts, ttp://top5.or. [3] F. Cppllo, Fult tolrn n ptsl/ xsl systms: Currnt knowl, llns n rsr opportunts, Int. J. H Prorm. Comput. Appl., vol. 23, pp , Auust 29. [Onln]. Avll: ttp://l.m.or/tton.m?= [4] G. Zn, L. S, n L. V. Klé, FTC-Crm++: An In-Mmory Ckpont-Bs Fult Tolrnt Runtm or Crm++ n MPI, n 24 IEEE Intrntonl Conrn on Clustr Computn, Sn Do, CA, Sptmr 24, pp [5] G. Zn, C. Hun, n L. V. Klé, Prormn Evluton o Automt Ckpont-s Fult Tolrn or AMPI n Crm++, ACM SIGOPS Oprtn Systms Rvw: Oprtn n Runtm Systms or H-n Computn Systms, vol. 4, no. 2, Aprl 26. [6] L. V. Kl n G. Zn, Crm++ n AMPI: Aptv Runtm Strts v Mrtl Ots, n Avn Computtonl Inrstruturs or Prlll n Dstrut Appltons, M. Prsr, E. Wly-Intrsn, 29, pp [7] C. Hun, G. Zn, S. Kumr, n L. V. Klé, Prormn Evluton o Aptv MPI, n Prons o ACM SIGPLAN Symposum on Prnpls n Prt o Prlll Prormmn 26, Mr 26. [8] C. Hun, O. Lwlor, n L. V. Klé, Aptv MPI, n Prons o t 16t Intrntonl Worksop on Lnus n Complrs or Prlll Computn (LCPC 23), LNCS 2958, Coll Stton, Txs, Otor 23, pp [9] G. Zn, O. S. Lwlor, n L. V. Klé, Multpl lows o ontrol n mrtl prlll prorms, n 26 Intrntonl Conrn on Prlll Prossn Worksops (ICPPW 6). Columus, Oo: IEEE Computr Soty, Auust 26, pp [1] G. Antonu, L. Bou, n R. Nmyst, An nt n trnsprnt tr mrton sm n t P M 2 runtm systm, n Pro. 3r Worksop on Runtm Systms or Prlll Prormmn (RTSPP) Sn Jun, Purto Ro. Ltur Nots n Computr Sn Sprnr- Vrl, Aprl 1999, pp [11] G. Bronvtsky, D. J. Mrqus, K. K. Pnl, R. Run, n S. A. MK, Complr-nn nrmntl kpontn or opnmp ppltons, n Prons o t 13t ACM SIGPLAN Symposum on Prnpls n prt o prlll prormmn, sr. PPoPP 8. Nw York, NY, USA: ACM, 28, pp [Onln]. Avll: ttp://o.m.or/1.1145/ [12] J. T. Dly, A r orr stmt o t optmum kpont ntrvl or rstrt umps, Futur Gnrton Comp. Syst., vol. 22, no. 3, pp , 26. [13] J. W. Youn, A rst orr pproxmton to t optml kpont ntrvl, Commun. ACM, vol. 17, no. 9, pp , [14] B. Rnll, Systm strutur or sotwr ult tolrn, n Prons o t ntrntonl onrn on Rll sotwr. Nw York, NY, USA: ACM, 1975, pp [Onln]. Avll: ttp://o.m.or/1.1145/ [15] A. Gurmou, T. Roprs, E. Brunt, M. Snr, n F. Cppllo, Unoornt kpontn wtout omno t or sntrmnst MPI ppltons, n Prons o t 211 IEEE Intrntonl Prlll & Dstrut Prossn Symposum, sr. IPDPS 11. Wsnton, DC, USA: IEEE Computr Soty, 211, pp [Onln]. Avll: ttp://x.o.or/1.119/ipdps [16] P. H. Hrrov n J. C. Dull, Brkly l kpont/rstrt (BLCR) or Lnux lustrs, Journl o Pyss Conrn Srs, vol. 46, pp , Sp. 26. [17] A. Mooy, G. Bronvtsky, K. Moror, n B. R. Supnsk, Dsn, moln, n vluton o sll mult-lvl kpontn systm, n SC, 21, pp [18] D. Brto, A. Cuoltt, n L. Smonn, A strut omnot r rovry lortm. n Symposum on Rllty n Dstrut Sotwr n Dts Systms 84, 1984, pp

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

(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

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

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

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

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

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

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

GrenchMark : a framework for analyzing, testing, and comparing grids Iosup, A.; Epema, D.H.J. 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.26.49 Puls: 1/1/26 Doumnt

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

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

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

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

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

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

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

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

, 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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

(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

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

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

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

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

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

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

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

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

CHELOURANYAN CALENDAR FOR YEAR 3335 YEAR OF SAI RHAVË

CHELOURANYAN CALENDAR FOR YEAR 3335 YEAR OF SAI RHAVË CHELOURANYAN CALENDAR FOR YEAR YEAR OF SAI RHAVË I tou woust n unon wt our Motr, now tt tou st nvr t Hr. I tou woust sp t v o mttr, now tt tr s no mttr n no v. ~Cry Mry KEY TO CALENDAR T Dys o t W In t

More information

Present state Next state Q + M N

Present state Next state Q + M N Qustion 1. An M-N lip-lop works s ollows: I MN=00, th nxt stt o th lip lop is 0. I MN=01, th nxt stt o th lip-lop is th sm s th prsnt stt I MN=10, th nxt stt o th lip-lop is th omplmnt o th prsnt stt I

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

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

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

Multipoint Alternate Marking method for passive and hybrid performance monitoring

Multipoint Alternate Marking method for passive and hybrid performance monitoring Multipoint Altrnt Mrkin mtho or pssiv n hyri prormn monitorin rt-iool-ippm-multipoint-lt-mrk-00 Pru, Jul 2017, IETF 99 Giuspp Fiool (Tlom Itli) Muro Coilio (Tlom Itli) Amo Spio (Politnio i Torino) Riro

More information

Cycles and Simple Cycles. Paths and Simple Paths. Trees. Problem: There is No Completely Standard Terminology!

Cycles and Simple Cycles. Paths and Simple Paths. Trees. Problem: There is No Completely Standard Terminology! Outlin Computr Sin 331, Spnnin, n Surphs Mik Joson Dprtmnt o Computr Sin Univrsity o Clry Ltur #30 1 Introution 2 3 Dinition 4 Spnnin 5 6 Mik Joson (Univrsity o Clry) Computr Sin 331 Ltur #30 1 / 20 Mik

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

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

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

17 Basic Graph Properties

17 Basic Graph Properties Ltur 17: Bs Grp Proprts [Sp 10] O look t t sn y o. Tn t t twnty-svn 8 y 10 olor lossy pturs wt t rls n rrows n prrp on t k o on... n tn look t t sn y o. An tn t t twnty-svn 8 y 10 olor lossy pturs wt t

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

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

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

Outline. 1 Introduction. 2 Min-Cost Spanning Trees. 4 Example

Outline. 1 Introduction. 2 Min-Cost Spanning Trees. 4 Example Outlin Computr Sin 33 Computtion o Minimum-Cost Spnnin Trs Prim's Alorithm Introution Mik Joson Dprtmnt o Computr Sin Univrsity o Clry Ltur #33 3 Alorithm Gnrl Constrution Mik Joson (Univrsity o Clry)

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

Institute for Advanced Computer Sciences. Abstract. are described for building these three data structures that make use of these

Institute for Advanced Computer Sciences. Abstract. are described for building these three data structures that make use of these Dt-Prlll Prmtvs or Sptl Oprtons Erk G. Holy Computr Sn Dprtmnt Unvrsty o Mryln Coll Prk, Mryln 074 ol@s.um.u Hnn Smt Computr Sn Dprtmnt Cntr or Automton Rsr Insttut or Avn Computr Sns Unvrsty o Mryln Coll

More information

Physics 222 Midterm, Form: A

Physics 222 Midterm, Form: A Pysis 222 Mitrm, Form: A Nm: Dt: Hr r som usul onstnts. 1 4πɛ 0 = 9 10 9 Nm 2 /C 2 µ0 4π = 1 10 7 tsl s/c = 1.6 10 19 C Qustions 1 5: A ipol onsistin o two r point-lik prtils wit q = 1 µc, sprt y istn

More information

CSE 373: More on graphs; DFS and BFS. Michael Lee Wednesday, Feb 14, 2018

CSE 373: More on graphs; DFS and BFS. Michael Lee Wednesday, Feb 14, 2018 CSE 373: Mor on grphs; DFS n BFS Mihl L Wnsy, F 14, 2018 1 Wrmup Wrmup: Disuss with your nighor: Rmin your nighor: wht is simpl grph? Suppos w hv simpl, irt grph with x nos. Wht is th mximum numr of gs

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

QUESTIONS BEGIN HERE!

QUESTIONS BEGIN HERE! Points miss: Stunt's Nm: Totl sor: /100 points Est Tnnss Stt Univrsity Dprtmnt o Computr n Inormtion Sins CSCI 2710 (Trno) Disrt Struturs TEST or Sprin Smstr, 2005 R this or strtin! This tst is los ook

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

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

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

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

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

Boosting Margin Based Distance Functions for Clustering

Boosting Margin Based Distance Functions for Clustering Boostn Mrn Bs Dstn Funtons or Clustrn Tomr Hrtz TOMBOY@CS.HUJI.AC.IL Aron Br-Hlll AHARONBH@CS.HUJI.AC.IL Dpn Wnsll DAPHNA@CS.HUJI.AC.IL Sool o Computr Sn n Ennrn n t Cntr or Nurl Computton, T Hrw Unvrsty

More information

18 Basic Graph Properties

18 Basic Graph Properties O look t t sn y o. Tn t t twnty-svn 8 y 10 olor lossy pturs wt t rls n rrows n prrp on t k o on... n tn look t t sn y o. An tn t t twnty-svn 8 y 10 olor lossy pturs wt t rls n rrows n prrp on t k o on

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

Sequential Redundancy Identification Using Recursive Learning

Sequential Redundancy Identification Using Recursive Learning Squntal Runany Intaton Usn Rursv Larnn Wanln Cao ra K. Praan partmnt o Computr Sn Txas A&M Unvrsty Coll Staton, Txas 77843 Astrat A squntal runany ntaton prour s prsnt. Bas on unontrollalty analyss an

More information

( ) ( ) ( ) 0. Conservation of Energy & Poynting Theorem. From Maxwell s equations we have. M t. From above it can be shown (HW)

( ) ( ) ( ) 0. Conservation of Energy & Poynting Theorem. From Maxwell s equations we have. M t. From above it can be shown (HW) 8 Conson o n & Ponn To Fo wll s quons w D B σ σ Fo bo n b sown (W) o s W w bo on o s l us n su su ul ow ns [W/ ] [W] su P su B W W 4 444 s W A A s V A A : W W R o n o so n n: [/s W] W W 4 44 9 W : W F

More information

Outline. Computer Science 331. Computation of Min-Cost Spanning Trees. Costs of Spanning Trees in Weighted Graphs

Outline. Computer Science 331. Computation of Min-Cost Spanning Trees. Costs of Spanning Trees in Weighted Graphs Outlin Computr Sin 33 Computtion o Minimum-Cost Spnnin Trs Prim s Mik Joson Dprtmnt o Computr Sin Univrsity o Clry Ltur #34 Introution Min-Cost Spnnin Trs 3 Gnrl Constrution 4 5 Trmintion n Eiiny 6 Aitionl

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

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