Configuration Management in Multi-Context Reconfigurable Systems for Simultaneous Performance and Power Optimizations*

Size: px
Start display at page:

Download "Configuration Management in Multi-Context Reconfigurable Systems for Simultaneous Performance and Power Optimizations*"

Transcription

1 Confguraton Management n Mult-Context Reconfgurable Systems for Smultaneous Performance and Power Optmzatons* Rafael Maestre, Mlagros Fernandez Departamento de Arqutectura de Computadores y Automátca Unversdad Complutense de Madrd, SPAIN Fad J. Kurdah, Nader Bagherzadeh, Hartej Sngh Department of Electrcal and Computer Engneerng Unversty of Calforna, Irvne, USA Abstract In ths paper, we present a novel soluton to the problem of confguraton management for mult-context reconfgurable systems targetng DSP applcatons, ts goal beng to mnmze both, confguraton latency and power consumpton. We assume that ths technque s appled wthn a larger complaton framework, whch provdes a scheduled task sequence of the consdered applcaton. Reconfguraton latency reducton s the frst crtera to consder, and we prove that the optmal soluton can be obtaned n all cases. Secondly, power s optmzed wthout affectng performance. The assumptons of the method are supported by the analyss of a mathematcal model, and ts effectveness s demonstrated by some experments.. Introducton Reconfgurable computng combnes a reconfgurable hardware processng unt wth a programmable processor. The processor orchestrates the whole system and t may be also used for computatons so as to contrbute to the overall throughput. The reconfgurable hardware mplements the core of computatons. Ths knd of computng s consoldatng as a vable desgn alternatve to mplement a wde range of computatonally ntensve applcatons. Its man advantage s clearly ts versatlty. These systems can be adapted to almost any target applcaton, achevng an acceptable degree of performance n many cases. Most reconfgurable systems explot ts whole processng potental when executng applcatons wth a lot of nherent parallelsm. DSP and multmeda applcatons are some of those applcatons. Ths s why our work s focused on them. Addtonally, ths knd of applcatons have an nternal structure wth some features, such as regularty, that may be exploted n order to smplfy the problem formulaton. The executon of such complex applcatons requres mplementng consecutvely dfferent confguratons durng computaton, whch s called run-tme reconfguraton. The term dynamc reconfguraton restrcts ths concept for the cases such that the reconfguraton overhead does not mply an essental computaton stall. As the technology has produced devces wth shorter reconfguraton tmes, the dea of dynamc reconfguraton has become a vable possblty. We could say that dynamc reconfguraton permts the consderaton of a new dmenson n the desgn space, tme multplexng of hardware resources. Instead of ncreasng the number of avalable resources, the confguratons are swapped n and out of the actual hardware, as they are needed. Dynamc reconfguraton may be mplemented n two dfferent confguraton memory styles. One of them allows selectve access to the reconfguraton memory n a partcular regon of the reconfgurable devce. At the same tme the rest of the devce remans fully operatonal. Xlnx XC6 famly s one example of ths choce. In ths knd of devces the porton of the hardware that s beng reconfgured cannot be used. Recently, mult-context archtectures have appeared to facltate and accelerate the confguraton swtch []. They can store a set of dfferent contexts (confguratons) n a context memory. When a new confguraton s needed, t s loaded from the context memory f avalable. As the context memory s on-chp, ths operaton s much faster than the reconfguraton from an external memory. For example, MorphoSys archtecture [] has a context memory that can store 3 dfferent contexts, and a full change of context only takes one clock cycle, compared to one sngle context transfer from the external memory whch takes more than cycles. However, the context memory cannot store all the confguratons of a specfc applcaton. Therefore, t s obvous that reconfguraton tme may be dramatcally reduced, but only f the context memory s carefully * Ths work has been granted by Spansh Government Grant CICYT TIC

2 managed. We address the problem for mult-context archtectures wth an undefned number of contexts. Besdes performance, the mnmzaton of power consumpton s another very mportant ssue that should be consdered, at least for portable systems. Power n CMOS ntegrated crcuts s manly caused by the swtchng actvty of nternal capactances. Ths means that power consumpton can be reduced f we fnd a way to decrease the swtchng actvty as much as possble n the whole chp. Although ths knd of optmzaton can be performed at dfferent complaton steps, we address ths problem from the confguraton schedulng and allocaton pont of vew; therefore optmzatons are physcally restrcted to the context (confguraton) memory. As typcal applcatons are usually so demandng, performance s the frst optmzaton factor to consder so that tmng constrants are met. Addtonally, the optmal soluton for confguraton mnmzes the number of confguraton swaps, whch smultaneously produces a postve effect on power consumpton. Then, the solutons wth the same latency are explored to acheve further power mprovements. Ths work assumes that the dfferent tasks that compose the target applcaton have already been scheduled. Ths task schedulng can be obtaned through the approach to schedulng n reconfgurable computng presented n []. It s the frst step of a whole desgn development framework [3]. Ths schedulng technque provdes the best task executon order, although the effect of the followng tasks s only estmated. The current work s a part of the second step of ths framework, and ts goal s to accomplsh the degree of performance that the schedulng task assumed, whle optmzng power consumpton. Reconfgurable computng s an emergng area of computng that has opened many dfferent research felds. For example, schedulng s an area that, although has been wdely nvestgated n other felds, needs to ncorporate the characterstcs of ths knd of systems. As a matter of fact, most approaches are versons of exstng hgh-level synthess technques, extended to consder specfc features of reconfgurable systems, such as the reconfguraton tme [4]-[7]. More especally, context schedulng s a relatvely new problem that has receved lttle attenton. To the best of our knowledge, [3] and [8] are the only work that explctly tackles ths ssue. [8] addresses reconfguraton overhead reducton through confguraton prefetch. However, ts applcablty s restrcted to sngle context archtectures. In [3] a heurstc soluton to the current problem for mult-context archtectures s presented. Other schedulng methodologes n reconfgurable computng, lke [,], do not explctly address ths ssue. Fnally, we wll menton that we have not found any prevous work about power optmzatons for mult-context systems. The paper s organzed nto 6 sectons. Secton ntroduces the relevant ssues, and provdes a frst approach to the problem. Secton 3 analyzes the mnmzaton of context loadng, whch mproves both performance and power consumpton. Secton 4 s devoted to the allocaton of memory replacements, whose goal t to acheve the lowest power consumpton for the optmal performance schedulng. Then, secton 5 summarzes the expermental results that have been obtaned. Fnally, secton 6 concludes the paper.. Problem Overvew A typcal DSP or multmeda applcaton s composed of a sequence of macro-tasks that are repeatedly executed as a loop. We use the term kernel to refer to one of those well-defned macro-tasks []. Some examples of those applcatons are MPEG (vdeo compresson and decompresson), JPEG (mage compresson) and ATR (Automatc Target Recognton), whereas DCT (Dscrete Cosne Transform) or ME (Moton Estmaton) may exemplfy some of these kernels. Hence, n ths paper we wll assume that any kernel sequence s perodc. Moreover, as the kernels of those applcatons can be scheduled through the algorthm presented n [], the resultng kernel schedulng consttutes the nput to our problem. In order to provde an ntutve approach to the problem, we wll consder the examples shown n Fg.. The fgure represents the status of the CM (Context Memory) by means of some CM snapshots taken just before the begnnng of a kernel executon. We have represented one sngle nner teraton of the perodc sequence. A whole kernel executon mples the mplementaton of a specfc sequence of contexts, whch wll be assumed to be n the CM durng ts correspondng kernel executon. As a kernel always uses the same contexts, t may be possble to keep some of them n the memory, and reuse them n the next kernel executon. We wll use the term statc to refer to those contexts. On the other hand, the rest of the context wll have to be loaded before the begnnng of the next executon, and they wll be stored n the remanng part of the CM. These contexts wll be called dynamc contexts. Thus, dynamc contexts mply loadng tme, whereas statc contexts save loadng tme, and hence we should maxmze the statc part of the CM. For example Fg. llustrates two solutons wth dfferent statc szes, and T (total number of context loadngs) s bgger for the example wth less statc contexts (Fg..a). In subsequent sectons we wll prove that the statc part s maxmzed, and thus T s mnmzed, when the numbers of loadngs for all kernels (all ) are as equal as possble, but frst we wll provde a bref dea here.

3 Statc Dynamc Begnnng Imagne one of those solutons, lke the one presented n Fg..a. If were bgger for at least one kernel, ths would reduce the sze of the statc part, and therefore some statc contexts would become dynamc and should be later reloaded. Ths fact would certanly ncrease the total number of loadngs. Fg..b represents a soluton such that substantally dfferent for every kernel. As shown the soluton s worse. In ths example the crtera to buld ths soluton has been that the number of loadngs for a kernel s proportonal to ts context sze. Smlarly, f context loadngs are accomplshed too soon, they wll occupy CM postons, whch wll reduce the number of statc postons. Therefore, context loadngs have to be performed as late as possble (AAP). The mnmzaton of context loadngs optmzes reconfguraton latency, but at the same tme t potentally mproves the power consumpton, snce the total number of transtons from to of the nternal capactance assocated to ndvdual CM cells s kept wthn low values. Once the soluton wth the lowest latency has been generated, power can be further optmzed. So far we have not consdered context allocaton, whch wll drectly nfluence power. The number of bt changes that mples the consecutve loadng of two confguratons n the same CM poston determnes the actual power consumpton, and there are many dfferent confguraton replacements for a gven schedule. For example, n Fg..a K contexts can replace any of K 3 or K 4 contexts. The exploraton of the alternatves wll lead to dfferent power numbers. Sequence of kernels: { K,K,K 3,K 4 } Sze of contexts: { C = 4, C = 9, C 3 = 3, C 4 = 6 } a. of K of K of K 3 of K 4 b. K K K K K 7 = K 3 K Begnnng K 7 K 3 K Begnnng K 7 K 3 K 3 = 3 = 4 =6 Executon flow Begnnng K 7 K 3 K 3 6 K 4 6 Number of context loadngs for the optmal soluton: { =, =, 3 =, 4 = 6 } Ÿ T =4 3 Statc Dynamc Begnnng of K All the prevous deas are analyzed n detal n the followng sectons. 3. Analyss of Context oadng Mnmzaton In ths secton we present the mathematcal analyss that leads us to the optmal soluton n terms of number of context loadngs, whch optmzes performance, besdes reducng power consumpton. The reasonng s based on the fact that the sze of the CM (SCM) s a physcal constrant that has to be fulflled n all cases. It s obvous that the number of both, dynamc and statc contexts cannot exceed SCM. We suggest the reader to use Fg. n order to vsualze the meanng of the expressons. The dynamc part of the CM (Dyn) s gven by the maxmum number of context loadngs ( ): Dyn Begnnng of K Executon flow MAX. () On the other hand, the statc part of the CM (Stc) s composed of the contexts that are not loaded every teraton (C - ), thus f C s the number of contexts for kernel K, C Stc. Begnnng of K 3 Begnnng of K 4 K 3 K 3 K 3 K 3 K 4 K 4 K 4 K 4 5 K 3 6 K 3 6 K 3 6 K 3 6 K 4 K 4 K 4 K 4 K 3 6 K 3 K K 5 K 3 7 K K 4 4 = =5 3 =7 4 =4 Number of context loadngs for a non-optmal soluton: { =, = 5, 3 = 7, 4 = 4 } Ÿ T =47 Fg.. CM snapshots for two possble context loadng schedules. The snapshots have been taken just at the begnnng of each kernel executon, and show the content of the CM postons. K stands for the kernel. represents the number of loadngs regardng kernel K, and T s the total number of context loadngs. C s the number of contexts for kernel K. The trangles depct the loaded contexts. Therefore, the total sze of the context memory s: 3 ()

4 Begnnng of K K K K K 3 Begnnng of K K K K K Begnnng of K 3 K K K 3 K 3 3 Begnnng of K K K K K =4 =4 3 = =4 Fg.. Snapshots of the CM dynamc part for a possble schedulng showng some hypothetcal allocaton of contexts of 4 bts. The dotted arrow ndcates the number of bt changes for a context allocaton. C SCM t Dyn Stc MAX. From (3) we can express the total number of loadngs as: T t MAX C SCM. Ths expresson proves the dea ntroduced n the prevous secton. If s bgger for a partcular kernel, K, than j for the others, ths one wll determne the lowest feasble value of T. Hence, f for all kernels take the same value and expresson (4) s fulflled, ths wll be the optmal soluton n terms of reconfguraton latency. It should be noted that as the number of context loadngs for a kernel cannot exceed ts number of contexts (that s C t ), all have to be at least as equal as possble. For example n Fg..a as C 4 t 4 the maxmum value for s 4. However, the rest of the kernels can fulfll the requrements, and thus t mnmzes the total number of loadngs, T. Thus, for the example n Fg..a: T MAX 4 t MAX C SCM,,,6 6 3 If any s ncreased T wll also be ncreased, and hence the example n Fg..a s the optmal soluton. In order to obtan the best dstrbuton, we wll make the assumpton that all the kernels may have equal values of, A =, whch means that MAX( ) = A, and T = *, where s the total number of kernels. Consequently, from (4): (3) (4) (5) C SCM. (6) N T If some kernel/s cannot satsfy ths expresson, we wll choose the lowest C and ts wll take the hghest possble value, as n the example of Fg..a. Then, ths kernel wll not be consdered n the next computaton of equaton (6). Ths process s repeated untl a feasble soluton s obtaned. As the reader may magne, the complexty of ths algorthm s very low, and t can easly handle sets wth a bg number of kernels, generatng the optmal soluton n very short tmes. 4. Allocaton for Power Optmzaton The soluton presented n secton 3 mnmzes the total number of loadngs, and consequently not only optmzes reconfguraton latency, but also reduces the number of context replacements, whch mproves power consumpton. At the level of abstracton we are workng on, power can only be reduced by mnmzng the number of bt level transtons of the CM cells. Thus, we have to explore context allocaton alternatves, n order to fnd the confguraton replacements wth the lowest number of bt changes. Fg. llustrates the allocaton of a bt specfcaton of dynamc contexts for a small example of three kernels and a CM wth contexts of 4 bts. The only way to evaluate the power consumpton that a specfc replacement mples s to count the number of bt changes between contexts. At frst sght, t may seem that the number of combnatons s too hgh, snce we should obtan the bt changes between all contexts. In a soluton of the type proposed n secton 3, most kernels have the same number of context loadngs, and these contexts fll the whole dynamc part of the CM. Therefore, t s very common that a context can only replace the contexts that belong to the prevously executed kernel, whch reduces the number of potental combnatons. For example n Fg., K contexts can only replace K contexts. However, for some kernels there may be some addtonal possbltes. Thus, n Fg. the number of K 3 context loadngs s lower than the sze of the dynamc part. Ths mples that the contexts of the followng kernel, K, can replace ether K or K 3 contexts, what ntroduces addtonal choces. To generalze ths dea, we could say that a gven context can replace any prevously executed one, only f the dynamc part of the CM s not completely used between the correspondng kernel executons, lke between kernels K and K. In ths case we wll say that there s a drect path

5 K K K K K 3 K 3 = =3 =3 K = = = Fg. 3. Evaluaton of CM possble replacements of Fg., between one K context and the contexts wth a drect path. s the number of bt changes between contexts. between contexts (whch can also be appled to consecutve kernels). The procedure that we propose requres computng (number of bt changes) between all the contexts wth a drect path. Fg. 3 shows the possble drect paths and ts s to one K context. characterzes each replacement, and can be used as a gudelne to buld the fnal allocaton. In ths way, f the replacements wth the lowest are consecutvely allocated we wll obtan a soluton wth a low total. Ths wll be optmal f t s composed of all the replacements wth lowest. However, we mght thnk that sometmes the optmal set of replacements cannot be obtaned n ths manner, because the selecton of some partcular replacements mght prevent some future selectons that may produce an overall reducton. In order to check ths knd of solutons we could explore some replacement allocatons that produce a ncrease. Then, f no mprovement s obtaned later, these replacements wll be dscarded. Fg. 4 llustrates the exploraton process. Frst, the replacements are numbered n ascendng order n accordance to. The replacements wth the lowest number (that can be allocated) are evaluated up to a certan depth. For example n Fg. 4 the frst branch of the exploraton tree s explored to a depth of 3, and t s composed of the replacements {,,5}. Note that t s assumed that the allocaton of replacements and prevent the allocaton of 3 and 4, whch forces to allocate 5. Then, we check for some solutons that mght mprove the result. Thus, n Fg. 4 we now consder the branch {,3,4}, whch n some cases may mprove the result of the frst branch. It depends on the actual values of. It should be noted that t s not necessary to explore any branch that begns wth {,}, snce the best possble branch would be {,3,4}, whch s certanly equal or worse that any of the two explored. All the elements of {,3,4} are equal or worse than {,3,4}. Ths consderaton dramatcally reduces the exploraton tme, snce the exploraton of all the branches may mply a 5 c. combnatoral exploson even f carred out up to a small depth. After that, the best replacement ( n the fgure) s allocated and the exploraton contnues n the same way. As the exploraton depth grows the probablty of fndng a better soluton ncreases. In the lmt, when the depth equals the number of possble replacements, the optmal soluton s always found. However, the experence shows that the exploraton tme grows exponentally as the depth ncreases, whch makes unfeasble to perform the optmal exploraton n medum and bg sze problems. The hgher depth that can be handled s typcally around 5. It should be noted that f the tree s vsted from the top to any leaf, t s not possble to fnd a descendng edge sequence. Ths fact guarantees that every soluton s only generated once. For example, the replacement sequence, {4,,3}, wll never be generated, as t s equvalent to the sequence {,3,4}. 5. Expermental Results b. a. We have carred out a seres of experments n order to demonstrate the effectveness of the proposed technques. We have chosen MorphoSys [-] as the target multcontext system n order to use real system parameters. MorphoSys has a confguraton memory of 3 contexts, and each one s composed of 8 words of 3 bts. Therefore, each context has a total of 56 bts. Ths data has been used n order to generate the experment nformaton as explaned below. The experments are formed of three real applcatons, as well as a set of randomly generated ones. MPEG s a standard for vdeo compresson, whle ATR stands for Automatc Target Recognton and we consder ts two man tasks SD (Second evel Detecton) and FI (Fnal Identfcaton). Both tasks, SD and FI, have the same number of kernels and contexts, and therefore we present 3 d. 4 e. 5 c. Fg. 4. Exploraton tree example. The exploraton depth s assumed to be 3. The replacements have been numbered n ascendng order of, and the edge labels stand for the explored replacements.

6 Expermental data T Proposed soluton (All optmzatons) Exploraton tme Depth= Depth= Only T optmzatons Only allocaton optmzatons T Wthout optmzatons Ex: =3; C ={,5,5} s 9.78s (9%) (48%) (43%) (94%) Ex: =4; C ={6,5,3,7} 8 78.s 8.7s (3%) (5%) (5%) (37%) ATR (SD and FI): =4; C ={4,4,4,} s.37s (7%) (7%) (8%) (48%) Ex3: =5; C ={,5,7,8,3} s 9.36s (6%) (8%) (74%) (%) Ex4: =6; C ={8,,6,3,4,} s 9.69s (%) (5%) (48%) (8%) Ex5: =7; C ={5,8,,,9,,6} s 7.68s (%) (%) (%) (34%) MPEG: =7; C ={8,4,,6,6,,4} s 4.48s (6%) (46%) (4%) (68%) Ex5: =8; C ={,5,9,3,8,,,} s 5.34s (3%) (39%) (37%) (57%) Ex6: =;C ={,5,,,5,,7,9,,,3,8} s 43.74s (6%) (8%) (%) (34%) Ex7: =5 C ={5,,8,9,7,9,7,,5,3,8,,,6,8} s 6.4s (5%) (8%) (5%) (4%) Ex8: = C ={8,7,,,4,,7,5,5,7,4,4,3,6,8, s 9.3s 4,6,5,,} (3%) (7%) (6%) (%) T = Total number of context loadngs. = Number of bt changes. RI= Relatve ncrement of wth respect to the proposed soluton when some of the optmzatons are not performed. Table. Expermental results. the results for only one experment. As shown n Table the proposed methodology generates smlar results for both, real and synthetc experments. The numbers of contexts n the real applcatons (for example {8,4,,6,6,,4} for MPEG) correspond to real data, however all the confguraton patterns have been randomly generated, snce we do not know ts actual form. In a frst approach all the bts were ndependently generated. Ths led us to a completely random structure such that any replacement mpled almost the same number of bt changes. As ths s not the real case, we decded to change the confguraton generaton procedure. In a system lke MorphoSys each 3-bt context word confgures the functonalty of one sngle reconfgurable cell. The structure of a context word s not completely random, and keeps wthn certan ranges. Moreover, a partcular functonalty of a cell may be later reused by a later mplemented context. The replacement of these two cell confguratons would produce no power consumpton. Consequently, frst we randomly generated a bg number of 3-bt context words wthn the archtectural constrants, and then confguratons were randomly composed of the generated context words. Ths enables us to generate experments wth smlar features to real applcatons. In order to demonstrate that the proposed schedulng technque always generates the optmal soluton for context schedulng, we mplemented an exhaustve search algorthm, whch can explore the whole search space for medum and small sze examples (lower than 7). The results for both methods match n all those cases, however the exploraton tme s order of magntudes smaller for our algorthm. Table and Fg. 5 summarzes the expermental results we have obtaned. In order to compare the confguraton latency and power consumpton mprovements, we present the number of context loadngs ( T ) and bt changes () for the proposed technque, as well as for three greedy approaches that do not perform some of the proposed optmzatons.. The frst algorthm only performs context loadng ( T) optmzatons (column 6 n Table and whte bars n Fg. 5). s obtaned when allocaton s not consdered. The relatve ncrements are wthn -3% worse than the proposed approach.. The results presented n columns 7-8 and the gray bars n Fg. 5, show for only allocaton optmzatons. In ths case we assume that contexts are loaded when necessary. Now ncrements range from 5% to 74%. Smlarly, T ncrements range form 5 to 8%.

7 3. Fnally, we present the results for the frst generated soluton when no optmzaton s consdered (column 9 n Table and black bars n Fg. 5). ncrements are now really bg: -%. T s the same as n pont. In all cases the performance and power mprovements are clearly sgnfcant. We have carred out all experments for a depth range from to, and the mpact on the fnal result s neglgble. The reason s that most contexts replace just executed contexts, whch does not prevent the allocaton of other replacements. The replacement wth lowest can almost always be allocated leadng to a quas-optmal soluton. In the table we show the exploraton tme for two dfferent values of depth. The algorthm s carred out n a really short exploraton tme for a depth=. We could say that the proposed technque provdes substantal performance and power mprovements n very short exploraton tmes. 6. Conclusons and Future Work In ths paper we have presented a new approach to the problem of context schedulng and allocaton for multcontext reconfgurable systems targetng DSP and multmeda applcatons. The goals of ths approach are to mnmze confguraton latency and power consumpton. The analyss of a mathematcal model enabled us to deduce an algorthm for context schedulng that generates the optmal soluton n all cases. We also propose a technque to effcently explore context allocaton possbltes, whch leads to an overall power mprovement wthout affectng the acheved system performance. The effectveness of the proposed work s analyzed n the expermental results secton. The results for real applcaton and synthetc experments valdate our assumptons, and show the qualty of the technque. Future work wll explore the power mprovements that can be obtaned when we addtonally consder confguraton latency ncreases. References [] G. u, H. Sngh, M. ee, N. Bagherzadeh, F. J. Kurdah, E. M. C. Flho, MorphoSys: An Integrated Re-confgurable Archtecture, Proceedngs of the 5 th Internatonal Euro-Par Conference Toulouse, France, August/September 999, pp [] R. Maestre, F. J. Kurdah, N. Bagherzadeh, H. Sngh, R. Hermda, M. Fernandez, Kernel Schedulng n Reconfgurable Computng, DATE Proceedngs, pp. 9-96, 999. [3] R. Maestre, M. Fernandez, R. Hermda, N. Bagherzadeh, A Framework for Schedulng and Context Allocaton n Reconfgurable Computng, Internatonal Symposum on System Synthess Proceedngs, San Jose, Calforna, USA, pp.34-4, November 999. C Only loadng optm zaton O nly alloc aton optm z atons No optm z aton Ex Ex ATR Ex3 Ex4 Ex5 MPEG Ex6 Ex7 Ex8 Ex9 Experm ents Fg. 5. Relatve ncrement of when the proposed optmzatons are not performed. [4] I.Ouass, S. Govndarajan, V. Srnvasan, M. Kaul and R. Vemur, "An Integrated Parttonng and Synthess system for Dynamcally Reconfgurable Mult-FPGA Archtectures", 5th Reconfgurable Archtectures Workshop, 998 (RAW'98). [5] M. Vaslko and D. At-Boudaoud, "Archtectural Synthess Technques for Dynamcally Reconfgurable ogc", 6th Internatonal Workshop on Feld-Programmable ogc and Applcatons, FP '96 Proceedngs, pp [6] M. Vaslko and D. At-Boudaoud, "Schedulng for Dynamcally Reconfgurable FPGAs", n Proceedng of Internatonal Workshop on ogc and Archtecture Synthess, IFIP TC WG.5, Grenoble, France, Dec. 8-9, 995, pp [7] K. M. GajjalaPurna, D. Bhata, "Temporal parttonng and schedulng for reconfgurable computng", Proceedngs of IEEE Symposum on FPGAs for Custom Computng Machnes, 998, pp [8] S. Hauck, Confguraton Prefetch for Sngle Context Reconfgurable Coprocessors ACM/SIGDA Internatonal Symposum on Feld-Programmable Gate Arrays, pp , 998. [9] K. M. GajjalaPurna, D. Bhata, "Temporal parttonng and schedulng for reconfgurable computng", Proceedngs of IEEE Symposum on FPGAs for Custom Computng Machnes, 998, pp [] M. Kaul and R. Vemur, Temporal Parttonng Combned wth Desgn Space Exploraton for atency Mnmzaton of Run-Tme Reconfgured Desgns, Desgn, Automaton and Test In Europe Proceedngs, 999 (DATE 99), pp. -9. [] H. Sngh, M. ee, G. u, F. J. Kurdah, N. Bagherzadeh, T. ang, R. Heaton and E. M. C. Flho, MorphoSys: An Integrated Re-confgurable Archtecture, Proceedngs of the NATO Symposum on System Concepts and Integraton, Monterey, CA, Aprl 998. [] H. Sngh, N. Bagherzadeh, F. J. Kurdah, G. u, M. ee, E. Chaves, R. Maestre, MorphoSys: Case Study of a Reconfgurable Computng System Targetng Multmeda Applcatons, Desgn Automaton Conference Proceedngs, DAC-.

An Optimal Algorithm for Prufer Codes *

An Optimal Algorithm for Prufer Codes * J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,

More information

An Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation

An Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation 17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 An Iteratve Soluton Approach to Process Plant Layout usng Mxed

More information

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields 17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 A mathematcal programmng approach to the analyss, desgn and

More information

Determining the Optimal Bandwidth Based on Multi-criterion Fusion

Determining the Optimal Bandwidth Based on Multi-criterion Fusion Proceedngs of 01 4th Internatonal Conference on Machne Learnng and Computng IPCSIT vol. 5 (01) (01) IACSIT Press, Sngapore Determnng the Optmal Bandwdth Based on Mult-crteron Fuson Ha-L Lang 1+, Xan-Mn

More information

A Binarization Algorithm specialized on Document Images and Photos

A Binarization Algorithm specialized on Document Images and Photos A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a

More information

The Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique

The Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique //00 :0 AM Outlne and Readng The Greedy Method The Greedy Method Technque (secton.) Fractonal Knapsack Problem (secton..) Task Schedulng (secton..) Mnmum Spannng Trees (secton.) Change Money Problem Greedy

More information

Meta-heuristics for Multidimensional Knapsack Problems

Meta-heuristics for Multidimensional Knapsack Problems 2012 4th Internatonal Conference on Computer Research and Development IPCSIT vol.39 (2012) (2012) IACSIT Press, Sngapore Meta-heurstcs for Multdmensonal Knapsack Problems Zhbao Man + Computer Scence Department,

More information

Parallelism for Nested Loops with Non-uniform and Flow Dependences

Parallelism for Nested Loops with Non-uniform and Flow Dependences Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr

More information

Module Management Tool in Software Development Organizations

Module Management Tool in Software Development Organizations Journal of Computer Scence (5): 8-, 7 ISSN 59-66 7 Scence Publcatons Management Tool n Software Development Organzatons Ahmad A. Al-Rababah and Mohammad A. Al-Rababah Faculty of IT, Al-Ahlyyah Amman Unversty,

More information

The Codesign Challenge

The Codesign Challenge ECE 4530 Codesgn Challenge Fall 2007 Hardware/Software Codesgn The Codesgn Challenge Objectves In the codesgn challenge, your task s to accelerate a gven software reference mplementaton as fast as possble.

More information

A Fast Content-Based Multimedia Retrieval Technique Using Compressed Data

A Fast Content-Based Multimedia Retrieval Technique Using Compressed Data A Fast Content-Based Multmeda Retreval Technque Usng Compressed Data Borko Furht and Pornvt Saksobhavvat NSF Multmeda Laboratory Florda Atlantc Unversty, Boca Raton, Florda 3343 ABSTRACT In ths paper,

More information

Learning the Kernel Parameters in Kernel Minimum Distance Classifier

Learning the Kernel Parameters in Kernel Minimum Distance Classifier Learnng the Kernel Parameters n Kernel Mnmum Dstance Classfer Daoqang Zhang 1,, Songcan Chen and Zh-Hua Zhou 1* 1 Natonal Laboratory for Novel Software Technology Nanjng Unversty, Nanjng 193, Chna Department

More information

TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS. Muradaliyev A.Z.

TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS. Muradaliyev A.Z. TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS Muradalyev AZ Azerbajan Scentfc-Research and Desgn-Prospectng Insttute of Energetc AZ1012, Ave HZardab-94 E-mal:aydn_murad@yahoocom Importance of

More information

Virtual Memory. Background. No. 10. Virtual Memory: concept. Logical Memory Space (review) Demand Paging(1) Virtual Memory

Virtual Memory. Background. No. 10. Virtual Memory: concept. Logical Memory Space (review) Demand Paging(1) Virtual Memory Background EECS. Operatng System Fundamentals No. Vrtual Memory Prof. Hu Jang Department of Electrcal Engneerng and Computer Scence, York Unversty Memory-management methods normally requres the entre process

More information

Conditional Speculative Decimal Addition*

Conditional Speculative Decimal Addition* Condtonal Speculatve Decmal Addton Alvaro Vazquez and Elsardo Antelo Dep. of Electronc and Computer Engneerng Unv. of Santago de Compostela, Span Ths work was supported n part by Xunta de Galca under grant

More information

Load Balancing for Hex-Cell Interconnection Network

Load Balancing for Hex-Cell Interconnection Network Int. J. Communcatons, Network and System Scences,,, - Publshed Onlne Aprl n ScRes. http://www.scrp.org/journal/jcns http://dx.do.org/./jcns.. Load Balancng for Hex-Cell Interconnecton Network Saher Manaseer,

More information

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration Improvement of Spatal Resoluton Usng BlockMatchng Based Moton Estmaton and Frame Integraton Danya Suga and Takayuk Hamamoto Graduate School of Engneerng, Tokyo Unversty of Scence, 6-3-1, Nuku, Katsuska-ku,

More information

A Fast Visual Tracking Algorithm Based on Circle Pixels Matching

A Fast Visual Tracking Algorithm Based on Circle Pixels Matching A Fast Vsual Trackng Algorthm Based on Crcle Pxels Matchng Zhqang Hou hou_zhq@sohu.com Chongzhao Han czhan@mal.xjtu.edu.cn Ln Zheng Abstract: A fast vsual trackng algorthm based on crcle pxels matchng

More information

Parallel matrix-vector multiplication

Parallel matrix-vector multiplication Appendx A Parallel matrx-vector multplcaton The reduced transton matrx of the three-dmensonal cage model for gel electrophoress, descrbed n secton 3.2, becomes excessvely large for polymer lengths more

More information

Support Vector Machines

Support Vector Machines /9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.

More information

Problem Definitions and Evaluation Criteria for Computational Expensive Optimization

Problem Definitions and Evaluation Criteria for Computational Expensive Optimization Problem efntons and Evaluaton Crtera for Computatonal Expensve Optmzaton B. Lu 1, Q. Chen and Q. Zhang 3, J. J. Lang 4, P. N. Suganthan, B. Y. Qu 6 1 epartment of Computng, Glyndwr Unversty, UK Faclty

More information

Mathematics 256 a course in differential equations for engineering students

Mathematics 256 a course in differential equations for engineering students Mathematcs 56 a course n dfferental equatons for engneerng students Chapter 5. More effcent methods of numercal soluton Euler s method s qute neffcent. Because the error s essentally proportonal to the

More information

Proper Choice of Data Used for the Estimation of Datum Transformation Parameters

Proper Choice of Data Used for the Estimation of Datum Transformation Parameters Proper Choce of Data Used for the Estmaton of Datum Transformaton Parameters Hakan S. KUTOGLU, Turkey Key words: Coordnate systems; transformaton; estmaton, relablty. SUMMARY Advances n technologes and

More information

Simulation Based Analysis of FAST TCP using OMNET++

Simulation Based Analysis of FAST TCP using OMNET++ Smulaton Based Analyss of FAST TCP usng OMNET++ Umar ul Hassan 04030038@lums.edu.pk Md Term Report CS678 Topcs n Internet Research Sprng, 2006 Introducton Internet traffc s doublng roughly every 3 months

More information

Efficient Distributed File System (EDFS)

Efficient Distributed File System (EDFS) Effcent Dstrbuted Fle System (EDFS) (Sem-Centralzed) Debessay(Debsh) Fesehaye, Rahul Malk & Klara Naherstedt Unversty of Illnos-Urbana Champagn Contents Problem Statement, Related Work, EDFS Desgn Rate

More information

Dynamic Voltage Scaling of Supply and Body Bias Exploiting Software Runtime Distribution

Dynamic Voltage Scaling of Supply and Body Bias Exploiting Software Runtime Distribution Dynamc Voltage Scalng of Supply and Body Bas Explotng Software Runtme Dstrbuton Sungpack Hong EE Department Stanford Unversty Sungjoo Yoo, Byeong Bn, Kyu-Myung Cho, Soo-Kwan Eo Samsung Electroncs Taehwan

More information

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision SLAM Summer School 2006 Practcal 2: SLAM usng Monocular Vson Javer Cvera, Unversty of Zaragoza Andrew J. Davson, Imperal College London J.M.M Montel, Unversty of Zaragoza. josemar@unzar.es, jcvera@unzar.es,

More information

Reliability and Energy-aware Cache Reconfiguration for Embedded Systems

Reliability and Energy-aware Cache Reconfiguration for Embedded Systems Relablty and Energy-aware Cache Reconfguraton for Embedded Systems Yuanwen Huang and Prabhat Mshra Department of Computer and Informaton Scence and Engneerng Unversty of Florda, Ganesvlle FL 326-62, USA

More information

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster

More information

Skew Angle Estimation and Correction of Hand Written, Textual and Large areas of Non-Textual Document Images: A Novel Approach

Skew Angle Estimation and Correction of Hand Written, Textual and Large areas of Non-Textual Document Images: A Novel Approach Angle Estmaton and Correcton of Hand Wrtten, Textual and Large areas of Non-Textual Document Images: A Novel Approach D.R.Ramesh Babu Pyush M Kumat Mahesh D Dhannawat PES Insttute of Technology Research

More information

Parallel Branch and Bound Algorithm - A comparison between serial, OpenMP and MPI implementations

Parallel Branch and Bound Algorithm - A comparison between serial, OpenMP and MPI implementations Journal of Physcs: Conference Seres Parallel Branch and Bound Algorthm - A comparson between seral, OpenMP and MPI mplementatons To cte ths artcle: Luco Barreto and Mchael Bauer 2010 J. Phys.: Conf. Ser.

More information

ARTICLE IN PRESS. Signal Processing: Image Communication

ARTICLE IN PRESS. Signal Processing: Image Communication Sgnal Processng: Image Communcaton 23 (2008) 754 768 Contents lsts avalable at ScenceDrect Sgnal Processng: Image Communcaton journal homepage: www.elsever.com/locate/mage Dstrbuted meda rate allocaton

More information

Petri Net Based Software Dependability Engineering

Petri Net Based Software Dependability Engineering Proc. RELECTRONIC 95, Budapest, pp. 181-186; October 1995 Petr Net Based Software Dependablty Engneerng Monka Hener Brandenburg Unversty of Technology Cottbus Computer Scence Insttute Postbox 101344 D-03013

More information

Reducing Frame Rate for Object Tracking

Reducing Frame Rate for Object Tracking Reducng Frame Rate for Object Trackng Pavel Korshunov 1 and We Tsang Oo 2 1 Natonal Unversty of Sngapore, Sngapore 11977, pavelkor@comp.nus.edu.sg 2 Natonal Unversty of Sngapore, Sngapore 11977, oowt@comp.nus.edu.sg

More information

The Research of Support Vector Machine in Agricultural Data Classification

The Research of Support Vector Machine in Agricultural Data Classification The Research of Support Vector Machne n Agrcultural Data Classfcaton Le Sh, Qguo Duan, Xnmng Ma, Me Weng College of Informaton and Management Scence, HeNan Agrcultural Unversty, Zhengzhou 45000 Chna Zhengzhou

More information

CHAPTER 2 PROPOSED IMPROVED PARTICLE SWARM OPTIMIZATION

CHAPTER 2 PROPOSED IMPROVED PARTICLE SWARM OPTIMIZATION 24 CHAPTER 2 PROPOSED IMPROVED PARTICLE SWARM OPTIMIZATION The present chapter proposes an IPSO approach for multprocessor task schedulng problem wth two classfcatons, namely, statc ndependent tasks and

More information

A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS

A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Proceedngs of the Wnter Smulaton Conference M E Kuhl, N M Steger, F B Armstrong, and J A Jones, eds A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Mark W Brantley Chun-Hung

More information

Wishing you all a Total Quality New Year!

Wishing you all a Total Quality New Year! Total Qualty Management and Sx Sgma Post Graduate Program 214-15 Sesson 4 Vnay Kumar Kalakband Assstant Professor Operatons & Systems Area 1 Wshng you all a Total Qualty New Year! Hope you acheve Sx sgma

More information

TPL-Aware Displacement-driven Detailed Placement Refinement with Coloring Constraints

TPL-Aware Displacement-driven Detailed Placement Refinement with Coloring Constraints TPL-ware Dsplacement-drven Detaled Placement Refnement wth Colorng Constrants Tao Ln Iowa State Unversty tln@astate.edu Chrs Chu Iowa State Unversty cnchu@astate.edu BSTRCT To mnmze the effect of process

More information

High-Level Power Modeling of CPLDs and FPGAs

High-Level Power Modeling of CPLDs and FPGAs Hgh-Level Power Modelng of CPLs and FPGAs L Shang and Nraj K. Jha epartment of Electrcal Engneerng Prnceton Unversty {lshang, jha}@ee.prnceton.edu Abstract In ths paper, we present a hgh-level power modelng

More information

Some material adapted from Mohamed Younis, UMBC CMSC 611 Spr 2003 course slides Some material adapted from Hennessy & Patterson / 2003 Elsevier

Some material adapted from Mohamed Younis, UMBC CMSC 611 Spr 2003 course slides Some material adapted from Hennessy & Patterson / 2003 Elsevier Some materal adapted from Mohamed Youns, UMBC CMSC 611 Spr 2003 course sldes Some materal adapted from Hennessy & Patterson / 2003 Elsever Scence Performance = 1 Executon tme Speedup = Performance (B)

More information

Virtual Machine Migration based on Trust Measurement of Computer Node

Virtual Machine Migration based on Trust Measurement of Computer Node Appled Mechancs and Materals Onlne: 2014-04-04 ISSN: 1662-7482, Vols. 536-537, pp 678-682 do:10.4028/www.scentfc.net/amm.536-537.678 2014 Trans Tech Publcatons, Swtzerland Vrtual Machne Mgraton based on

More information

An Entropy-Based Approach to Integrated Information Needs Assessment

An Entropy-Based Approach to Integrated Information Needs Assessment Dstrbuton Statement A: Approved for publc release; dstrbuton s unlmted. An Entropy-Based Approach to ntegrated nformaton Needs Assessment June 8, 2004 Wllam J. Farrell Lockheed Martn Advanced Technology

More information

FPGA Based Fixed Width 4 4, 6 6, 8 8 and Bit Multipliers using Spartan-3AN

FPGA Based Fixed Width 4 4, 6 6, 8 8 and Bit Multipliers using Spartan-3AN IJCSNS Internatonal Journal of Computer Scence and Network Securty, VOL.11 No.2, February 211 61 FPGA Based Fxed Wdth 4 4, 6 6, 8 8 and 12 12-Bt Multplers usng Spartan-3AN Muhammad H. Ras and Mohamed H.

More information

A Robust Method for Estimating the Fundamental Matrix

A Robust Method for Estimating the Fundamental Matrix Proc. VIIth Dgtal Image Computng: Technques and Applcatons, Sun C., Talbot H., Ourseln S. and Adraansen T. (Eds.), 0- Dec. 003, Sydney A Robust Method for Estmatng the Fundamental Matrx C.L. Feng and Y.S.

More information

High-Boost Mesh Filtering for 3-D Shape Enhancement

High-Boost Mesh Filtering for 3-D Shape Enhancement Hgh-Boost Mesh Flterng for 3-D Shape Enhancement Hrokazu Yagou Λ Alexander Belyaev y Damng We z Λ y z ; ; Shape Modelng Laboratory, Unversty of Azu, Azu-Wakamatsu 965-8580 Japan y Computer Graphcs Group,

More information

Feature Reduction and Selection

Feature Reduction and Selection Feature Reducton and Selecton Dr. Shuang LIANG School of Software Engneerng TongJ Unversty Fall, 2012 Today s Topcs Introducton Problems of Dmensonalty Feature Reducton Statstc methods Prncpal Components

More information

Classifier Selection Based on Data Complexity Measures *

Classifier Selection Based on Data Complexity Measures * Classfer Selecton Based on Data Complexty Measures * Edth Hernández-Reyes, J.A. Carrasco-Ochoa, and J.Fco. Martínez-Trndad Natonal Insttute for Astrophyscs, Optcs and Electroncs, Lus Enrque Erro No.1 Sta.

More information

Array transposition in CUDA shared memory

Array transposition in CUDA shared memory Array transposton n CUDA shared memory Mke Gles February 19, 2014 Abstract Ths short note s nspred by some code wrtten by Jeremy Appleyard for the transposton of data through shared memory. I had some

More information

Research of Dynamic Access to Cloud Database Based on Improved Pheromone Algorithm

Research of Dynamic Access to Cloud Database Based on Improved Pheromone Algorithm , pp.197-202 http://dx.do.org/10.14257/dta.2016.9.5.20 Research of Dynamc Access to Cloud Database Based on Improved Pheromone Algorthm Yongqang L 1 and Jn Pan 2 1 (Software Technology Vocatonal College,

More information

Content Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers

Content Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers IOSR Journal of Electroncs and Communcaton Engneerng (IOSR-JECE) e-issn: 78-834,p- ISSN: 78-8735.Volume 9, Issue, Ver. IV (Mar - Apr. 04), PP 0-07 Content Based Image Retreval Usng -D Dscrete Wavelet wth

More information

Edge Detection in Noisy Images Using the Support Vector Machines

Edge Detection in Noisy Images Using the Support Vector Machines Edge Detecton n Nosy Images Usng the Support Vector Machnes Hlaro Gómez-Moreno, Saturnno Maldonado-Bascón, Francsco López-Ferreras Sgnal Theory and Communcatons Department. Unversty of Alcalá Crta. Madrd-Barcelona

More information

Outline. Digital Systems. C.2: Gates, Truth Tables and Logic Equations. Truth Tables. Logic Gates 9/8/2011

Outline. Digital Systems. C.2: Gates, Truth Tables and Logic Equations. Truth Tables. Logic Gates 9/8/2011 9/8/2 2 Outlne Appendx C: The Bascs of Logc Desgn TDT4255 Computer Desgn Case Study: TDT4255 Communcaton Module Lecture 2 Magnus Jahre 3 4 Dgtal Systems C.2: Gates, Truth Tables and Logc Equatons All sgnals

More information

Overview. Basic Setup [9] Motivation and Tasks. Modularization 2008/2/20 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION

Overview. Basic Setup [9] Motivation and Tasks. Modularization 2008/2/20 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION Overvew 2 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION Introducton Mult- Smulator MASIM Theoretcal Work and Smulaton Results Concluson Jay Wagenpfel, Adran Trachte Motvaton and Tasks Basc Setup

More information

CSCI 104 Sorting Algorithms. Mark Redekopp David Kempe

CSCI 104 Sorting Algorithms. Mark Redekopp David Kempe CSCI 104 Sortng Algorthms Mark Redekopp Davd Kempe Algorthm Effcency SORTING 2 Sortng If we have an unordered lst, sequental search becomes our only choce If we wll perform a lot of searches t may be benefcal

More information

Repeater Insertion for Two-Terminal Nets in Three-Dimensional Integrated Circuits

Repeater Insertion for Two-Terminal Nets in Three-Dimensional Integrated Circuits Repeater Inserton for Two-Termnal Nets n Three-Dmensonal Integrated Crcuts Hu Xu, Vasls F. Pavlds, and Govann De Mchel LSI - EPFL, CH-5, Swtzerland, {hu.xu,vasleos.pavlds,govann.demchel}@epfl.ch Abstract.

More information

Smoothing Spline ANOVA for variable screening

Smoothing Spline ANOVA for variable screening Smoothng Splne ANOVA for varable screenng a useful tool for metamodels tranng and mult-objectve optmzaton L. Rcco, E. Rgon, A. Turco Outlne RSM Introducton Possble couplng Test case MOO MOO wth Game Theory

More information

DESIGNING TRANSMISSION SCHEDULES FOR WIRELESS AD HOC NETWORKS TO MAXIMIZE NETWORK THROUGHPUT

DESIGNING TRANSMISSION SCHEDULES FOR WIRELESS AD HOC NETWORKS TO MAXIMIZE NETWORK THROUGHPUT DESIGNING TRANSMISSION SCHEDULES FOR WIRELESS AD HOC NETWORKS TO MAXIMIZE NETWORK THROUGHPUT Bran J. Wolf, Joseph L. Hammond, and Harlan B. Russell Dept. of Electrcal and Computer Engneerng, Clemson Unversty,

More information

An Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices

An Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices Internatonal Mathematcal Forum, Vol 7, 2012, no 52, 2549-2554 An Applcaton of the Dulmage-Mendelsohn Decomposton to Sparse Null Space Bases of Full Row Rank Matrces Mostafa Khorramzadeh Department of Mathematcal

More information

CMPS 10 Introduction to Computer Science Lecture Notes

CMPS 10 Introduction to Computer Science Lecture Notes CPS 0 Introducton to Computer Scence Lecture Notes Chapter : Algorthm Desgn How should we present algorthms? Natural languages lke Englsh, Spansh, or French whch are rch n nterpretaton and meanng are not

More information

Comparison of Heuristics for Scheduling Independent Tasks on Heterogeneous Distributed Environments

Comparison of Heuristics for Scheduling Independent Tasks on Heterogeneous Distributed Environments Comparson of Heurstcs for Schedulng Independent Tasks on Heterogeneous Dstrbuted Envronments Hesam Izakan¹, Ath Abraham², Senor Member, IEEE, Václav Snášel³ ¹ Islamc Azad Unversty, Ramsar Branch, Ramsar,

More information

An Image Fusion Approach Based on Segmentation Region

An Image Fusion Approach Based on Segmentation Region Rong Wang, L-Qun Gao, Shu Yang, Yu-Hua Cha, and Yan-Chun Lu An Image Fuson Approach Based On Segmentaton Regon An Image Fuson Approach Based on Segmentaton Regon Rong Wang, L-Qun Gao, Shu Yang 3, Yu-Hua

More information

APPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT

APPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT 3. - 5. 5., Brno, Czech Republc, EU APPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT Abstract Josef TOŠENOVSKÝ ) Lenka MONSPORTOVÁ ) Flp TOŠENOVSKÝ

More information

An Investigation into Server Parameter Selection for Hierarchical Fixed Priority Pre-emptive Systems

An Investigation into Server Parameter Selection for Hierarchical Fixed Priority Pre-emptive Systems An Investgaton nto Server Parameter Selecton for Herarchcal Fxed Prorty Pre-emptve Systems R.I. Davs and A. Burns Real-Tme Systems Research Group, Department of omputer Scence, Unversty of York, YO10 5DD,

More information

S1 Note. Basis functions.

S1 Note. Basis functions. S1 Note. Bass functons. Contents Types of bass functons...1 The Fourer bass...2 B-splne bass...3 Power and type I error rates wth dfferent numbers of bass functons...4 Table S1. Smulaton results of type

More information

AADL : about scheduling analysis

AADL : about scheduling analysis AADL : about schedulng analyss Schedulng analyss, what s t? Embedded real-tme crtcal systems have temporal constrants to meet (e.g. deadlne). Many systems are bult wth operatng systems provdng multtaskng

More information

Active Contours/Snakes

Active Contours/Snakes Actve Contours/Snakes Erkut Erdem Acknowledgement: The sldes are adapted from the sldes prepared by K. Grauman of Unversty of Texas at Austn Fttng: Edges vs. boundares Edges useful sgnal to ndcate occludng

More information

Channel 0. Channel 1 Channel 2. Channel 3 Channel 4. Channel 5 Channel 6 Channel 7

Channel 0. Channel 1 Channel 2. Channel 3 Channel 4. Channel 5 Channel 6 Channel 7 Optmzed Regonal Cachng for On-Demand Data Delvery Derek L. Eager Mchael C. Ferrs Mary K. Vernon Unversty of Saskatchewan Unversty of Wsconsn Madson Saskatoon, SK Canada S7N 5A9 Madson, WI 5376 eager@cs.usask.ca

More information

A RECONFIGURABLE ARCHITECTURE FOR MULTI-GIGABIT SPEED CONTENT-BASED ROUTING. James Moscola, Young H. Cho, John W. Lockwood

A RECONFIGURABLE ARCHITECTURE FOR MULTI-GIGABIT SPEED CONTENT-BASED ROUTING. James Moscola, Young H. Cho, John W. Lockwood A RECONFIGURABLE ARCHITECTURE FOR MULTI-GIGABIT SPEED CONTENT-BASED ROUTING James Moscola, Young H. Cho, John W. Lockwood Dept. of Computer Scence and Engneerng Washngton Unversty, St. Lous, MO {jmm5,

More information

A Unified Framework for Semantics and Feature Based Relevance Feedback in Image Retrieval Systems

A Unified Framework for Semantics and Feature Based Relevance Feedback in Image Retrieval Systems A Unfed Framework for Semantcs and Feature Based Relevance Feedback n Image Retreval Systems Ye Lu *, Chunhu Hu 2, Xngquan Zhu 3*, HongJang Zhang 2, Qang Yang * School of Computng Scence Smon Fraser Unversty

More information

CHAPTER 4 PARALLEL PREFIX ADDER

CHAPTER 4 PARALLEL PREFIX ADDER 93 CHAPTER 4 PARALLEL PREFIX ADDER 4.1 INTRODUCTION VLSI Integer adders fnd applcatons n Arthmetc and Logc Unts (ALUs), mcroprocessors and memory addressng unts. Speed of the adder often decdes the mnmum

More information

An Efficient Garbage Collection for Flash Memory-Based Virtual Memory Systems

An Efficient Garbage Collection for Flash Memory-Based Virtual Memory Systems S. J and D. Shn: An Effcent Garbage Collecton for Flash Memory-Based Vrtual Memory Systems 2355 An Effcent Garbage Collecton for Flash Memory-Based Vrtual Memory Systems Seunggu J and Dongkun Shn, Member,

More information

An efficient iterative source routing algorithm

An efficient iterative source routing algorithm An effcent teratve source routng algorthm Gang Cheng Ye Tan Nrwan Ansar Advanced Networng Lab Department of Electrcal Computer Engneerng New Jersey Insttute of Technology Newar NJ 7 {gc yt Ansar}@ntedu

More information

Routing in Degree-constrained FSO Mesh Networks

Routing in Degree-constrained FSO Mesh Networks Internatonal Journal of Hybrd Informaton Technology Vol., No., Aprl, 009 Routng n Degree-constraned FSO Mesh Networks Zpng Hu, Pramode Verma, and James Sluss Jr. School of Electrcal & Computer Engneerng

More information

Video Proxy System for a Large-scale VOD System (DINA)

Video Proxy System for a Large-scale VOD System (DINA) Vdeo Proxy System for a Large-scale VOD System (DINA) KWUN-CHUNG CHAN #, KWOK-WAI CHEUNG *# #Department of Informaton Engneerng *Centre of Innovaton and Technology The Chnese Unversty of Hong Kong SHATIN,

More information

Optimal Scheduling of Capture Times in a Multiple Capture Imaging System

Optimal Scheduling of Capture Times in a Multiple Capture Imaging System Optmal Schedulng of Capture Tmes n a Multple Capture Imagng System Tng Chen and Abbas El Gamal Informaton Systems Laboratory Department of Electrcal Engneerng Stanford Unversty Stanford, Calforna 9435,

More information

Evaluation of Parallel Processing Systems through Queuing Model

Evaluation of Parallel Processing Systems through Queuing Model ISSN 2278-309 Vkas Shnde, Internatonal Journal of Advanced Volume Trends 4, n Computer No.2, March Scence - and Aprl Engneerng, 205 4(2), March - Aprl 205, 36-43 Internatonal Journal of Advanced Trends

More information

OPTIMAL VIDEO SUMMARY GENERATION AND ENCODING. (ICIP Draft v0.2, )

OPTIMAL VIDEO SUMMARY GENERATION AND ENCODING. (ICIP Draft v0.2, ) OPTIMAL VIDEO SUMMARY GENERATION AND ENCODING + Zhu L, * Aggelos atsaggelos and + Bhavan Gandh (ICIP Draft v.2, -2-23) + Multmeda Communcaton Research Lab, Motorola Labs, Schaumburg * Department of Electrcal

More information

A Modified Median Filter for the Removal of Impulse Noise Based on the Support Vector Machines

A Modified Median Filter for the Removal of Impulse Noise Based on the Support Vector Machines A Modfed Medan Flter for the Removal of Impulse Nose Based on the Support Vector Machnes H. GOMEZ-MORENO, S. MALDONADO-BASCON, F. LOPEZ-FERRERAS, M. UTRILLA- MANSO AND P. GIL-JIMENEZ Departamento de Teoría

More information

MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION

MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION Paulo Quntlano 1 & Antono Santa-Rosa 1 Federal Polce Department, Brasla, Brazl. E-mals: quntlano.pqs@dpf.gov.br and

More information

Run-Time Operator State Spilling for Memory Intensive Long-Running Queries

Run-Time Operator State Spilling for Memory Intensive Long-Running Queries Run-Tme Operator State Spllng for Memory Intensve Long-Runnng Queres Bn Lu, Yal Zhu, and lke A. Rundenstener epartment of Computer Scence, Worcester Polytechnc Insttute Worcester, Massachusetts, USA {bnlu,

More information

LECTURE : MANIFOLD LEARNING

LECTURE : MANIFOLD LEARNING LECTURE : MANIFOLD LEARNING Rta Osadchy Some sldes are due to L.Saul, V. C. Raykar, N. Verma Topcs PCA MDS IsoMap LLE EgenMaps Done! Dmensonalty Reducton Data representaton Inputs are real-valued vectors

More information

Tsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance

Tsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance Tsnghua Unversty at TAC 2009: Summarzng Mult-documents by Informaton Dstance Chong Long, Mnle Huang, Xaoyan Zhu State Key Laboratory of Intellgent Technology and Systems, Tsnghua Natonal Laboratory for

More information

A fast algorithm for color image segmentation

A fast algorithm for color image segmentation Unersty of Wollongong Research Onlne Faculty of Informatcs - Papers (Arche) Faculty of Engneerng and Informaton Scences 006 A fast algorthm for color mage segmentaton L. Dong Unersty of Wollongong, lju@uow.edu.au

More information

TN348: Openlab Module - Colocalization

TN348: Openlab Module - Colocalization TN348: Openlab Module - Colocalzaton Topc The Colocalzaton module provdes the faclty to vsualze and quantfy colocalzaton between pars of mages. The Colocalzaton wndow contans a prevew of the two mages

More information

6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour

6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour 6.854 Advanced Algorthms Petar Maymounkov Problem Set 11 (November 23, 2005) Wth: Benjamn Rossman, Oren Wemann, and Pouya Kheradpour Problem 1. We reduce vertex cover to MAX-SAT wth weghts, such that the

More information

Load-Balanced Anycast Routing

Load-Balanced Anycast Routing Load-Balanced Anycast Routng Chng-Yu Ln, Jung-Hua Lo, and Sy-Yen Kuo Department of Electrcal Engneerng atonal Tawan Unversty, Tape, Tawan sykuo@cc.ee.ntu.edu.tw Abstract For fault-tolerance and load-balance

More information

A Saturation Binary Neural Network for Crossbar Switching Problem

A Saturation Binary Neural Network for Crossbar Switching Problem A Saturaton Bnary Neural Network for Crossbar Swtchng Problem Cu Zhang 1, L-Qng Zhao 2, and Rong-Long Wang 2 1 Department of Autocontrol, Laonng Insttute of Scence and Technology, Benx, Chna bxlkyzhangcu@163.com

More information

Multi-objective Virtual Machine Placement for Load Balancing

Multi-objective Virtual Machine Placement for Load Balancing Mult-obectve Vrtual Machne Placement for Load Balancng Feng FANG and Bn-Bn Qu,a School of Computer Scence & Technology, Huazhong Unversty Of Scence And Technology, Wuhan, Chna Abstract. The vrtual machne

More information

Improving Low Density Parity Check Codes Over the Erasure Channel. The Nelder Mead Downhill Simplex Method. Scott Stransky

Improving Low Density Parity Check Codes Over the Erasure Channel. The Nelder Mead Downhill Simplex Method. Scott Stransky Improvng Low Densty Party Check Codes Over the Erasure Channel The Nelder Mead Downhll Smplex Method Scott Stransky Programmng n conjuncton wth: Bors Cukalovc 18.413 Fnal Project Sprng 2004 Page 1 Abstract

More information

Course Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms

Course Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms Course Introducton Course Topcs Exams, abs, Proects A quc loo at a few algorthms 1 Advanced Data Structures and Algorthms Descrpton: We are gong to dscuss algorthm complexty analyss, algorthm desgn technques

More information

Two-Stage Data Distribution for Distributed Surveillance Video Processing with Hybrid Storage Architecture

Two-Stage Data Distribution for Distributed Surveillance Video Processing with Hybrid Storage Architecture Two-Stage Data Dstrbuton for Dstrbuted Survellance Vdeo Processng wth Hybrd Storage Archtecture Yangyang Gao, Hatao Zhang, Bngchang Tang, Yanpe Zhu, Huadong Ma Bejng Key Lab of Intellgent Telecomm. Software

More information

Cluster Analysis of Electrical Behavior

Cluster Analysis of Electrical Behavior Journal of Computer and Communcatons, 205, 3, 88-93 Publshed Onlne May 205 n ScRes. http://www.scrp.org/ournal/cc http://dx.do.org/0.4236/cc.205.350 Cluster Analyss of Electrcal Behavor Ln Lu Ln Lu, School

More information

Simple March Tests for PSF Detection in RAM

Simple March Tests for PSF Detection in RAM Smple March Tests for PSF Detecton n RAM Ireneusz Mroze Balysto Techncal Unversty Computer Scence Department Wejsa 45A, 5-35 Balysto POLAND mroze@.pb.balysto.pl Eugena Buslowsa Balysto Techncal Unversty

More information

Mallathahally, Bangalore, India 1 2

Mallathahally, Bangalore, India 1 2 7 IMPLEMENTATION OF HIGH PERFORMANCE BINARY SQUARER PRADEEP M C, RAMESH S, Department of Electroncs and Communcaton Engneerng, Dr. Ambedkar Insttute of Technology, Mallathahally, Bangalore, Inda pradeepmc@gmal.com,

More information

High resolution 3D Tau-p transform by matching pursuit Weiping Cao* and Warren S. Ross, Shearwater GeoServices

High resolution 3D Tau-p transform by matching pursuit Weiping Cao* and Warren S. Ross, Shearwater GeoServices Hgh resoluton 3D Tau-p transform by matchng pursut Wepng Cao* and Warren S. Ross, Shearwater GeoServces Summary The 3D Tau-p transform s of vtal sgnfcance for processng sesmc data acqured wth modern wde

More information

Combined Functional Partitioning and Communication Speed Selection for Networked Voltage-Scalable Processors Λ

Combined Functional Partitioning and Communication Speed Selection for Networked Voltage-Scalable Processors Λ Combned Functonal Parttonng and Communcaton Speed Selecton for Networked Voltage-Scalable Processors Λ Jnfeng Lu, Pa H. Chou, Nader Bagherzadeh epartment of Electrcal & Computer Engneerng Unversty of Calforna,

More information

Related-Mode Attacks on CTR Encryption Mode

Related-Mode Attacks on CTR Encryption Mode Internatonal Journal of Network Securty, Vol.4, No.3, PP.282 287, May 2007 282 Related-Mode Attacks on CTR Encrypton Mode Dayn Wang, Dongda Ln, and Wenlng Wu (Correspondng author: Dayn Wang) Key Laboratory

More information

ELEC 377 Operating Systems. Week 6 Class 3

ELEC 377 Operating Systems. Week 6 Class 3 ELEC 377 Operatng Systems Week 6 Class 3 Last Class Memory Management Memory Pagng Pagng Structure ELEC 377 Operatng Systems Today Pagng Szes Vrtual Memory Concept Demand Pagng ELEC 377 Operatng Systems

More information

IP Camera Configuration Software Instruction Manual

IP Camera Configuration Software Instruction Manual IP Camera 9483 - Confguraton Software Instructon Manual VBD 612-4 (10.14) Dear Customer, Wth your purchase of ths IP Camera, you have chosen a qualty product manufactured by RADEMACHER. Thank you for the

More information