Optimization of Multistage Interconnection Networks
|
|
- Trevor Gordon
- 6 years ago
- Views:
Transcription
1 IEEE TRNSCTIONS ON COMPUTERS, VOL. C-34, NO. 3, MRCH 985 Dynmi ssiility Tstin n Pt Lnt Optimiztion o Multist Intronntion Ntworks 55 DHRM P. GRWL, SENIOR MEMBER, IEEE, ND J-SONG LEU, STUDENT MEMBER, IEEE strt -T mrn o multipl prossor systms s sn t inrs us o multist intronntion ntworks (MIN's), uilt wit svrl sts o -input -output switin lmnts (SE's). T onntivity n ult tolrn o ts ntworks r importnt prolms s MIN's r xpt to t rt o ts systms. Tis ppr mploys vrstil rp mol o n SE tt oul rprsnt ll possil stuk typ trminl ults t t ontrol lins n input/output t lins. Tis tniqu ls to rp mol o ivn MIN, mnl to tstin o its ynmi ull ss (DF) pility. T si strty o mployin jny n rility mtris nls tstin unr vrious omintions o multipl ults. Simultion o vrious ntworks is rri out to vlut t vr pt lnts wi illustrts t t o onntion pttrn on t ntwork prormn. sin mtooloy or implmntin lss o V-input V-output ntworks wit m sts (m < n) o x MIN's is lso outlin so tt DF pility n t mximum vilility oul nsur. Optimlity o su ntwork unr t prsn o ults is vrii y t simultion rsults tt sow nliil inrs in t vr pt lnt. Inx Trms -jny mtrix, vr istn, onntivity, ynmi ull ss pility, rp mol, multist intronntion ntworks, rility mtrix, stuk-t ults. I. INTRODUCTION R ECENT vns in VLSI tnoloy v nour t us o multiprossor n multiomputr systms wit lr numr o prossin lmnts (PE's) n mmory mouls (MM's). In su systms, vrious tniqus r utiliz to support rstruturl t pts twn t PE's n MM's. Tus, t intrommunition is omin n inrsinly omplx ut invitl issu. Svrl sin tniqus or t intrprossor ommunition v n rviw [] n som o tm v n onstrut. T urrnt trn is to mploy multist intronntion ntworks (MIN's) wi rquirs smnttion o t ntwork into svrl sts, wit st prtilly stisyin t input-output onntion rquirmnts. Vrious sin issus o MIN's v n ovr in t litrtur. T min mpsis s n in inin tir quivln n nonquivln n omprin tir prmuttion pilitis []-[8], sinin or onlit-r pr- Mnusript riv Jnury 5, 984; rvis July 7, 984. n rlir vrsion o tis work ws prsnt t t Fourt Intrntionl Conrn on Distriut Computin Systms, Sn Frniso, C, My 4-8, 984. T utors r wit t Dprtmnt o Eltril n Computr Eninrin, Nort Crolin Stt Univrsity, Rli, NC muttions [9], [], loritmi ptility rtristis [], n unrstnin rltiv vnts n isvnts o MIN's []. But not mu ttntion s n pi to t spt o ult tolrn wi is ruil to t sussul oprtion o multipl prossor systm. It s om xtrmly importnt, s MIN's r onsir t rt o prlll systms. Tis ppr is onrn wit t ulttolrnt pility o MIN's wn mploy to provi intrprossor ommunition in multiprossor nvironmnt. T ntwork soul implmnt in su wy tt nontstropi ult my not or omplt sut-o n t systm soul ontinu workin wit ru pity. Tis rul rtion rtristi is not only pnnt on t prossors ilur, ut lso on t MIN's. Similrily, t pt lnt rquir to provi loil link twn two prossors inits t tim ly involv in trnsmittin t inormtion rom sour to ny sir stintion. Tus, vr pt lnts in ot MIN's n sinl-st intronntion ntworks (SSIN's) [3] sm to oo rprsnttiv o tir ommunition lys. T typ o multipl prossor systms w r onrn wit is sown in Fi. [], [4]. In tis systm mol, t PE's wit tir privt mmory mouls provi sir prlllism wil PE-to-PE trnsr is iv trou t MIN. Tus, ll PE's r onnt to ot sis o t ntwork so PE n trnsmit t vi t ntwork input si wil t output is usul in rivin t rom notr PE. ri introution o t MIN's n n ovrviw o xistin tstin tniqus is ovr in Stion II. Our ult mol inluin multipl stuk-t-ults t input-output lins n ontrol lins is sri in Stion III. nrliz tst prour n t us o jny n rility mtris r illustrt in Stion IV. Stion V outlins prour or omputin t stti vr pt lnt unr vrious ulty onitions. Stion VI provis n insit to t optimum sin mtooloy o MIN's so tt lrr numr o ults n tolrt. Finlly, onluin rmrks r inlu in Stion VII. II. MULTISTGE INTERCONNECTION NETWORKS ND EXISTING TESTING TECHNIQUES Svrl o t propos MIN's v n sin usin x SE s si uilin lok. simpl rprsnttion o su n SE is sown in Fi. () n its two possil stts 8-934/85/3-55$. 985 IEEE
2 56 H E-4 H M N ~6 N m CC m r P P * PE P I. I L I - B 9 -G TH Fi.. Intronntion Ntwork Multipl prossor systm orniztion. = o X o- I Y, xl X () y () y () = =- xlo / Y X,O ---( Fi.. () Switin lmnt. () Prlll onntion wit C. () Cross onntion wit C =. () Bslin ntwork or N = 8 (n = 3). r illustrt in Fi. () n (). T prlll n ross onntion o n SE is trmin y t loil lvl ppli t its ontrol lin. n N-input N-output MIN (or simpliity, N is ssum to som powr o ; sy N = C) is onstrut in svrl sts wit st onsistin o N/ SE's. T links twn sussiv sts o t ntwork r ssin in su wy tt input oul onnt to s mny outputs s possil. n n-st ntwork n provi pt twn ny o t N-inputs n to on o t N-outputs n su MIN s n rprou rom [] in Fi. (). T ontrol lins r not sown or lrity o t irm. T prolm o ommunition n t trnsr rt tns to inrsinly ritil wn itr t ntwork lo is vy, or wn som o t lins ppn to ulty. link twn ny input n n ritrry output nnot stlis i onlit ours or rquir lin ppns to ulty. In su situtions, i t r to trnsrr twn ny two PE's o Fi., t t my v to pss to on () EEE TRNSCTIONS ON COMPUTERS, VOL. -34, NO. 3, MRCH 985 or mor intrmit PE's or rin t stintion PE. Ts onsirtions nour us to look into MIN's wit m sts (m n). - T ult inosis or lss o switin ntworks s n sri y Oprmn n Tso-Wu [5]. Ty utiliz squn o tsts to nsur t orrt oprtion o t two possil stts o SE. n unltrl stt o n SE mns tt t ontrol lins r prmnntly stuk t or. Sn n Hys [ 6] v us rp mol or monstrtin t t o ults t t ontrol lins. In tir ult mol, ty onsir t output si to k to t orrsponin input lins, s rroutin o t trou t PE is possil. Ty v mol n SE y no n intronntion link is rprsnt y irt onntin t nos. ulty SE is init y no prtition into two stions. Tir min onrn is to tst wtr, unr ivn ult onition, input o t ntwork oul loilly onnt to ny on o t ntwork outputs in init numr o psss. Ty in tis proprty s t ynmi ull ss (DF) pility. T ontrol lin ults r si to ritil i ty stroy t DF rtristis. T sm mol s n us [7] in nlyzin t ult tolrn o vrious runnt MIN's. T mjor sortomin is to ssum t prsn o ult(s) only t t ontrol input(s). In Stion III, w propos rp mol wi ovroms tis limittion. Nrrwy n So [8] v onsir inosis mol or nrl switin ntwork onstrut wit k-input k-output swits (k > ). Tir si strty is to us known oo onntin t pts in intiyin oo swits n us tis prorssivly in inin ulty onntin pt. Ty o not onsir ults t t ontrol lins. In notr rnt ppr, Wu n Fn [9] v sri simpl tstin tniqu or MIN's. In tir ppr, ty v illustrt 6 irnt possil stts o n SE n ty onsir only two stts (prlll or ross onnt) s ultr situtions n ll otrs r intrprt s ults in t SE's. In tir novl sm, ty rquir only our squns or tstin ny MIN. In t, only two omplmntry squns r n n r rpt or two irnt ontrol sttins o t ntwork, on or prlll-onnt n notr or ross-onnt mos. E squn is slt in su wy tt on-out-o-two o is us in sp. Tis mns tt only on input (n n on output) o SE is m on wil t otr rmins zro. It is wll known tt t proility o loil ults insi n IC ip is quit smll n most o t ults our t t pins []. Tus, it is mor importnt to onsir stuk-t ults t inputs, outputs, n ontrol lins o t SE's. Wu n Fn's loritm n still tst ults t t input n output lin(s) o SE(s). Furtr utiliztion o t sm squns in tstin ontrol lin ult s n ovr in []. notr mol or t ontrol lin ults in Om [] n otr ntworks s rntly n onsir in [3]. Tir optimum -tst squn llows lotion o sinl-st multipl ults n is lpul in rmovin t ulty SE's, i sinl IC ip onstituts st. In notr rnt work [4], sin prours or (n - ) st Bns typ ntwork [5] tt oul tolrt sinl n multipl ults t t ontrol lins v n outlin. omprnsiv rviw o
3 GRWL ND LEU: MULTISTGE INTERCONNECTION NETWORKS 57 tstin tniqus s ppr in rnt pulition [5]. omprison o vrious runnt ntworks s n ivn in [6]. In tis ppr, w vlut t DF pilitis o n-, sinl, n m-st (m < n) MIN's unr stuk-t ults t t ontrol lins s wll s t t inputs n outputs o t SE's. III. FULT MODEL T mol or -input -output SE o Fi. () is sown in Fi. 3() [5], [6]. Tis rp mol is s on t onntivity proprty twn t input lins X n X n output lins Y n o t SE. E on o tm is ssin no. s X (X) o ts [Fi. ()] n onnt to itr Y, or ( or Y), ts r sown y t irt s in t rp mol o Fi. 3(). It is wort mntionin tt t rp mol o Fi. 3() [6] rsmls t rulr SW Bnyn ntwork [7] in pprn. But, inst o usin t SE o Fi. (), t Bnyn is sin wit iniviully ontroll pts n its rp sows t tul link pttrn. Similrly, t rp mol o ross-r swits [8] utilizs on or ross-point n sinl swit ult rmovs n in t rp. In tis wy, our mol o -input -output SE is ltotr irnt rom t Bnyn ntwork. Consirin t SE o Fi. () in, it oul in itr o t two oprtin mos, i no ult is prsnt. But wn t ontrol lin is stuk-t-zro (s--), t rp o Fi. 3() is ru to s sown in Fi. 3(). similr moiition is sown in Fi. 3() wnvr t ontrol lin is s--. T stuk-t ults t t input n output lins o n SE v to trt in irnt wy. I lin is ulty (s--, E, ), tn t lin nnot us to trnsmit ny t. Tis is rlt in t rp mol y rmovin t orrsponin no n n limintin ll t s onntin t no. Tis is sown in Fi. 4() or s- ult t on o t input lins wil Fi. 4() illustrts t mol wn ult is prsnt t on o t output lins. Multipl ults r rprsnt y,,b, n y (, /3, y E, ). Mols or t two possil oul ults r sown in Fi. 4() n (). Fults t t two inputs n outputs l to t mol sown in Fi. 4(), wil ults t ll t input n output lins o n SE limint ll t nos rom t mol. I t ontrol lin is stuk-t- or -, n on o t input or output lins is lso s--, tn t rp mols r ru s sown in Fi. 4() n (). Two possil omintions o ults wit t ontrol lin s-- n two o t input/output lins s-- r ivn in Fi. 4() n (i). In tis wy, Fis. 3() n () n 4()-(i) rprsnt ru rp mol unr ll sinl n multipl ults in n SE. T mol o Fi. 3() oul lso us [5], [6] to rprsnt t uppr n lowr rost us in Om ntwork []. In t s o uppr rost, t uppr input X is snt to ot t outputs Y n wil t lowr rost provis Y = = X. T rp mols o Fis. 3() n () n 4 rmin vli or vrious ults in t SE or Om ntwork. T itionl ulty situtions n t orrsponin ru rps or SE wi lowr n uppr rost, r sown in Fi. 5. Y. '- - Xz~~~~~: x X x () () y X, () Fi. 3. () Grp mol o t SE o Fi. (). () Grp mol o t SE wn C S--O. () Grp mol o t SE wn C s--i. y X -%( * xi () x Y.. X y () () x./ () Y y x s- ' () x Y. * x X () X _l *X () () (i) Fi. 4. () Grp mol o t SE wn X s--. () Grp mol o t SE wn s--. () Grp mol o t SE wn X s-- n s--,b. () Grp mol ot SE wnx, s-- nx s--,8. () Grp mol o t SE wn X s--, Y, s--,l, n s---y. () Grp mol o t SE wn ontrol s-- n X s--. () Grp mol wn ontrol s--o. n Y s--. () Grp mol wn ontrol s--, Xl s--, n s--,l. (i) Grp mol wn ontrol s--, Y, s--l, n s--y. In tis wy, on t SE's v n ppropritly mol, t nlysis is similr or SE's wit n witout rost pility. For onisnss o t txt, w will onsirin t MIN's implmnt wit SE's vin only two vli stts, i.., witout vin ny rost ility. IV. x I GRPH MODEL OF MIN ND ITS DF CPBILITY Bor w o ny urtr, lt us in two mtris, t jny mtrix n t rility mtrix, otin rom t rp mol w illustrt rlir. T jny mtrix o rp is t N x N mtrix [ij] wit ij = i tr is onntin link rom no i to no j in t rp;
4 58 IEEE TRNSCTIONS ON COMPUTERS, VOL. -34, NO. 3, MRCH 985 X - - _ V YI yl yl X () X () XI * v XI I () () ().- X X I Fi. 6. () jny mtrix o t SE o Fi. (). () jny mtrix o t SE o Fi. (). () jny mtrix o t SE o Fi. (). () Fi. 5. () Grp mol o n SE or Om ntwork wn s- uppr rost. () Grp mol wn s- lowr rost. () Grp mol wn s- uppr rost n X s--y. () Grp mol wn s- lowr rost n s--y. otrwis, ij =. Fi. 6() sows t jny mtrix o t iprtit irt rp [9] o * SE o Fi. (). Wn t ontrol lin is s-- or s--i, t mtris r s sown in Fi. 6() n (), rsptivly. T rility mtrix R o rp is in s n N*N mtrix [rj] wit rij = i noj is rl rom no i, n rij = otrwis. Hr, t inormtion w n rom t rility mtrix is wtr n input port o MIN n r n output port or not, n trtr, it is not nssry to rtin ny onntivity inormtion rom t input nos to t intrmit nos [.., no numrs -6 in Fi. 7()]. T rp mol o * SE ivn in Fi. 3() n us to otin t rp mol or t slin ntwork o Fi. () n is sown in Fi. 7(). T jny mtris o o t tr sts r sown in Fi. 7(), (), n (), rsptivly. Corollry : In n mr-st MIN, lt i t jny mtrix o t iprtit irt rp o t it st rprsntin its onntivity, tn R, t rility mtrix rom input nos to output nos o t MIN, oul ivn y R x m i. i= Proo: T proo is ovious. Now w n omput t rility mtrix R y multiplyin t jny mtris I,, n 3 n t rsultin R mtrix is sown in Fi. 7(). In similr wy, t mol oul otin or MIN wit ny numr o sts n wit ny numr o ritrrily lot ults n t R -mtrix oul us to tst or t DF pility. For xmpl, onsir t multipl sinl ults o Fi. 8(). s sown in t orrsponin rp mol o Fi. 8(), no n 8 s v n limint us o t ults. T jny mtris or st,, 3 r ivn in Fi. 8(), (), n (), rsptivly. T rility - mtrix, R = * 3 ivn in Fi. 8() sows tt not ll input nos n r ll t output nos. I multipl psss r llow (i.., output n k to t input si), tn itionl nos n ss in sussiv psss. Corollry : Lt R t rility mtrix o MIN, () C D o o o ' O O () B C D E O O () 8 I F G H () t O B IE O O O O O O O O () B C D E I. () F F G H I Fi. 7. () Grp mol or t slin ntwork o Fi. (). (),, irst-st jny mtrix or MIN o Fi. 7(). (), son-st jny mtrix or MIN o Fi. 7(). () 3, tir-st jny mtrix or MIN o Fi. 7(). () R, rility mtrix or MIN o Fi. 7().
5 GRWL ND LEU: MULTISTGE INTERCONNECTION NETWORKS 59 s-- B C D E F G H () () I () () O O O O BFGH () B C D E F G H O O () () Fi. 8. () Bslin ntwork wit ults. () Grp mol o t slin ntwork o Fi. 8(). () jny mtrix in irst st. () jny mtrix in son st. () jny mtrix in tir st. () R, t rility mtrix. () R or Fi. 8(). () R3 or Fi. 8() i B C D E F G H O I O O o O O O O O O O O O - B C D E F GH O O O > I I ' O O O O O O J () B C D E F GH. () BCDEFGH tn t rility in K psss (n n, its DF) oul ivn y Rk = Rk. Proo: T proo is sl-xplntory. DF is in s proprty tt provis input o t ntwork to onnt to ny on o its outputs in init numr o psss (n n, ny PE to ny otr PE). T R -mtrix o Fi. 8() sows tt t ntwork o Fi. 8() os not llow ll input nos to onnt to on o t output nos. But y multiplyin tr tims, it oul osrv [Fi. 8()] tt tr psss trou t ntwork o Fi. 8() r oo nou to provi ommunition pts rom ny input to ny on o t output nos. Hn, t DF proprty is stisi. It my not tt its DF oul not rtin or otr omintions o ults. For xmpl, n itionl s-- t t ontrol input o SE II in t ntwork o Fi. 8() ls to rp mol o Fi. 9(). Tis rp is lrly ivi into two unonnt surps, on onsistin o t input nos n n t output nos, B, n C, n t otr ontinin t rst o t input n output nos. Tis oul lso sn rom t rility mtrix o Fi. 9() wi oul prtition s two smllr nonzro sumtris s sown in t iur. Tis will tru or ny su s i R oul prtition s [9]. R =[~R' wr R' n R" r t two nonzro sumtris. Tis osrvtion oul sily vrii y otinin t rility mtris in two, tr, n our psss o t ntwork n is sown in Fi. 9(), (), n (), rsptivly. s R6 = R5 = R4, it is lr tt no mttr ow mny tims w multiply, w will nvr l to t ny ttr rsult. Tis mns t ntwork no lonr posssss t DF pility. Torm : In n N-input N-output MIN, t DF rtristi is srtin or sinl or multipl ults t t ontrol lin n/or input n output lins o on or mor SE's - i tr xists rility mtrix Rk ( S k N) in
6 6 IEEE TRNSCTIONS ON COMPUTERS, VOL. -34, NO. 3, MRCH 985 R C B C D E F G H o o II?II I o o o o o I n o o! O O OWrO - ''i i li Ij ' I R O O O -I O% O II I O () B C D X O O O O () E F G H I () C C B C D E F 'O O O O O O O O O O O () B C D E O O O () F GH F G H. * Fi. 9. () Grp mol o t slin ntwork o Fi. 8() wit t ontrol input o SE-II s--. () R, t rility mtrix. () RorFi. 9(). () R3 or Fi. 9(). () R' R3 or Fi. 9(). < - k psss, su tt rk = or ll i,j; i,j N. Proo: I MIN s t DF proprty in minimum o k psss tn Rj = Rj_ j S k. Tis mns tt ny input no o t ntwork oul r t lst on output no (irnt tn itsl s k is ssum) tr t irst pss, n trtr it will l to r t lst on itionl output no in sussiv psss. Tus, input no soul l to r ll N output nos in t most N psss i t ntwork s t DF pility. Tis mns tt n Rk ( k 6 N) must xist su tt rk = or ll i,j, S i,j 6 N. Wn tis is stisi, w will l to onnt ny input no to ny on o t output nos in t most k psss. Q.E.D. Corollry 3: I tr r ny stuk typ ults t t input si or t output si o MIN (rintr ll primry B C D () B C D E F E F G H I o: ( < () B C D X o 3 3. OD X X o Xo (C) G H w E F G I Fi.. () Distn mtrix or Fi. 7(). () Distn mtrix or Fi. 8(). () Distn mtrix or Fi. 9(). inputs n outputs, rsptivly), tn t DF proprty nnot provi. Proo: I tr is ult t ny on o its output lins, tn it is ovious tt notin n trnsmitt on tt lin, n n t orrsponin PE nnot riv ny t. In trms o t rp mol, t output lin nnot ss y ny on o t inputs. Similrly, i tr is ult t ny on o t input lins, tn it nnot ommunit to t output lins, n n t orrsponin PE nnot sn ny t. H Q.E.D. Torm : T ults in t MIN my stroy its DF pility i n only i tr xist t lst two rility mtris R' n R + or < N, su tt rz = r+t' or ll i,j; > i,j % N n t lst on rt = or ny i,j;. i,j -N Proo: I som ults in t MIN us it to los t DF proprty, tn tr rmins t lst on pir o input n output nos i n j tt nnot onnt in init numr o stps n is init y n ntry o rk =. Morovr, i R'+ = R' tn ll sussiv powrs o R (i.., R'+ n so on) will rmin qul to R'. Tis mns tt t
7 GRWL ND LEU: MULTISTGE INTERCONNECTION NETWORKS 6 () () Fi.. () 6-input 6-output Om typ SSIN. () Moii vrsion o SSIN. onntion rom i to j n nvr provi or ny numr o psss. Q.E. D. Corollry 4: In n N-input N-output MIN, RP+', t rility mtrix witin p + psss is qul to RP or ll p N. Proo: s pr Torm, i tr xists pt rom n input to n output no, tn t mximum numr o psss rquir is qul to N. Hn, tr N psss, w out to v t orrsponin $ lmnt o RN s n ny urtr pss nnot moiy t rility lmnts, n n ij lmnts. Hn, RN+ out to rmin t sm s RN. Q.E.D. V. DISTNCE MTRIX ND VERGE PTH LENGTH OF THE MIN's T istn mtrix D [9] o MIN is in s n N x N mtrix [ij] wit t ntris wn i j jj =t lst I (i ny) su tt rtj = in RI; < I < N oo otrwis. T ntris init t numr o t psss n or rqust to r t stintion. Fi. (), (), n () sows t istn mtris o t ntworks o Fis. 7(), 8(), n 9(), rsptivly. Corollry 5: I no onlit in pt lnt is ssum or t rnom rqusts, tn t vr o t minimum pt lnt (ll t stti vr n rprsnt y SV), n omput rom t istn mtrix D s ollows: SV =i N i=l j=l wr 6 rprsnts t ly tim n in pss. tr w v t ntris or t rility mtris o MIN, it is sy to st t istn mtrix n lult t vr pt lnts. On w v ll ts rsults, w my xmin t qustion o wtr t ntwork is t st rom t SV viwpoint or not. In otr wors; oul w v ttr SV y nin t link onntion pttrns or oin somtin ls? Tis spt oul sily xmin t lst or som o ntworks lik sinl-st intronntion ntwork (SSIN) [4], [3]. T minimiztion o pt lnts in n SSIN s n ovr in [3] n w ruls v n sust or inin t onntion pttrn in n SSIN. But t t o ults on t SV s nvr n onsir. simultion prorm is implmnt to osrv t prormn o 6 input 6 output SSIN (on st o t Om ntwork [] oniurtion) n t moii vrsion s sown in Fi. () n (). Fi. inits t t o nin t onntion pttrn wn no ults r prsnt. T impt o sinl ult on t SV is sown in Fi. 3 n t moii vrsion is sn to provi ttr pr- N N
8 6 IEEE TRNSCTIONS ON COMPUTERS, VOL. -34, NO. 3, MRCH 985 Ur) 4.' tol n I), Oi {L n - C, 9-4., ) C- IL) IN typc om r-moiii tin ( om typ to- -moi4i 9 7 I o m 6 Fi.. T t o nin onntion pttrns wn no ult is prsnt in 6-input 6-output SSIN. I I. 8 I l o m 6; Fi. 5. T t o nin onntion pttrn wn sinl ult ours in t ontrol lin t t irst st o -st 6-input 6-output ntwork. m I, 4) v ILD.,,W. 4.) -' L ti, qin.e. CL '4- to 'WI L )--_-. om typ moii om m i 4 i typ ' 7 3 B ]lo i 6C Fi. 3. T t o nin onntion pttrn wn sinl ult ours in ontrol lin o 6-input 6-output SSIN. 7 I. L lo 6 Fi. 6. T t o nin onntion pttrn wn sinl ult ours in t ontrol lin t t son st o -st 6-input 6-output ntwork. C. 'F C. 4., C, _-4 om -': o/ ^ molii. typ - M 7 3 l lo J Fi. 4. T t o nin onntion pttrn wn no ult ours in t -st 6-input 6-output ntwork. ; I. om mo i 4 i typ 4 7 o 6 Fi. 7. T t o nin onntion pttrn wn sinl ult ours in t link twn sts o -st 6-input ntwork.
9 GRWL ND LEU: MULTISTGE INTERCONNECTION NETWORKS ormn. T nxt qustion to rss is wtr su onlusions r vli or nrl MIN wit svrl sts. Som onlusiv simultion rsults r otin rom t omputr prorm. Unr no ults, Fi. 4 sows t t o nin onntion pttrn rom -st 6-input 6-output Om-typ ntwork to moii vrsion. Fis. 5, 6, n 7 sow t prormns o ts -st ntworks wn sinl ult ours in ontrol lin t t irst st, son st, or t link onntin t two sts, rsptivly. 63 B VI. OPrIMuM DESIGN OF MIN FOR DF CPBILITY T m-st MIN sin wit m = n s n wily ovr in t litrtur []-[4], [7]-[]. Ts ntworks r sin in su wy tt tr is on-to-on orrsponn twn input n output nos, i.., rom input lin, tr is uniqu pt to on o t output lins, n ull onntivity rquirmnts r stisi. Systmti wys o sinin ts ntworks v lso n sri [6]. For m > n, ltrnt pts twn input-output pir provis runny n rnt work [6] provis til ount o tir ult-tolrnt pilitis. Our min onrn is to sri sin mtooloy or lss o MIN's, wit m < n, so tt t vilility n rul rtion o t prlll omputin systm oul optimiz. In otr wors, t ntwork oul sin su tt t DF proprty oul rtin or s mny ults s possil. ltou it my possil to vis otr sms too, t propos mtooloy os provi rtin r o optimlity rom t DF viw point. T sin prour is s on st tory. T two stps r s ollows. ) Prtition t N (= ') inputs n outputs into N/(m) sts wit st onsistin o m inputs n " outputs. B) Dsin t mr-sts o t ntwork su tt m-inputs o on st oul onnt to m-outputs o notr st. Tus, st will onsist o m sts, wit st orm wit '- SE's. In tis wy, o t suntworks oms ully onnt ntwork o siz m inputs n ' outputs. On su xmpl or m = n n = 4 is sown in Fi. 8, wrin 6 inputs n 6 outputs r ivi into our susts wit roup onsistin o our lmnts. T input susts r (,,, ), (,,, ), (i,j, k, ), n (m, n, o, p), wil t outputs r ivi into (, B, C, D), (E,F,G,H), (I,J,K,L), n (M,N,O,P) susts. Tis stisis prt ) o t sin prour. Prt B) is ssur y ssinin output nos in su wy tt tr is no ommon lpt twn t inputs n outputs o sust. In otr wors, t outputs rom t input no sust (,,, ) r not onnt to t output no sust (, B, C, D). It must kmmr tt or t multipl prossor systm o Fi., ot nos n r loilly t sm, s t PE works s link twn t input-output pir n. Hn, no vnt is in y onntin nos n trou t MIN. Su sin prour or n ritrry vlu o m < n is sown in Fi. 9. Bor w o y6 ~ \\ Fi. 8. p~~~6 Two-st MIN wit sinl stuk typ ults t vrious SE's (only on roup o 4-SE's, V, VI, VIII, n XIV, not ulty). onsir t optimlity o our sin prour, tr lmms r in orr. Lmm : In t ult-r prtition o mr m SE's onntin m inputs n orrsponin outputs, ny input n ss ny on o its outputs in just on pss. Proo: T sin mtooloy sri rlir mks o t prtition ntworks MIN wit m inputs-m outputs. Morovr, t R-mtrix o prtition oul sn to ontin ll on lmnts n n DF is stisi in only on pss. Hn, ny o its inputs n ss ll o its output lins in on pss. Q.E.D. Lmm : In prtition roup onsistin o m * m' SE's n onntin m inputs n t orrsponin output lins, i som or ll SE's v sinl ults (xpt t t primry input n output lins), tn primry input lin n onnt to t lst on o t primry output lins. Proo: From Fi. 3() n (), it is ovious tt ult t t ontrol lin o n SE llows input to onnt to on output. sinl ult t on o t inputs o t SE llows t otr input to onnt to ot t outputs [Fi. 4()] n sinl ult t t output si o t SE prmits ot inputs to onnt to t nonulty output [Fi. 4()]. It my not rom Fis. 3 n 4 tt ult t n input (output) lin is rlt s ult t t orrsponin output (input) lin. Hn, simultnous ults t n input n n output lin o t sm SE r onsir multipl ult. s t primry input n output lins o t MIN r
10 64 IEEE TRNSCTIONS ON COMPUTERS, VOL. -34, 3, NO. MRCH 985 ~ Inputs * outputs k pt trou t orrsponinpe tks us to no o t son prtition. T son pss tks us to on m Inputs o t outputs outputs o tir prtition n so on. In t worst s, op - m Iti will tk (K ) psss or w r t Kt prtition. t s tis roup ontins ll lty SE's n t orrsponin / io outputs R mtrix ontins ll "" lmnts, t nxt pss n tk us ttoll t output nos o t Kt prtition. Now, t - m /*p 3,; * - minputs j* ss to ll ' inputs o t irst prtition is possil. k pt troupe's tks us k to t irst prtition n E4,v/,* T nxt pss provis ss to ll ' outputs o t Inputs * t m outputs son prtition. I tis pross is ontinu, totl o (K - + K) = (K-) psss is rquir to ss ny on o t output nos. Q.E.D. Fi. 9. Optimum sin o n m-st MIN. Lmm 4: T mximum numr o tolrl ontrol lin ults, unr t onitions ivn in Torm 3, is ssum to ult r, on input n onnt to t m (n--m-). lst on output lin. Tis n lso prov usin t Proo: For ivnmr-st ninput-' output MIN, t jny mtris or st n y usin t rsultnt numr o SE's in on st = n-, so t totl numr o on-pss rility mtrix. Q.E.D. SE's = m *. T numr o prtitions ="- n t Lmm 3: spil s o Lmm riss wn t numr o SE's in on prtition =m* m'. orin to ontrol lins o ll t swits r stuk-t-zro or -on; tn t sttmnt in Torm 3, only on prtition is ssum to t rp mol or prtition ntwork will ontin m ult r wil ontrol lins in ll otr prtitions my unonnt surps, wit on irt rom on ulty. Tror, t mximum numr o tolrl ontrol primry input to only on o t primry outputs. lin ults =mr (n - m-). Q.E.D. Proo: From Fi. 3() n (), wnvr t ontrol Lmm 5: T mximum numr o tolrl link lin lin o n SE is ulty, tr is on-to-on onntion. Tis ults unr t onitions ivn in Torm 3 is mns only on input is onnt to on n only on o t (m - ) * (Q -"- ). outputs, n n t jny mtrix or st will Proo: For ivnm-st n-input-n output MIN, v only on nonzro lmnt or row n ol- tr r (m - ) intrmit onntions twn t umn. Hn, t ovrll R-mtrix will lso v only on " " sts n " link lins or st. Hn, tr is totl ntry in row n olumn. Tis woul l to n o (m- )n intrmit links (xpt t primry inputs ovrll on-to-on onntion, wit m unonnt su- n outputs). E prtition will onsist o (m - )' intrrps or roup. Q.E.D. mit links. s only prtition is ssum to ult T optimlity o t sin in trms o DF pility is r n sinl link ilur pr SE is llow in ll otr monstrt y t ollowin torm. prtitions, t totl numr o tolrl link ults = Torm 3: Ininput-'outputMINisimplmnty /(m - ) (n - m) = (m - )(n- m-) Q.E. D. mr-sts (m < n) orin to t sin prours ) n Sin t numr o ults tolrl in our sin is irly B), tn DF pility is nsur or multipl sinl ults los to t numr o SE's in t ntwork, w oul lim provi ttm r m` SE's onstitutin on prtition o m tt our mtooloy provis los to optiml solution. s inputs n m outputs r ssum ult r. T uppr n xmpl, t rp mol o t MIN sown in Fi. 8 oun or t numr o psss rquir to provi t DF wi ontins svrl sinl ults is provi in Fi.. is (`.i) wr K = -. T rility mtrix in t irst pss is ivn in Fi.. Proo: T rp mols or possil sinl ults v Unr t rnom rqust loin n los-to-inis rin ivn in Fis. 3() n () n 4() n (). T on- trtion [3], t omputr simultion mntion rlir prontivity onsirtion (n t jny mtrix), is im- vis t prormns o t MIN o Fi. 8 n is sown portnt or t DF pility. typil m-st MIN is in Fi.. T vr pt lnts r omput or no sown in Fi. 9. Tn t worst s ult oul si to ult s n wn sinl ult is prsnt t itr t prsnt wn t SE's o ll t (K - ) prtitions r ontrol lin o itr st or t link onntin t two ulty. For simpliity (n witout losin t nrlity) lt sts. T rsultin urvs init tt sinl ult s us ssum tt t kt prtition is lty. T rility vry mrinl inrs on t vr tim ly n oul mtrix R or prtition oul otin n t onsir to vry vlul simultion rsult to sup- R-mtrix or t irst (K - ) prtitions woul stisy port our lim tt our sin is oo n los to optiml Lmm wil Lmm is pplil to t lst prtition. rom ult-tolrn viwpoint> It s not n possil to s intrprt rlir, in t irst (K - ) prtitions, on ompr our sin mtooloy to otrs, s, to t st o pss woul llow ny input to onnt to t lst on o our knowl, tr os not xist ny su tniqu in t t outputs; wil t Kt prtition woul llow ny input to litrtur. onnt to ny on o its outputs in on pss. Corollry 6: T rstrition impos y Torm 3 is not nssry onition or t DF proprty. Lt us ssum tt w strt ss rom on o t inputs o t irst prtition. Unr t ssum ults, t irst pss Proo: Torm 3 is suiint or nsurin DF, ut will llow ss to t lst on o its output nos n t not nssry. T ults my su tt t R-mtrix l-
11 J IC ~ ~~~~~~~~ L i I- M, N * ~ ~~~~~ k * _ ~~~~~~~~~~~~C,+ i P m n l - 4 B jv --.~'. u - ost SE s--x B.-S--- st SE --x link --x 7 L L Fi.. lo w 6 T t o t sinl ults tt our in -st 6-input 6-output ntwork. GRWL ND LEU: MULTISTGE INTERCONNECTION NETWORKS 65 F G 6 -> C' K p 66 Fi.. rp mol o Fi. 8. D B B C D E F G IIJ K L M N O p O () i o (o o j k m n D E F p Fi.. R, t rility mtrix or Fi.. mnts my ontin ritrry l's n t multipl pss (n, multiplition o t R mtrix to itsl) my l to n R' mtrix wit ll "" ntris. Q.E.D. On su xption is illustrt in Fi. 3, wi n si to possss i r o ult tolrn. Tus, our sin prour is vry usul in implmntin MIN wit t DF pility in t prsn o ults. Torm 3 intiis t st o sinl ults t t SE's so tt it is possil to srtin t DF rtristi vn witout otinin rp mol n witout prormin lot o onntivity n rility omputtion. _ - () Fi. 3. () On-st MIN wit 4 ults. () Grp mol or Fi. 3(). VII. -- _ CONCLUDING REMRKS T ult mol o n SE is us to mol MIN's, n n jny mtrix n rility mtris r mploy to provi systmti prour o tstin t ntwork's DF pility. T vrstility o t ult mol nls us to tst t ntwork unr multipl stuk typ ults ot t t ontrol lins n t input-output lins o t SE's. In ition,
12 IEEE TRNSCTIONS ON COMPUTERS, VOL. -34, NO. 3, MRCH t R-mtrix in sussiv psss is lso usul in omputin t vr pt lnt. T ntwork sin prour nls t MIN to posss mximum ult tolrn, n n in turn optimizs t vilility o t systm. T sltion o onntion pttrn is sn to ky issu in minimizin t pt lnts in ot t SSIN's n MIN's wi oul lso us s n inx or t prormn. I w onsir t ult tolrn s wll s t minimiztion o t pt lnts simultnously, tn t optimiztion prolm o t MIN oms xtrmly omplx n w op to prsnt itionl rsults in t nr utur. REFERENCES [] D. P. rwl n T. Y. Fn, " stuy o ommunition prossor systms," Rom ir Dvl. Cntr, T. Rp. RDC-TR-79-3, D [] C. L. Wu n T. Y. Fn, "On lss o multist intronntion ntworks," IEEE Trns. Comput., vol. C-9, pp , u. 98. [3] H. J. Sil, "T tory unrlyin t prtitionin o prmuttion ntworks," IEEE Trns. Comput., vol. C-9, pp. 79-8, Spt. 98. [4] D. K. Prn n K. L. Konpni, " uniorm rprsnttion o sinl- n multi-st intronntion ntworks us in SIMD mins," IEEE Trns. Comput., vol. C-9, pp , Spt. 98. [5] D. P. rwl, "On rp torti ppro to n- n (n - I)-st intronntion ntworks," in Pro. 9t nnu. llrton Con. Commun. Contr. Comput., Spt. 3-Ot., 98, pp "Grp torti nlysis n sin o multist intronntion [6] ntworks," IEEE Trns. Comput., vol. C-3, pp , July 983. [7] L. N. Buyn n D. P. rwl, "Dsin n prormn o nrl lss o intronntion ntworks," in Pro. 98 Int. Con. Prlll Prossin, u. 4-7, 98, pp. -9; lso in IEEE Trns. Comput., vol. C-3, pp. 8-9, D [8] D. P. rwl n S.C. Kim, "On non-quivlnt multist intronntion ntworks," in Pro. t Int. Con. Prlll Prossin, u. 5-8, 98, pp [9] M.. ii n D. P. rwl, "On onlit-r prmuttions in multist intronntion ntwork," J. Diitl Syst., vol. V, no., pp. 5-34, Summr 98., "Two sinl pss prmuttions in multist intronntion nt[] works," in Pro. 98 Con. Inorm. Si. Syst., Mr. 6-8, 98, pp [] D.. Pu, D. J. Kuk, n D. H. Lwri, "Hi-sp multiprossors n ompiltion tniqus," IEEE Trns. Comput., vol. C-9, pp , Spt. 98. [] C. L. Wu n T. Y. Fn, "T rvrs-xn intronntion ntwork," IEEE Trns. Comput., vol. C-9, pp. 8-8, Spt. 98. [3] J. E. Wirsin n T. Kisi, "Minimiztion o pt lnts in sinl st onntion ntworks," in Pro. 3r Int. Con. Distri. Comput. Syst., Ot. 8-, 98, pp [4] C. L. Wu, T. Fn, n M. Lin, "Str: lol ntwork or rl-tim mnmnt o imry t," IEEE Trns. Comput., vol. C-3, pp , Ot. 98. [5] D. C. Oprrmn n N.T. Tso-Wu, "On lss o rrrnl switin ntworks, Prt Il: Enumrtion stuis n ult inosis," Bll Syst. T. J., pp. 6-68, My/Jun 97. [6] J. P. Sn n J. P. Hys, "Fult tolrn o lss o onntin ntworks," in Pro. 7t Symp. Comput. r., L Bul, Frn, My 6-8, 98, pp [7] J. P. Sn, "Fult tolrn nlysis o svrl intronntion ntworks," in Pro. 98 Int. Con. Prlll Prossin, u. 4-7, 98, pp. -. [8] J. J. Nrrwy n K. M. So, "Fult inosis in intr-prossor switin ntworks," in Pro. Int. Con. Cir. Comput., Ot. -3, 98, pp [9] C. L. Wu n T. Y. Fn, "Fult-inosis or lss o multist intronntion ntworks," in Pro. 979 Int. Con. Prlll Prossin, u. -4, 979, pp [] D. P. Siwiorik t l., " s stuy o C*mmp, Cm*, n C*vmp: Prt I-Exprins wit ult tolrn in multiprossor systms," Pro. IEEE, vol. 66, pp. 78-, Ot [] D. P. rwl, "utomt tstin o omputr ntworks," in Pro. 98 nt. Con. Cir. Comput., Ot. -3, 98, pp [] D. K. Lwri, "ss n linmnt o t in n rry prossor," IEEE Trns. Comput., vol. C-4, pp , D [3] K. M. Flvrini n D. K. Prn, "Fult-inosis o prlll prossor intronntion ntworks," in Pro. 98 Fult Tolrnt Comput. Symp., Jun 98. [4] S. Sowrirjn n S. M. Ry, " sin or ult-tolrnt ull onntion ntworks," 98 Con. Inorm. Si. Syst., pp [5] D. P. rwl, "Tstin n ult-tolrn o multist intronntion ntworks," IEEE Computr, vol. 5, pp. 4-53, pr. 98. [6] D. P. rwl n D. Kur, "Fult tolrnt pilitis o runnt multist intronntion ntworks," in Pro. Rl-tim Syst. Symp., rlinton, V, D. 6-8, 983, pp [7] L. R. Gok n G. J. Lipovski, "Bnyn ntworks or prtitionin o t multiprossor systms, " in Pro. I st nnu. Symp. Comput. r., D. 973, pp. -8. [8] G. M. Msson, G. C. Ginr, n S. Nkmur, " smplr o iruit switin ntworks," IEEE Computr, vol., pp. 3-48, Jun 979. [9] F. Hrry, Grp Tory. Rin, M: ison-wsly, 97. [3] P. Y. Cn, P. C. Yw, n D. Lwri, "Prormn o pkt switin in ur sinl-st sul-xn ntworks," in Pro. 3r Int. Con. Distri. Comput. Syst., Ot. 8-, 98, pp Drm P. rwl (M'74-SM'79) ws orn in Blo, Ini, on pril, 945. H riv t B.E. r in ltril ninrin rom t Rvisnkr Univrsity, Ripur, Ini, in 966, t M.E. (ons.) r in ltronis n ommunition ninrin rom t Univrsity o Roork, Roork, Ini, in 968, n t D. S. T. r rom t Frl Institut o Tnoloy, Lusnn, Switzrln, in 975. H s n Mmr o t Fulty in t M.N. E + X Rionl Eninrin Coll, l, Ini, t Univrsity o Roork, t Frl Institut o Tnoloy, Soutrn Mtoist Univrsity, Dlls, TX, n Wyn Stt Univrsity, Dtroit, MI. Currntly, is wit t Nort Crolin Stt Univrsity, Rli, s Prossor in t Dprtmnt o Eltril n Computr Eninrin. His rsr intrsts inlu prlll/istriut prossin, omputr rittur, ult tolrn, n inormtion rtrivl. Dr. rwl s srv s Rr or vrious rput journls n intrntionl onrns. H ws Mmr o Prorm Committs or t COMPCON Fll o 979, t Sixt IEEE Symposium on Computr ritmti, n Svnt Symposium on Computr ritmti. Durin t yrs srv s Mmr n t Srtry o t IEEE Computr Soity Pulitions Bor, n s n wr t Soity's "Crtiit o pprition" or is srvis. Currntly, is t Cirmn o t Ruls o Prti Committ o t Pulitions Bor. H ws t Trsurr o t IEEE-CS Tnil Committ on Computr rittur n s t Prorm Cirmn or t Tirtnt Intrntionl Symposium on Computr rittur l in Jun 984. H s n Co-Gust Eitor o t IEEE Trnstions on Computrs Spil Issu on Computr ritmti n is n Eitor o t nw Journl on Prlll n Distriut Computin pulis y mi Prss. H is lso Distinuis Visitor o t IEEE Computr Soity. H is list in Wo's Wo in t Miwst, t 98 Outstnin Youn Mn o mri, n in t Dirtory o Worl Rsrrs 98's sujts pulis y t Intrntionl Tnil Inormtion Institut, Tokyo, Jpn. H is mmr o t CM, SIM, n Sim Xi. J-Son Lu (S'84) ws orn in Yun-Lin, Tiwn, on Otor 5, 957. H riv t B E. r in EECS in 98 rom Cun-Yun Coll, Tiwn,. i -55u. > t M.S. r in omputr stuis rom Nort Crolin Stt Univrsity, Rli, in 983, n is now Rsr ssistnt workin towrs t P.D. r in t Dprtmnt o Eltril n Computr Eninrin, Nort Crolin Stt Univrsity. His urrnt intrsts inlu prlll/istriut prossin n omputr ommunition.
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, 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 informationlearning 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 informationPresent 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 informationGrade 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 informationd 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 information16.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 informationOpenMx 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 information1 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 informationTangram 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 informationVLSI Testing Assignment 2
1. 5-vlu D-clculus trut tbl or t XOR unction: XOR 0 1 X D ~D 0 0 1 X D ~D 1 1 0 X ~D D X X X X X X D D ~D X 0 1 ~D ~D D X 1 0 Tbl 1: 5-vlu D-clculus Trut Tbl or t XOR Function Sinc 2-input XOR t wors s
More information(2) If we multiplied a row of B by λ, then the value is also multiplied by λ(here lambda could be 0). namely
. DETERMINANT.. Dtrminnt. Introution:I you think row vtor o mtrix s oorint o vtors in sp, thn th gomtri mning o th rnk o th mtrix is th imnsion o th prlllppi spnn y thm. But w r not only r out th imnsion,
More informationComplete Solutions for MATH 3012 Quiz 2, October 25, 2011, WTT
Complt Solutions or MATH 012 Quiz 2, Otor 25, 2011, WTT Not. T nswrs ivn r r mor omplt tn is xpt on n tul xm. It is intn tt t mor omprnsiv solutions prsnt r will vlul to stunts in stuyin or t inl xm. In
More informationECE 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 informationOutline. 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 informationOutline. 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 informationEE1000 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 informationCycles 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 informationMath 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 informationMultipoint 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 informationPaths. Connectivity. Euler and Hamilton Paths. Planar graphs.
Pths.. Eulr n Hmilton Pths.. Pth D. A pth rom s to t is squn o gs {x 0, x 1 }, {x 1, x 2 },... {x n 1, x n }, whr x 0 = s, n x n = t. D. Th lngth o pth is th numr o gs in it. {, } {, } {, } {, } {, } {,
More informationLecture 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 informationCS 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 informationSTRUCTURAL GENERAL NOTES
UILIN OS: SIN LOS: RUTURL NRL NOTS NRL NOTS: US ROUP: - SSMLY USS INTN OR PRTIIPTION IN OR VIWIN OUTOOR TIVITIS PR MIIN UILIN O STION. SSONL. T UNTION O TIS ILITY IS NOT OR QUIPP OR OUPNY URIN WINTR/ TIN
More informationOutline. Binary Tree
Outlin Similrity Srh Th Binry Brnh Distn Nikolus Austn nikolus.ustn@s..t Dpt. o Computr Sins Univrsity o Slzur http://rsrh.uni-slzur.t 1 Binry Brnh Distn Binry Rprsnttion o Tr Binry Brnhs Lowr Boun or
More informationQUESTIONS 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 informationBASIC CAGE DETAILS SHOWN 3D MODEL: PSM ASY INNER WALL TABS ARE COINED OVER BASE AND COVER FOR RIGIDITY SPRING FINGERS CLOSED TOP
MO: PSM SY SI TIS SOWN SPRIN INRS OS TOP INNR W TS R OIN OVR S N OVR OR RIIITY. R TURS US WIT OPTION T SINS. R (UNOMPRSS) RR S OPTION (S T ON ST ) IMNSIONS O INNR SIN TO UNTION WIT QU SM ORM-TOR (zqsp+)
More informationThe 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 informationWeighted 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 information5/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 informationDesigning 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 informationModule graph.py. 1 Introduction. 2 Graph basics. 3 Module graph.py. 3.1 Objects. CS 231 Naomi Nishimura
Moul grph.py CS 231 Nomi Nishimur 1 Introution Just lik th Python list n th Python itionry provi wys of storing, ssing, n moifying t, grph n viw s wy of storing, ssing, n moifying t. Bus Python os not
More informationBASIC CAGE DETAILS D C SHOWN CLOSED TOP SPRING FINGERS INNER WALL TABS ARE COINED OVER BASE AND COVER FOR RIGIDITY
SI TIS SOWN OS TOP SPRIN INRS INNR W TS R OIN OVR S N OVR OR RIIITY. R IMNSIONS O INNR SIN TO UNTION WIT QU SM ORM-TOR (zqsp+) TRNSIVR. R. RR S OPTION (S T ON ST ) TURS US WIT OPTION T SINS. R (INSI TO
More informationSeven-Segment Display Driver
7-Smnt Disply Drivr, Ron s in 7-Smnt Disply Drivr, Ron s in Prolm 62. 00 0 0 00 0000 000 00 000 0 000 00 0 00 00 0 0 0 000 00 0 00 BCD Diits in inry Dsin Drivr Loi 4 inputs, 7 outputs 7 mps, h with 6 on
More informationCSE 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 informationQUESTIONS BEGIN HERE!
Points miss: Stunt's Nm: Totl sor: /100 points Est Tnnss Stt Univrsity Dprtmnt of Computr n Informtion Sins CSCI 710 (Trnoff) Disrt Struturs TEST for Fll Smstr, 00 R this for strtin! This tst is los ook
More informationWhy the Junction Tree Algorithm? The Junction Tree Algorithm. Clique Potential Representation. Overview. Chris Williams 1.
Why th Juntion Tr lgorithm? Th Juntion Tr lgorithm hris Willims 1 Shool of Informtis, Univrsity of Einurgh Otor 2009 Th JT is gnrl-purpos lgorithm for omputing (onitionl) mrginls on grphs. It os this y
More informationExperiment # 3 Introduction to Digital Logic Simulation and Xilinx Schematic Editor
EE2L - Introution to Diitl Ciruits Exprimnt # 3 Exprimnt # 3 Introution to Diitl Loi Simultion n Xilinx Smti Eitor. Synopsis: Tis l introus CAD tool (Computr Ai Dsin tool) ll Xilinx Smti Eitor, wi is us
More informationEdge-Triggered D Flip-flop. Formal Analysis. Fundamental-Mode Sequential Circuits. D latch: How do flip-flops work?
E-Trir D Flip-Flop Funamntal-Mo Squntial Ciruits PR A How o lip-lops work? How to analys aviour o lip-lops? R How to sin unamntal-mo iruits? Funamntal mo rstrition - only on input an an at a tim; iruit
More informationUsing 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 informationIn 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 informationAn undirected graph G = (V, E) V a set of vertices E a set of unordered edges (v,w) where v, w in V
Unirt Grphs An unirt grph G = (V, E) V st o vrtis E st o unorr gs (v,w) whr v, w in V USE: to mol symmtri rltionships twn ntitis vrtis v n w r jnt i thr is n g (v,w) [or (w,v)] th g (v,w) is inint upon
More informationCSE 373: AVL trees. Warmup: Warmup. Interlude: Exploring the balance invariant. AVL Trees: Invariants. AVL tree invariants review
rmup CSE 7: AVL trs rmup: ht is n invrint? Mihl L Friy, Jn 9, 0 ht r th AVL tr invrints, xtly? Disuss with your nighor. AVL Trs: Invrints Intrlu: Exploring th ln invrint Cor i: xtr invrint to BSTs tht
More informationAlgorithmic and NP-Completeness Aspects of a Total Lict Domination Number of a Graph
Intrntionl J.Mth. Comin. Vol.1(2014), 80-86 Algorithmi n NP-Compltnss Aspts of Totl Lit Domintion Numr of Grph Girish.V.R. (PES Institut of Thnology(South Cmpus), Bnglor, Krntk Stt, Ini) P.Ush (Dprtmnt
More information12. Traffic engineering
lt2.ppt S-38. Introution to Tltrffi Thory Spring 200 2 Topology Pths A tlommunition ntwork onsists of nos n links Lt N not th st of nos in with n Lt J not th st of nos in with j N = {,,,,} J = {,2,3,,2}
More informationConstructive 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 informationDivided. 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 informationExam 1 Solution. CS 542 Advanced Data Structures and Algorithms 2/14/2013
CS Avn Dt Struturs n Algorithms Exm Solution Jon Turnr //. ( points) Suppos you r givn grph G=(V,E) with g wights w() n minimum spnning tr T o G. Now, suppos nw g {u,v} is to G. Dsri (in wors) mtho or
More informationProblem 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 informationCS 103 BFS Alorithm. Mark Redekopp
CS 3 BFS Aloritm Mrk Rkopp Brt-First Sr (BFS) HIGHLIGHTED ALGORITHM 3 Pt Plnnin W'v sn BFS in t ontxt o inin t sortst pt trou mz? S?? 4 Pt Plnnin W xplor t 4 niors s on irtion 3 3 3 S 3 3 3 3 3 F I you
More information0.1. Exercise 1: the distances between four points in a graph
Mth 707 Spring 2017 (Drij Grinrg): mitrm 3 pg 1 Mth 707 Spring 2017 (Drij Grinrg): mitrm 3 u: W, 3 My 2017, in lss or y mil (grinr@umn.u) or lss S th wsit or rlvnt mtril. Rsults provn in th nots, or in
More information(4, 2)-choosability of planar graphs with forbidden structures
1 (4, )-oosility o plnr rps wit orin struturs 4 5 Znr Brikkyzy 1 Cristopr Cox Mil Diryko 1 Kirstn Honson 1 Moit Kumt 1 Brnr Liiký 1, Ky Mssrsmit 1 Kvin Moss 1 Ktln Nowk 1 Kvin F. Plmowski 1 Drrik Stol
More information160 SSC Variable Speed Drive (Series C)
0 SS Variable Speed rive (Series ) Publication 0-P onfigured rive Package Important User Information Solid state equipment has operational characteristics differing from those of electromechanical equipment.
More informationSpanning 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 informationDFA Minimization. DFA minimization: the idea. Not in Sipser. Background: Questions: Assignments: Previously: Today: Then:
Assinmnts: DFA Minimiztion CMPU 24 Lnu Tory n Computtion Fll 28 Assinmnt 3 out toy. Prviously: Computtionl mols or t rulr lnus: DFAs, NFAs, rulr xprssions. Toy: How o w in t miniml DFA or lnu? Tis is t
More informationb. How many ternary words of length 23 with eight 0 s, nine 1 s and six 2 s?
MATH 3012 Finl Exm, My 4, 2006, WTT Stunt Nm n ID Numr 1. All our prts o this prolm r onrn with trnry strings o lngth n, i.., wors o lngth n with lttrs rom th lpht {0, 1, 2}.. How mny trnry wors o lngth
More informationDepth 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 informationCS 241 Analysis of Algorithms
CS 241 Anlysis o Algorithms Prossor Eri Aron Ltur T Th 9:00m Ltur Mting Lotion: OLB 205 Businss HW6 u lry HW7 out tr Thnksgiving Ring: Ch. 22.1-22.3 1 Grphs (S S. B.4) Grphs ommonly rprsnt onntions mong
More informationCOMPLEXITY OF COUNTING PLANAR TILINGS BY TWO BARS
OMPLXITY O OUNTING PLNR TILINGS Y TWO RS KYL MYR strt. W show tht th prolm o trmining th numr o wys o tiling plnr igur with horizontl n vrtil r is #P-omplt. W uil o o th rsults o uquir, Nivt, Rmil, n Roson
More informationCS 461, Lecture 17. Today s Outline. Example Run
Prim s Algorithm CS 461, Ltur 17 Jr Si Univrsity o Nw Mxio In Prim s lgorithm, th st A mintin y th lgorithm orms singl tr. Th tr strts rom n ritrry root vrtx n grows until it spns ll th vrtis in V At h
More informationCS150 Sp 98 R. Newton & K. Pister 1
Outin Cok Synronous Finit- Mins Lst tim: Introution to numr systms: sin/mnitu, ons ompmnt, twos ompmnt Rviw o ts, ip ops, ountrs Tis tur: Rviw Ts & Trnsition Dirms Impmnttion Usin D Fip-Fops Min Equivn
More information(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 informationGraph Algorithms and Combinatorial Optimization Presenters: Benjamin Ferrell and K. Alex Mills May 7th, 2014
Grp Aloritms n Comintoril Optimiztion Dr. R. Cnrskrn Prsntrs: Bnjmin Frrll n K. Alx Mills My 7t, 0 Mtroi Intrstion In ts ltur nots, w mk us o som unonvntionl nottion or st union n irn to kp tins lnr. In
More informationIndices. Indices. Curriculum Ready ACMNA: 209, 210, 212,
Inis Inis Curriulum Ry ACMNA: 09, 0,, 6 www.mtltis.om Inis INDICES Inis is t plurl or inx. An inx is us to writ prouts o numrs or pronumrls sily. For xmpl is tully sortr wy o writin #. T is t inx. Anotr
More informationPlanar Upward Drawings
C.S. 252 Pro. Rorto Tmssi Computtionl Gomtry Sm. II, 1992 1993 Dt: My 3, 1993 Sri: Shmsi Moussvi Plnr Upwr Drwings 1 Thorm: G is yli i n only i it hs upwr rwing. Proo: 1. An upwr rwing is yli. Follow th
More informationS i m p l i f y i n g A l g e b r a SIMPLIFYING ALGEBRA.
S i m p l i y i n g A l g r SIMPLIFYING ALGEBRA www.mthltis.o.nz Simpliying SIMPLIFYING Algr ALGEBRA Algr is mthmtis with mor thn just numrs. Numrs hv ix vlu, ut lgr introus vrils whos vlus n hng. Ths
More informationNumbering Boundary Nodes
Numring Bounry Nos Lh MBri Empori Stt Univrsity August 10, 2001 1 Introution Th purpos of this ppr is to xplor how numring ltril rsistor ntworks ffts thir rspons mtrix, Λ. Morovr, wht n lrn from Λ out
More information4.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 informationDistributed community detection over dynamic networks using neighborhood similarity
ERCIM SNA WG Aloritmi Aspts o Soil Ntwork Anlysis Guillum-Jn Hrit Mr, 11t 2010, UCD, Dulin Distriut ommunity ttion ovr ynmi ntworks usin nioroo similrity Rtionl or tis ppro 2 Rtionl or tis ppro In wirlss
More informationChapter 7 Conformance Checking
Cptr 7 Conormn Ckin pro.r.ir. Wil vn r Alst www.prossminin.or Ovrviw Cptr 1 Introution Prt I: Prliminris Cptr 2 Pross Molin n Anlysis Cptr 3 Dt Minin Prt II: From Evnt Los to Pross Mols Cptr 4 Gttin t
More information# 1 ' 10 ' 100. Decimal point = 4 hundred. = 6 tens (or sixty) = 5 ones (or five) = 2 tenths. = 7 hundredths.
How os it work? Pl vlu o imls rprsnt prts o whol numr or ojt # 0 000 Tns o thousns # 000 # 00 Thousns Hunrs Tns Ons # 0 Diml point st iml pl: ' 0 # 0 on tnth n iml pl: ' 0 # 00 on hunrth r iml pl: ' 0
More informationMulti-criteria p-cycle network design
Multi-ritri p-yl ntwork sin Hmz Dri, Brnr Cousin, Smr Lou, Miklos Molnr To it tis vrsion: Hmz Dri, Brnr Cousin, Smr Lou, Miklos Molnr. Multi-ritri p-yl ntwork sin. r IEEE Conrn on Lol Computr Ntworks (LCN
More informationTCI SERIES, 3 CELL THE COOLING TOWER CO., L.C. TCI 3 CELL SERIES GA
of T SIN IS T PROPRTY O T OOLIN TOWR OMPNY, L, N IS LON OR MUTUL SSISTN. IT IS NOT TO ORWR NOR RPRINT IN NY ORM WITOUT WRITTN PRMISSION. L W OPTIONL SS PLTORM " x " STNR PLTORM PR LL OPTIONL VIRTION SWIT
More informationHaving 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 informationImproving 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 information12/3/12. Outline. Part 10. Graphs. Circuits. Euler paths/circuits. Euler s bridge problem (Bridges of Konigsberg Problem)
12/3/12 Outlin Prt 10. Grphs CS 200 Algorithms n Dt Struturs Introution Trminology Implmnting Grphs Grph Trvrsls Topologil Sorting Shortst Pths Spnning Trs Minimum Spnning Trs Ciruits 1 Ciruits Cyl 2 Eulr
More information5/9/13. Part 10. Graphs. Outline. Circuits. Introduction Terminology Implementing Graphs
Prt 10. Grphs CS 200 Algorithms n Dt Struturs 1 Introution Trminology Implmnting Grphs Outlin Grph Trvrsls Topologil Sorting Shortst Pths Spnning Trs Minimum Spnning Trs Ciruits 2 Ciruits Cyl A spil yl
More informationDecimals 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 informationMath 61 : Discrete Structures Final Exam Instructor: Ciprian Manolescu. You have 180 minutes.
Nm: UCA ID Numr: Stion lttr: th 61 : Disrt Struturs Finl Exm Instrutor: Ciprin nolsu You hv 180 minuts. No ooks, nots or lultors r llow. Do not us your own srth ppr. 1. (2 points h) Tru/Fls: Cirl th right
More informationAIR FORCE STANDARD DESIGN MILITARY WORKING DOG FACILITY
1. NRL NOTS US THS OUMNTS IN ONJUTION WITH TH STNR SIN OUMNT N INTRTIV PRORMMIN WORKSHT. NUMR RWIN LIST NM -1 OVR SHT -1 STNR SIN PLN - 1-2 STNR SIN PLN - 2-3 MOULS,, & PLNS & XONS -4 MOULS PLNS & XONS
More informationCSC Design and Analysis of Algorithms. Example: Change-Making Problem
CSC 801- Dsign n Anlysis of Algorithms Ltur 11 Gry Thniqu Exmpl: Chng-Mking Prolm Givn unlimit mounts of oins of nomintions 1 > > m, giv hng for mount n with th lst numr of oins Exmpl: 1 = 25, 2 =10, =
More informationCSE 373. Graphs 1: Concepts, Depth/Breadth-First Search reading: Weiss Ch. 9. slides created by Marty Stepp
CSE 373 Grphs 1: Conpts, Dpth/Brth-First Srh ring: Wiss Ch. 9 slis rt y Mrty Stpp http://www.s.wshington.u/373/ Univrsity o Wshington, ll rights rsrv. 1 Wht is grph? 56 Tokyo Sttl Soul 128 16 30 181 140
More informationN=4 L=4. Our first non-linear data structure! A graph G consists of two sets G = {V, E} A set of V vertices, or nodes f
lulu jwtt pnlton sin towr ounrs hpl lpp lu Our irst non-linr t strutur! rph G onsists o two sts G = {V, E} st o V vrtis, or nos st o E s, rltionships twn nos surph G onsists o sust o th vrtis n s o G jnt
More informationCMPS 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 informationThe University of Sydney MATH2969/2069. Graph Theory Tutorial 5 (Week 12) Solutions 2008
Th Univrsity o Syny MATH2969/2069 Grph Thory Tutoril 5 (Wk 12) Solutions 2008 1. (i) Lt G th isonnt plnr grph shown. Drw its ul G, n th ul o th ul (G ). (ii) Show tht i G is isonnt plnr grph, thn G is
More informationDesigning A Uniformly Loaded Arch Or Cable
Dsinin A Unirmy Ar Or C T pr wit tis ssn, i n t Nxt uttn r r t t tp ny p. Wn yu r n wit tis ssn, i n t Cntnts uttn r r t t tp ny p t rturn t t ist ssns. Tis is t Mx Eyt Bri in Stuttrt, Grmny, sin y Si
More informationMCS100. One can begin to reason only when a clear picture has been formed in the imagination.
642 ptr 10 Grps n Trs 46. Imin tt t irmsown low is mp wit ountris ll. Is it possil to olor t mp wit only tr olors so tt no two jnt ountris v t sm olor? To nswr tis qustion, rw n nlyz rp in wi ountry is
More informationGraphs. Graphs. Graphs: Basic Terminology. Directed Graphs. Dr Papalaskari 1
CSC 00 Disrt Struturs : Introuon to Grph Thory Grphs Grphs CSC 00 Disrt Struturs Villnov Univrsity Grphs r isrt struturs onsisng o vrs n gs tht onnt ths vrs. Grphs n us to mol: omputr systms/ntworks mthml
More informationStrongly 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 informationNOTE: ONLY RIGHT IDLER (CONFIGURATION A) ARM SHOWN IN VIEWS ON THIS PAGE
0 PP PP PP PP PP PP NOT: ONLY RIT ILR (ONIURTION ) RM SOWN IN VIWS ON TIS P ITM SRIPTION MTRIL QTY. IL RM - RIT / RIL LIN TUIN / O (0.0 WLL) ISI RT 0 ROMOLY LINR INS IL RM - LT / RIL LIN TUIN / O (0.0
More informationA 4-state solution to the Firing Squad Synchronization Problem based on hybrid rule 60 and 102 cellular automata
A 4-stt solution to th Firing Squ Synhroniztion Prolm s on hyri rul 60 n 102 llulr utomt LI Ning 1, LIANG Shi-li 1*, CUI Shung 1, XU Mi-ling 1, ZHANG Ling 2 (1. Dprtmnt o Physis, Northst Norml Univrsity,
More informationPhysics 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 informationSection 10.4 Connectivity (up to paths and isomorphism, not including)
Toy w will isuss two stions: Stion 10.3 Rprsnting Grphs n Grph Isomorphism Stion 10.4 Conntivity (up to pths n isomorphism, not inluing) 1 10.3 Rprsnting Grphs n Grph Isomorphism Whn w r working on n lgorithm
More informationCMSC 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 informationJonathan Turner Exam 2-10/28/03
CS Algorihm n Progrm Prolm Exm Soluion S Soluion Jonhn Turnr Exm //. ( poin) In h Fioni hp ruur, u wn vrx u n i prn v u ing u v i v h lry lo hil in i l m hil o om ohr vrx. Suppo w hng hi, o h ing u i prorm
More informationYehuda Lindell Bar-Ilan University
Wintr Shool on Sur Computtion n iiny Br-Iln Unirsity, Isrl 3//2-/2/2 Br Iln Unirsity Dpt. o Computr Sin Yhu Linll Br-Iln Unirsity Br Iln Unirsity Dpt. o Computr Sin Protool or nrl sur to-prty omputtion
More informationSAMPLE PAGES. Primary. Primary Maths Basics Series THE SUBTRACTION BOOK. A progression of subtraction skills. written by Jillian Cockings
PAGES Primry Primry Mths Bsis Sris THE SUBTRACTION BOOK A prorssion o sutrtion skills writtn y Jillin Cokins INTRODUCTION This ook is intn to hlp sur th mthmtil onpt o sutrtion in hilrn o ll s. Th mstry
More informationTRUNCATED BOOLEAN MATRICES FOR DNA
Intrntionl Journl of Computr Sin, Eninrin n Applitions (IJCSEA) Vol.4, No.5, Otor 24 TRUNCATED BOOLEAN MATRICES FOR DNA COMPUTATION Norin R, Awn Am Sllin Awn Hussini 2 n Srif Msni Wn Msr 4 Fulty of Eninrin,
More information24CKT POLARIZATION OPTIONS SHOWN BELOW ARE REPRESENTATIVE FOR 16 AND 20CKT
0 NOTS: VI UNSS OTRWIS SPII IRUIT SMT USR R PORIZTION OPTION IRUIT SMT USR R PORIZTION OPTION IRUIT SMT USR R PORIZTION OPTION. NR: a. PPITION SPIITION S: S--00 b. PROUT SPIITION S: PS--00 c. PIN SPIITION
More informationOutline. Circuits. Euler paths/circuits 4/25/12. Part 10. Graphs. Euler s bridge problem (Bridges of Konigsberg Problem)
4/25/12 Outlin Prt 10. Grphs CS 200 Algorithms n Dt Struturs Introution Trminology Implmnting Grphs Grph Trvrsls Topologil Sorting Shortst Pths Spnning Trs Minimum Spnning Trs Ciruits 1 2 Eulr s rig prolm
More information