3D Partitioning for Interference and Area Minimization

Size: px
Start display at page:

Download "3D Partitioning for Interference and Area Minimization"

Transcription

1 D Partitioig for Iterferece ad Area Miimizatio Hsi-Hsiug Huag ad Tsai-Mig Hsieh Abstract This work defies a ove probem i which a set of modues is assiged to a set of siico ayers i order to miimize the tota chip area whie satisfyig the characteristic costraits. A iteger iear programmig (ILP)-based partitioig approach is aso deveoped to assig a set of modues to the ayers of a three-dimesioa architecture durig a foor-paig phase. The proposed approach attempts to miimize the chip area, which is the maximum siico ayer area amog the set of ayers i a three-dimesioa system-i-package (SIP) architecture. Moreover, the circuit properties i which the digita ad aaog modues ot to assig to the same ayer are icorporated to icrease siga itegrity durig the partitioig stage. The optima modue assigmet for the three-dimesioa SIP architecture coud be obtaied because a the costraits i this work are iear fuctios. Experimeta resuts idicate that the proposed ILP-based method ca miimize the chip area whie meetig the SIP costraits of circuit properties to reduce the potetia of the wires i the digita ad aaog modues. The chip area is arger tha that of the method that does ot cosider properties of modues. Importaty, the proposed ILP-based approach sigificaty reduces the umber of the potetia to be zero by assigig aaog ad digita modues to the differet ayers of the SIP architecture. Keywords Iterferece, SIP-ware partitioig, iteger iear programmig, area miimizatio. T I. INTRODUCTION hree-dimesioa architecture i moder chip desig has may beefits [][][]. The ove three-dimesioa SIP architecture ca sigificaty improve the chip area, tota wire-egth, the umber of via cout ad performace. Hece, a icreasig umber of studies have ivestigated how to miimize the chip area for a three-dimesioa foor-paer. Moreover, compared to a sige-objective, a effective agorithm has bee used to sove a muti-objective probem [4]. Mauscript received Juy 6, 0: Revised versio received August, 0. This work was supported i part by the NSC99-5-E-6-07 from Natioa Sciece Couci. Hsi-Hsiug Huag is with the Lughwa Uiversity of Sciece ad Techoogy, Dept. of Eectroic Egieerig, No.00, Sec.,Washou Rd., Guisha Shiag, Taoyua Couty 06, Taiwa (R.O.C) (phoe: ext:56, fax: , e-mai: [email protected]) Tsai-Mig Hsieh is with the Departmet of Iformatio ad Computer Egieerig, Chug Yua Christia Uiversity, Chug-Li, 0, Taiwa (R.O.C.). (correspodig author to provide phoe: , fax: , e-mai: [email protected]) Iterferece degrades the siga itegrity betwee modues ad itercoectios with the differet properties or circuit characteristics of mixed-mode systems [5]. Tummaa derived a soutio for a mixed-siga system to meet the emergecy requiremets [6]. Laas et a. aayzed stochastic parametric resoace ad discussed the importace of oise [7]. Driovsky et a. expored the isertio oss of fiter for the EMI effects uder a testig eviromet [8]. Ho et a. discussed the crosstak () betwee wires for a mutipe-eve router [9]. Wag et a. deveoped a crosstak aware goba router to avoidig assig og segmets to differet tracks [0]. Most of studies reduce the crosstak or betwee wire sigas by the heuristic agorithms. The feasibiity of appyig iteger iear programmigbased approaches to optimize the chip area, tota wire egth, power cosumptio ad cock period has bee studied. Li et a. deveoped a ILP-based approach to reduce the tota wirig area for aaog circuit desig []. Nguye et a. preseted a ILP-based method, which optimizes simutaeousy power ad deay for the VLSI circuit desigs []. Chie et a. expored the feasibiity of usig a ILP-based approach to reduce the power cosumptio of a gate eve etist uder timig, power ad area costraits []. Chai et a. studied ILP formuatios ad soved differet miimizatio probems of the peak curret ad eakage [4]. Huag et a. miimized the cock period for sequetia circuit durig the high eve sythesis usig a ILP-based approach [5]. However, most of the above works did ot focus o the area miimizatio for the SIP architecture. Recet efforts have examied the use of ove three-dimesioa (D) foorpaig as the gate couts are growig rapidy [6]. Yamazaki et a. deveoped the three-dimesioa represetatio of the foorpaers with the mutipe objectives such as therma issues ad the area miimizatio [7]. Hug et a. preseted a foorpaer, which cosidered the therma issue by icorporatig a haf-perimeter egth estimator [8]. Tsai et a. addressed the therma issues for the three-dimesioa foorpaig with through-siicovia ad the physica positio for subcircuits [9]. Xiao et a. provided the fixed-outie costraits for the three-dimesioa foorpaig ad isertig through-siico-via to reduce the icidece of therma probems [0]. Some of works faied to achieve their objectives whe usig the heuristic method. Issue 6, Voume 5, 0 65

2 The mai cotributios of this paper are as foows. This work formuates a modue assigmet probem which determies the set of modues to the proper ayer i a three-dimesioa architecture. Circuit properties are formuated to reduce the betwee the aaog ad digita modues by the ILP formuatios. Additioay, a costraits are defied by ieary fuctios to obtai the optima soutio uder the give costraits of the properties. Furthermore, the ILP formuatios are efficiet to obtai the optima soutio with a acceptabe rutime. For each siico ayer, the partitioed resuts cotaiig some modues ca be further fed ito a simuated aeaig-based foorpaer that appies a sequece-pair to perturb reatioships betwee modues, for a situatio i which a feasibe foorpa is eeded for a three-dimesioa architecture. The rest of this paper is orgaized as foows. Sectio II describes the SIP architecture, the umber of potetia, the motivatio of cosideratio of modue characteristics ad probem defiitio. Sectio III the itroduces the -aware partitioig scheme to miimize the chip area for a three-dimesioa architecture. Sectio IV summarizes the experimeta resuts. Cocusios are fiay draw i Sectio V. II. PRELIMINARY This sectio describes i detai the system-i-package architecture. The umber of potetia is defied. The motivatio of cosiderig the circuit properties is the discussed to expore how the ILP-based approach hades the -aware partitioig scheme. Moreover, a -aware probem is formuated i the paper. A. Reviewer ad Trasformatio of System-i-Package Some approaches have bee deveoped to icrease productio capacity ad reduce time-to-market deivery [][][]. System-i-packet is a effective approach for a three-dimesioa architecture []. The system-i-packet architecture cotais ayers, such as the (RAM) ayers, digita ogic ayers ad aaog ayers. Figure (a) shows a set of pre-defied iteectua properties (IPs for short) which are paced i the correspodig ayers of the SIP architecture. Figure (b) deotes SIP compoets, icudig three ayers (i.e., digita ad aaog ayers) ad the wire bidig, which are used to coect the wires of modues that are ocated i the differet ayers. For simpicity, the SIP architecture is trasformed ito a set of siico ayers without the wire boudig compoet. I this work does ot cosider the itercoectios betwee the differet modues i differet ayers. Figure shows the trasformatio by omittig the wire bidig compoet ad system-i-package itegrated circuit (). The three ayers are the, aaog ad digita ayers. Each modue i is trasformed ito a rectaguar modue with the correspodig modue area (a i ), height (h i ) ad width (w i ). Figure iustrates the trasformatio from a IP ito a rectaguar modue. Based o the above discussio, Figure 4 pots the probem of assigig IPs to the stacked SIP architecture. Figure 4(a) shows the origia circuit which cotais six hard modues with the correspodig modue areas ad the SIP architecture with, aaog ad digita ayers. Figure 4(b) shows the represetatio with six rectaguar obstaces ad three ayers. Moreover, their modue properties (i.e., digita or aaog) are deotig usig three coors. Ram Aaog Ram Aaog (a) a set of modues with properties wire boudig Aaog (b) stacked three-dimesioa SIP Figure. Rea modue assigmet probem wire boudig Aaog Aaog Figure. Trasformatio of a system-i-package. Iteectua property w i h i Figure. Trasformatio of pre-defied iteectua property. a i w i Issue 6, Voume 5, 0 66

3 wire boudig Aaog Aaog Aaog digita aago (a) 6 modues ` a = a = a = a 4 = 4 a 5 = 5 a 6 = 6 B. Computatio of the Number of Potetia Iterferece Siga itegrity pays a sigificat roe i the moder chip desigs because of the icreasig umber of the digita ad aaog modes co-desiged i a sige system. As is we kow digita wires are ormay too strog to be high eve or ow eve sigas. I cotrast, the aaog sigas are easiy degraded ad destroyed by other adjacet digita wires. The startig or edig times of aaog wires may be deayed whe adjacet digita wires affect the aaog sigas. Furthermore, a uexpected gitch siga may appear i the aaog modues whe adjacet digita wires are aways at a high or ow votage (Figure 5). For the situatio i Figure 5, properties of the aaog modues may ead to mafuctio of the aaog sigas i the mixed-mode system. wires i aaog modue Iterfeuce by digita modue wires i digita modue (b) D architecture Figure 4. Iustratio of the SIP-aware D partitioig high votage ow votage high votage ow votage Figure 5. Iustratio of the potetia Potetia i the SIP architecture is measured by defiig the umber of potetia as foows., the aaog (digita) modue i is assiged to Nik (, ) = the digita (aaog) ayer k; () 0, otherwise; where Nik (, ) deotes the umber of potetia for modue i to the ayer k. This fidig suggests that if the aaog modue is assiged to the digita ayers of the SIP architecture, the umber of potetia icreases by oe. Simiary, the digita modue, which is assiged to the aaog ayer i the SIP architecture, is regarded as the potetia. C. Motivatio Area miimizatio ad potetia betwee modues i the same ayer are of priority cocer i the moder D stacked architecture. Whie faiig to cosider the issue betwee the digita modues ad the aaog modues ormay miimizes the chip area for the D foorpaig However, adjacet digita wires may uexpectedy destroy some aaog wires. Figure 6(a) demostrates the side effect due to the. Without focusig o the modue property, the digita modues may be assiged to the aaog ayer i order to miimize the chip area. Wires i the digita modue which is assiged to the aaog ayer potetiay degrade the wires i the aaog modue 4. Simiary, the wires i the aaog modue 5 may suffer uder the same circumstaces. Issue 6, Voume 5, 0 67

4 a 6 = 6 a = a 6 = 6 a = a = a 4 = 4 potetia a 5 = 5 a 4 = 4 free a = a 5 = 5 potetia a = a = free (a) chip area is 7 ad potetia is (b) chip area is 9 ad potetia is 0 Figure 6. Effect of the -ware partitioig Whie cosiderig the SIP costraits to assig a modue to the correspodig ayers i the SIP architecture, our ove formuatios obtai the -free modue assigmet soutio with a itte additioa chip area. I Figure 6(b), the aaog modues 4 ad 5 are assiged to the aaog ayer ad the umber of potetia s is zero. Simiary, o potetia occurs for digita ayers ad. Accordig to our resuts, the chip area coud be icreased to 9 with sma additioa chip area. This observatio motivates us to expore the ILP-based SIP-aware formuatios i order to miimize the chip area whie meetig the SIP costraits. This work examies how to achieve this mutipe-objective i this paper. Aaog Aaog Aaog Aaog (a) SIP-aware Partitioig Aaog aago digita D. Probem Defiitio Figure 7 shows the overa D foorpaig, i which the SIP-aware partitioig stage is of particuar focus. For the partitioed resuts i each ayer, the we-deveoped foorpaer which is based o the D represetatio (e.q. sequetia-pair) ca used to obtai a feasibe foorpa. Therefore, the probem discussed here is formuated as foows. Give a set of modue area { a, a, a,... a }, ad a set of k siico ayers {,,,... k } for three-dimesioa SIP architecture. For a set of modues { m, m, m,... m }, each modue has it correspodig properties { p, p, p,..., p }. Each modue is assiged to oe siico ayers. The work attempts to meet the SIP characteristic costraits whie miimizig the chip area for the SIP architecture. a 0 = 0 a 4=4 a 5=5 a a 6=6 7=7 (b)foorpaig a 0 = 0 a = a 9 = 9 a = a = a 4=4 a 9 = 9 a5=5 a = a = a = a 7=7 a 6=6 a = 7 a = 7 ayer Aaog ayer ayer ayer Figure 7. Iustratio of desig fow. Issue 6, Voume 5, 0 68

5 wire boudig Aaog digita aago Aaog Aaog (a) D SIP partitioig Aaog Aaog ` a = a = a 0 = 0 a = a = 7 a 9 = 9 a 4 = 4 a 5 = 5 a 6 =6 a 7 = 7 Figure 8. Iustratio of -free three-dimesioa partitioig (b) Modeig 4 III. ILP FORMULATION FOR SIP-AWARE PARTITIONING This sectio discusses ILP formuatios with -aware for the SIP architecture, i which the modue shaped is fixed (i.e. hard modues). May foorpaers have bee deveoped i the recet iterature. Therefore, this work discusses i detai the SIP-aware partitioig. A. Area Miimizatio Formuatio with SIP costraits A attempt is made to determie automaticay the modue assigmet automaticay by settig a biary variabe x(, i j ) to oe, if the modue i is assiged to the ayer j, otherwise x(, i j ) is set to be zero. The objective of this work is derived as foows, mi tota _ area () Subject to x(, i j ) = ; () i= j deotes aowed ayers tota_area ai x( i, j); (4) i= where x(, i j) deotes the biary variabe for the modue i, which is assiged to the ayer j. ai represets the modue area of the moduei. For each modue, to meet the SIP costraits, ot a ayers i a three-dimesioa SIP architecture coud be assiged. The tota _ area refers to the maximum chip area amog the three-dimesioa SIP architecture with k ayers. Formua () gives the objective to miimize the chip area for the three-dimesioa SIP architecture with k ayers. Formua () idicates that each modue i is assiged to oy oe ayer j. Formua (4) reveas that the maximum chip area is arger tha the area of each ayer j. By doig so, the umber represetig the ayer area ca be reduced. Origiay, the area of each ayer is deoted by usig four variabes. Notaby, reducig four variabes ito oe variabe speeds up the computatioa time. Reducig the potetia for the aaog modues ad digita modues ivoves the modue assigmet accordig to the modue property ad the SIP-aware costraits. This fidig suggests that the biary vaues deotig the modue assigmet shoud be modified. For istace, if modue is the aaog modue ad this modue shoud be assiged to ayer i order to reduce the potetia for the SIP architecture with four ayers, the biary variabe shoud be x (, ) = ad x(,) = x(,) = x(,4) = 0. B. Iustrative Exampe By usig a iustrative exampe, this subsectio expais how to formuate the proposed ILP formuatios with a SIP costrait. Origiay formuated as Figure 8(a), Figure 8(b) shows four ayers ad modues with the correspodig properties. For the SIP-aware partitioig scheme, = ad k = 4. Simiary, the objective is described as foows. mi = tota _ area; (5) Figure 8(b) reveas the foowig costraits to represet the chip area. a = ; a = ; a = ; a4 = 4; a5 = 5; a6 = 6; a7 = 7; a8 = 8; a9 = 9; a = 0; a = 7; 0 Notaby, i this paper, o modue is partitioed ad we the modue assigmet is defied by usig the biary variabe. For modue, four optios are avaiabe to pace i a three-dimesioa SIP architecture, thus eadig to (6) x(,) + x(, ) + x(,) + x(, 4) = ; (7) To meet paper space imitatio, oy modues ad are used to represet the reatio as foows. ad x(,) + x(,) + x(,) + x(,4) = ; (8) x(,) + x(, ) + x(, ) + x(, 4) = ; (9) Issue 6, Voume 5, 0 69

6 a 0 = 0 potetia a 0 = 0 a = a 4 = 4 a 5 = 5 a 7 = 7 a = a 4 = 4 a 5 = 5 a 9 = 9 a = a = 7 potetia a = a = a 6 = 6 a 7 = 7 4 a = a 6 = 6 a 9 = 9 potetia 4 a = 7 Iterferece free (a) partitioig with potetia (b) -free partitioig Figure 9. Iustratio of -free SIP partitioig The area boud for a ayers cotaiig a set of modues is give. I ayer, the tota ayer area is the sum of modue areas from modues to. Based o the above discussio, we defie biary variabes x (,), x (,),..., ad x (,) to deote the reatio of a modues ad a ayers, respectivey. The ayer area i ayer is obtaied with the foowig formua. tota_area a x(,) + a x(,) + a x(,) + a4 x(4,) + a5 x(5,) + a6 x(6,) + a7 x(7,) + a8 x(8,) + a9 x(9,) + a x(0,) + a x(,); 0 (0) Simiary, the ayer area ca be formuated based o the above discussio for ayers, ad 4. Without cosiderig SIP costraits (circuit properties) of modues ad ayers i the SIP architecture, the assiged modue ca be derived as foows. ad x(8,) = x(0,) = () x(, ) = x(4, ) = x(5, ) = x(7, ) = () x(, ) = x(, ) = () x(, 4) = x(6, 4) = x(9, 4) = (4) The above equatios revea that the optima chip area is tota _ area = 8 with potetia. Figure 9(a) summarizes the partitioed resuts for this circuit. I ayer (a aaog ayer), digita modues ad 7 are assiged. Accordig to the computatio of the potetia, the umber of potetia is. Simiary, aaog modues ad 9 are assiged to the ayers ad 4 (two digita ayers) ad the umber of the potetia is ad, respectivey. Therefore, the approach without cosiderig the potetia betwee the modues, the umber of potetia is 4. The of modue assigmet must be addressed ad reduced. Cosiderig the SIP costraits which are based o the properties of the modues ad the ayers aows us to reduce the potetia issue. For modue, it is proper to assig this modue to the digita ayers ad 4 ad we have the formua of x(,)+ x(,4)=. Simiary, for modue, we have x(,)+ x(,4)=. For the digita modues 6, 7 ad, we have x(6,)+ x(6,4)=, x(7,)+ x(7,4)= ad x(,)+ x(,4)=. Ivovig the above costraits i the LIP formuatio aows us to miimize the chip area whie reducig the umber of potetia. The modue assigmet is as foows. ad x(8,) = x(0,) = (5) x(,) = x(4,) = x(5,) = x(9,) = (6) x(,) = x(,) = x(6,) = x(7,) = (7) x (, 4) = (8) Accordig to our resuts, the chip area is icreased to 9 ( tota _ area = 9 ). Formuas (5)-(8) idicate that modues 8 ad 0 are assiged to ayer ; modues, 4, 5 ad 9 are assiged to ayer ; modues,, 6 ad 7 are assiged to ayer ; ad modue is assiged to ayer 4. Figure 9(b) reveas that the aaog modues, 4, 5 ad 9 are assiged to the aaog ayers i order to avoid potetia. Simiary, the umber of potetia s of ayers ad 4 are reduced to zero by ivovig SIP costraits. Summary, the chip area is icreased oy sighty (from 8 to 9) whie reducig the umber of potetia (from 4 to 0). This fidig suggests that the proposed SIP-aware partitioig approach ca simutaeousy miimize the chip area ad the potetia for the sigas betwee the digita ad aaog modues. IV. EXPERIMENTAL RESULTS I this work, ILP formuatios are geerated automaticay by C++ aguage, aog with experimets performed o a Ite.40GB machie with GB i order to optimize the chip area for a D stacked SIP architecture with four meta ayers. Effectiveess of the proposed ILP formuatios is demostrated by usig GRSC bechmarks that are utiized to perform experimets. Tabe ists the statistics of GRSC bechmarks, icudig the circuit ame, the umber of modues, the modue area, the chip area ad percetage of area reductio. Issue 6, Voume 5, 0 640

7 First, effectiveess of the ILP-based approach is examied. Compared with the theoreticay resuts, i.e. tota modue area based o the umber of ayer, the ILP-based approach without SIP miimizes the chip area. Tabes ad show that both the ILP-based without ad with SIP costrait reduce the chip area. With a acceptabe rutime, the partitioed resuts are obtaied efficiety. Additioay, the improvemet i the umber of the potetia is aso examied. I the formuatios with SIP cosideratio, the digita ad aaog modues are paced i the differet ayers. Hece, the sigas i aaog modues did ot be affected by itercoects i the digita modues. Accordig to Tabe, the umber of potetia is reduced to zero. V. CONCLUSIONS This work defies a ove probem of a D SIP-aware partitioig scheme ad soves it by usig the ILP-based approach. The objective is to miimize the chip area whie satisfyig the SIP costraits i order to reduce the potetia. A costraits are iear to formuate this SIP-aware partitioig probem. Experimeta resuts idicate that the proposed ILP-based SIP-aware method reduce the area compared to the tota modue area. Furthermore, the SIP-aware approach more sigificaty reduces the umber of potetia s tha with partitioig approach without the SIP costraits. ACKNOWLEDGEMENTS The authors woud ike to thak the fiacia support of the grat NSC99-5-E-6-07 from Natioa Sciece Couci. REFERENCES [] J. Miz, ad S.K. Lim, "Bock-eve D Goba Routig With a Appicatio to D Packagig," IEEE Trasactios o Computer-Aided Desig of Itegrated Circuits ad Systems, Vo. 5, No. 0, pp , 006. [] Jiwoo Pak; Myughyu Ha; Jaemi Kim; Doghee Kag; Ho Choi; Seyoug Kwo; Keusoo La; Jougho Kim, Desig of a -D SiP for T-DMB with Improvemet of Sesitivity ad Noise Isoatio, i Proc. of Eectroics Packagig Techoogy Coferece, pp.87-9, 008. [] S. K. Lim, Physica desig for D System-o-Package, IEEE Des. Test. Comput., vo., o. 6, pp. 5 59, 005. [4] Ao Sukstriewog, Sovig Mutiobjective Optimizatio uder Bouds by Geetic Agorithms, Iteratioa Joura of Computers, pp. 8-5, 0. [5] Luis F. C. Duarte, Jose D. Zambiaco, Dougas Airodi, Eata C. Ferreira ad Jose A. Siqueira Dias, Characterizatio ad Breakdow of the Eectricity Bi usig Custom Smart Meters: a Too for Eergy-Efficiecy Programs,, Iteratioa Joura of Circuits, Systems ad Siga Processig, pp.6-, 0. [6] R. Tummaa, SOP: What is It ad Why? A New Microsystem-Itegratio Techoogy Paradigm Moore s Law for System Itegratio of Miiaturized Coverget Systems of the Next Decade, IEEE Tras. Adv. Package., vo. 7, o., pp. 4 49, 004. [7] Katri Laas, Romi Maki, Astrid Rekker, The Ifuece of Noise Kurtosis o the Dyamics of a Harmoic Osciator with Fuctuatig frequecy, Iteratioa Joura of Mathematica Modes ad Method i Appied Scieces, pp. 7-6, 009. [8] J. Driovsky, Z. Kejik, V. Ruzek, ad J. Zachar, EMI Fiters Worst-case Idetificatio by Aterative Measuremet System, Iteratioa Joura of Circuits, Systems ad Siga Processig, pp.-9, 0. [9] T.Y. Ho, Y.W. Chag, S.J. Che, ad D.T. Lee, Crosstak- ad Performace-Drive Mutieve Fu-Chip Routig, IEEE Trasactio o Computer-Aided Desig of Itegrated Circuits ad Systems, Vo. 4, No. 6, pp , 005. [0] C.H. Wag, H.H. Huag, Y.C. Che, C.H. Lee ad T.M. Hsieh, A New Cogestio ad Crosstak Aware Router, Proc. IEEE of Iteratioa Symposium o Circuits ad Systems, pp , 005. [] C.C. Li, H.H. Huag, H.A. Chie, T.M. Hsieh, Obstace-Avoidig Eectromigratio Aware Wire Paig for Aaog Circuits Proc. of IEEE Iteratioa Symposium o Itegrated Circuits, pp , 009. [] D. Nguye et a. Miimizatio of Dyamic ad Static Power Through joit Assigmet of Threshod Votages ad Sizig Optimizatio, Proc. of ACM Iteratioa Symposium o Low Power Desig, pp. 58-6, 000. [] H.A. Chie, C.C. Li, H.H. Huag ad T.M. Hsieh, Optima Suppy Votage Assigmet uder Timig, Power ad Area Costraits, IEICE Trasactios o Fudametas of Eectroics, Commuicatios, ad Computer Scieces, Vo.E9, NO4, pp , 00. [4] D. Chai ad A. Kuehma, Circuit-based Preprocessig of ILP ad Its Appicatios i Leakage Miimizatio ad Power Estimatio, i Proc. of IEEE/ACM Iteratioa Coferece o Computer Desig, pp.-6, 004. [5] S.H. Huag, C.H. Cheg, Y.T. Nieh, ad W.C. Yu, Register Bidig for Cock Period Miimizatio, Proc. of ACM/IEEE Desig Automatio Coferece, pp , 006. [6] L. Cheg, L. Deg ad D. F. Wog, Foorpaig for D VLSI desig, Proc. of ACM/IEEE Asia-South Pacific Desig Automatio Coferece, pp.405-4, 005. [7] H. Yamazaki, K. Sakaushi, S. Nakatake ad Y. Kajitai, The D Packig by Meta Data Structure ad Packig Heuristics, IEICE Tras. o Fudametas, pp , 000. [8] W.L. Hug, G.M. Lik, X. Yua, N. Vijaykrisha, ad M.J. Irwi, Itercoect ad Therma-aware Foorpaig for d Microprocessors, Proc. of Iteratioa Symposium o Quaity Eectroic Desig, pp. 6, 006. [9] M.C. Tsai, T.C. Wag, ad T. T. Hwag, Through-Siico Via Paig i D Foorpaig, IEEE Trasactios o Very Large Scae Itegratio Systems, pp.-0, 00. [0] L. Xiao, S. Siha, J. Xu, F.Y Youg, Fixed-Outie Therma-aware D Foorpaig, Proc. of ACM/IEEE Asia ad South Pacific Desig Automatio Coferece, pp , 00. Hsi-Hsiug Huag received the M.S. ad Ph.D. degrees i the Dept. Iformatio Computer Egieerig ad Eectroic Egieerig from Chug Yua Christia Uiversity, Taoyua, Taiwa, i 000 ad 008, respectivey. From 000 to 00, He is a hardware egieerig to desig the Etheret product at Accto Corporatio, Hsi-Chu, Taiwa. From 00 to 00, He focus o the chip desig for the 0/00/000 Mbps Etheret MAC at TM-Techoogy Corporatio, Hsi-Chu, Taiwa. His is iterested i the desig ad aaysis of the agorithms. He is workig toward the agorithm reated fieds, such the appicatio of ie-foowig maze robot ad CAD agorithms for the VLSI, the foorpaer ad performace-drive routig with the obstaces. Tsai-Mig Hsieh received his B.S. degree i Eectrica Egieerig form Chug Yua Uiversity, Chug-Li, Taiwa, i 970 ad his M.S. ad Ph.D degrees i Eectrica Egieerig from the Istitute of Eectroics, Natioa Chiao Tug Uiversity, Hsichu, Taiwa, i 974 ad 98, respectivey. He is currety a professor of the Departmet of Iformatio ad Computer Egieerig at Chug Yua Uiversity. His curret research iterests are i computer-aided desig o itegrated circuits, desig ad aaysis of agorithms, ad combiatioa mathematics. Issue 6, Voume 5, 0 64

8 stabe. Bechmark statistics ad resuts without SIP costraits. Name A B C Imp (%) A= umber of modues for each bechmark ; B= tota modue area ; ad C= chip area without SIP ; Imp(%)= the reductio of chip area without SIP (=00 (B-C)/B) ; Tabe. Bechmark statistics ad resuts with SIP costraits. Name A B D Imp (%) B= tota modue area ; D= chip area with SIP ; Imp(%)= the reductio of chip area with SIP (=00 (B-D)/B) ; Tabe. Compariso of the umber of potetia without ad with SIP costraits. Name A E F Imp E= The umber of potetia without SIP ; F= The umber of potetia with SIP ; Imp= E-F; Issue 6, Voume 5, 0 64

Modified Line Search Method for Global Optimization

Modified Line Search Method for Global Optimization Modified Lie Search Method for Global Optimizatio Cria Grosa ad Ajith Abraham Ceter of Excellece for Quatifiable Quality of Service Norwegia Uiversity of Sciece ad Techology Trodheim, Norway {cria, ajith}@q2s.tu.o

More information

Taking DCOP to the Real World: Efficient Complete Solutions for Distributed Multi-Event Scheduling

Taking DCOP to the Real World: Efficient Complete Solutions for Distributed Multi-Event Scheduling Taig DCOP to the Real World: Efficiet Complete Solutios for Distributed Multi-Evet Schedulig Rajiv T. Maheswara, Milid Tambe, Emma Bowrig, Joatha P. Pearce, ad Pradeep araatham Uiversity of Souther Califoria

More information

CHAPTER FIVE Network Hydraulics

CHAPTER FIVE Network Hydraulics . ETWOR YDRAULICSE CATER IVE Network ydrauics The fudameta reatioships of coservatio of mass ad eergy mathematicay describe the fow ad pressure distributio withi a pipe etwork uder steady state coditios.

More information

Supervised Rank Aggregation

Supervised Rank Aggregation Sessio: Search Quaity ad Precisio Supervised Rak Aggregatio Yu-Tig Liu,*, Tie-Ya Liu, Tao Qi,3*, Zhi-Mig Ma 4, ad Hag Li Microsoft Research Asia 4F, Sigma Ceter, No. 49, Zhichu Road, Haidia District, Beijig,

More information

A Secure Implementation of Java Inner Classes

A Secure Implementation of Java Inner Classes A Secure Implemetatio of Java Ier Classes By Aasua Bhowmik ad William Pugh Departmet of Computer Sciece Uiversity of Marylad More ifo at: http://www.cs.umd.edu/~pugh/java Motivatio ad Overview Preset implemetatio

More information

MTO-MTS Production Systems in Supply Chains

MTO-MTS Production Systems in Supply Chains NSF GRANT #0092854 NSF PROGRAM NAME: MES/OR MTO-MTS Productio Systems i Supply Chais Philip M. Kamisky Uiversity of Califoria, Berkeley Our Kaya Uiversity of Califoria, Berkeley Abstract: Icreasig cost

More information

Automatic Tuning for FOREX Trading System Using Fuzzy Time Series

Automatic Tuning for FOREX Trading System Using Fuzzy Time Series utomatic Tuig for FOREX Tradig System Usig Fuzzy Time Series Kraimo Maeesilp ad Pitihate Soorasa bstract Efficiecy of the automatic currecy tradig system is time depedet due to usig fixed parameters which

More information

Systems Design Project: Indoor Location of Wireless Devices

Systems Design Project: Indoor Location of Wireless Devices Systems Desig Project: Idoor Locatio of Wireless Devices Prepared By: Bria Murphy Seior Systems Sciece ad Egieerig Washigto Uiversity i St. Louis Phoe: (805) 698-5295 Email: [email protected] Supervised

More information

Evaluation of Different Fitness Functions for the Evolutionary Testing of an Autonomous Parking System

Evaluation of Different Fitness Functions for the Evolutionary Testing of an Autonomous Parking System Evaluatio of Differet Fitess Fuctios for the Evolutioary Testig of a Autoomous Parkig System Joachim Wegeer 1, Oliver Bühler 2 1 DaimlerChrysler AG, Research ad Techology, Alt-Moabit 96 a, D-1559 Berli,

More information

Space-Efficient Estimation of Statistics over Sub-Sampled Streams

Space-Efficient Estimation of Statistics over Sub-Sampled Streams Noame mauscript No. wi be iserted by the editor Space-Efficiet Estimatio of Statistics over Sub-Samped Streams Adrew McGregor A. Pava Srikata Tirthapura David Woodruff the date of receipt ad acceptace

More information

Reliability Analysis in HPC clusters

Reliability Analysis in HPC clusters Reliability Aalysis i HPC clusters Narasimha Raju, Gottumukkala, Yuda Liu, Chokchai Box Leagsuksu 1, Raja Nassar, Stephe Scott 2 College of Egieerig & Sciece, Louisiaa ech Uiversity Oak Ridge Natioal Lab

More information

Recovery time guaranteed heuristic routing for improving computation complexity in survivable WDM networks

Recovery time guaranteed heuristic routing for improving computation complexity in survivable WDM networks Computer Commuicatios 30 (2007) 1331 1336 wwwelseviercom/locate/comcom Recovery time guarateed heuristic routig for improvig computatio complexity i survivable WDM etworks Lei Guo * College of Iformatio

More information

Data Analysis and Statistical Behaviors of Stock Market Fluctuations

Data Analysis and Statistical Behaviors of Stock Market Fluctuations 44 JOURNAL OF COMPUTERS, VOL. 3, NO. 0, OCTOBER 2008 Data Aalysis ad Statistical Behaviors of Stock Market Fluctuatios Ju Wag Departmet of Mathematics, Beijig Jiaotog Uiversity, Beijig 00044, Chia Email:

More information

On the Capacity of Hybrid Wireless Networks

On the Capacity of Hybrid Wireless Networks O the Capacity of Hybrid ireless Networks Beyua Liu,ZheLiu +,DoTowsley Departmet of Computer Sciece Uiversity of Massachusetts Amherst, MA 0002 + IBM T.J. atso Research Ceter P.O. Box 704 Yorktow Heights,

More information

Department of Computer Science, University of Otago

Department of Computer Science, University of Otago Departmet of Computer Sciece, Uiversity of Otago Techical Report OUCS-2006-09 Permutatios Cotaiig May Patters Authors: M.H. Albert Departmet of Computer Sciece, Uiversity of Otago Micah Colema, Rya Fly

More information

Section 11.3: The Integral Test

Section 11.3: The Integral Test Sectio.3: The Itegral Test Most of the series we have looked at have either diverged or have coverged ad we have bee able to fid what they coverge to. I geeral however, the problem is much more difficult

More information

Performance Modelling of W-CDMA Networks Supporting Elastic and Adaptive Traffic

Performance Modelling of W-CDMA Networks Supporting Elastic and Adaptive Traffic Performace Modeig of W-CDMA Networks Supportig Eastic ad Adaptive Traffic Georgios A. Kaos, Vassiios G. Vassiakis, Ioais D. Moschoios ad Michae D. Logothetis* WCL, Dept. of Eectrica & Computer Egieerig,

More information

Chatpun Khamyat Department of Industrial Engineering, Kasetsart University, Bangkok, Thailand [email protected]

Chatpun Khamyat Department of Industrial Engineering, Kasetsart University, Bangkok, Thailand ocpky@hotmail.com SOLVING THE OIL DELIVERY TRUCKS ROUTING PROBLEM WITH MODIFY MULTI-TRAVELING SALESMAN PROBLEM APPROACH CASE STUDY: THE SME'S OIL LOGISTIC COMPANY IN BANGKOK THAILAND Chatpu Khamyat Departmet of Idustrial

More information

The Benefit of Coordinating Congestion Management in Germany

The Benefit of Coordinating Congestion Management in Germany 1298 Discussio Papers Deutsches Istitut für Wirtschaftsforschug 2013 The Beefit of Coordiatig Cogestio Maagemet i Germay Friedrich Kuz ad Aexader Zerrah Opiios expressed i this paper are those of the author(s)

More information

The Sample Complexity of Exploration in the Multi-Armed Bandit Problem

The Sample Complexity of Exploration in the Multi-Armed Bandit Problem Joura of Machie Learig Research 5 004) 63-648 Submitted 1/04; Pubished 6/04 The Sampe Compexity of Exporatio i the Muti-Armed Badit Probem Shie Maor Joh N. Tsitsikis Laboratory for Iformatio ad Decisio

More information

Dynamic House Allocation

Dynamic House Allocation Dyamic House Allocatio Sujit Gujar 1 ad James Zou 2 ad David C. Parkes 3 Abstract. We study a dyamic variat o the house allocatio problem. Each aget ows a distict object (a house) ad is able to trade its

More information

Joint Design on Load Balancing and Survivability for Resilient IP Networks

Joint Design on Load Balancing and Survivability for Resilient IP Networks Joit Desig o Load Baacig ad Survivabiity for Resiiet IP Networks Po-Kai Tseg ad Wei-Ho Chug * Abstract Natura or artificia disasters ofte etwork service iterrutios as we as acket ad reveue osses. To aeviate

More information

A short note on quantile and expectile estimation in unequal probability samples

A short note on quantile and expectile estimation in unequal probability samples Cataogue o. 2-00-X ISS 492-092 Survey Methodoogy A short ote o quatie ad expectie estimatio i uequa probabiity sampes by Lida Schuze Watrup ad Göra Kauerma eease date: Jue 22, 206 How to obtai more iformatio

More information

Research Article Sign Data Derivative Recovery

Research Article Sign Data Derivative Recovery Iteratioal Scholarly Research Network ISRN Applied Mathematics Volume 0, Article ID 63070, 7 pages doi:0.540/0/63070 Research Article Sig Data Derivative Recovery L. M. Housto, G. A. Glass, ad A. D. Dymikov

More information

Study on the application of the software phase-locked loop in tracking and filtering of pulse signal

Study on the application of the software phase-locked loop in tracking and filtering of pulse signal Advaced Sciece ad Techology Letters, pp.31-35 http://dx.doi.org/10.14257/astl.2014.78.06 Study o the applicatio of the software phase-locked loop i trackig ad filterig of pulse sigal Sog Wei Xia 1 (College

More information

Designing Incentives for Online Question and Answer Forums

Designing Incentives for Online Question and Answer Forums Desigig Icetives for Olie Questio ad Aswer Forums Shaili Jai School of Egieerig ad Applied Scieces Harvard Uiversity Cambridge, MA 0238 USA [email protected] Yilig Che School of Egieerig ad Applied

More information

1. Introduction. Scheduling Theory

1. Introduction. Scheduling Theory . Itroductio. Itroductio As a idepedet brach of Operatioal Research, Schedulig Theory appeared i the begiig of the 50s. I additio to computer systems ad maufacturig, schedulig theory ca be applied to may

More information

IEN Product Design Reference. Version 1.6

IEN Product Design Reference. Version 1.6 IEN Product Desig Referece Versio 1.6 Hypercom Corporatio 2851 West Kathee Road Phoeix, Arizoa 85023 USA Corporate Teephoe: (602) 504-5000 Corporate Fax: (602) 866-5380 TRADEMARKS: Hypercom has attempted

More information

The analysis of the Cournot oligopoly model considering the subjective motive in the strategy selection

The analysis of the Cournot oligopoly model considering the subjective motive in the strategy selection The aalysis of the Courot oligopoly model cosiderig the subjective motive i the strategy selectio Shigehito Furuyama Teruhisa Nakai Departmet of Systems Maagemet Egieerig Faculty of Egieerig Kasai Uiversity

More information

CS100: Introduction to Computer Science

CS100: Introduction to Computer Science Review: History of Computers CS100: Itroductio to Computer Sciece Maiframes Miicomputers Lecture 2: Data Storage -- Bits, their storage ad mai memory Persoal Computers & Workstatios Review: The Role of

More information

Your organization has a Class B IP address of 166.144.0.0 Before you implement subnetting, the Network ID and Host ID are divided as follows:

Your organization has a Class B IP address of 166.144.0.0 Before you implement subnetting, the Network ID and Host ID are divided as follows: Subettig Subettig is used to subdivide a sigle class of etwork i to multiple smaller etworks. Example: Your orgaizatio has a Class B IP address of 166.144.0.0 Before you implemet subettig, the Network

More information

1 Computing the Standard Deviation of Sample Means

1 Computing the Standard Deviation of Sample Means Computig the Stadard Deviatio of Sample Meas Quality cotrol charts are based o sample meas ot o idividual values withi a sample. A sample is a group of items, which are cosidered all together for our aalysis.

More information

A Churn-prevented Bandwidth Allocation Algorithm for Dynamic Demands In IaaS Cloud

A Churn-prevented Bandwidth Allocation Algorithm for Dynamic Demands In IaaS Cloud A Chur-preveted Badwidth Allocatio Algorithm for Dyamic Demads I IaaS Cloud Jilei Yag, Hui Xie ad Jiayu Li Departmet of Computer Sciece ad Techology, Tsighua Uiversity, Beijig, P.R. Chia Tsighua Natioal

More information

Estimating Probability Distributions by Observing Betting Practices

Estimating Probability Distributions by Observing Betting Practices 5th Iteratioal Symposium o Imprecise Probability: Theories ad Applicatios, Prague, Czech Republic, 007 Estimatig Probability Distributios by Observig Bettig Practices Dr C Lych Natioal Uiversity of Irelad,

More information

INVESTMENT PERFORMANCE COUNCIL (IPC)

INVESTMENT PERFORMANCE COUNCIL (IPC) INVESTMENT PEFOMANCE COUNCIL (IPC) INVITATION TO COMMENT: Global Ivestmet Performace Stadards (GIPS ) Guidace Statemet o Calculatio Methodology The Associatio for Ivestmet Maagemet ad esearch (AIM) seeks

More information

A Faster Clause-Shortening Algorithm for SAT with No Restriction on Clause Length

A Faster Clause-Shortening Algorithm for SAT with No Restriction on Clause Length Joural o Satisfiability, Boolea Modelig ad Computatio 1 2005) 49-60 A Faster Clause-Shorteig Algorithm for SAT with No Restrictio o Clause Legth Evgey Datsi Alexader Wolpert Departmet of Computer Sciece

More information

Simultaneous Routing and Power Allocation in CDMA Wireless Data Networks

Simultaneous Routing and Power Allocation in CDMA Wireless Data Networks Simutaneous Routing and Power Aocation in CDMA Wireess Data Networks Mikae Johansson *,LinXiao and Stephen Boyd * Department of Signas, Sensors and Systems Roya Institute of Technoogy, SE 00 Stockhom,

More information

Floating Codes for Joint Information Storage in Write Asymmetric Memories

Floating Codes for Joint Information Storage in Write Asymmetric Memories Floatig Codes for Joit Iformatio Storage i Write Asymmetric Memories Axiao (Adrew Jiag Computer Sciece Departmet Texas A&M Uiversity College Statio, TX 77843-311 [email protected] Vaske Bohossia Electrical

More information

Major Coefficients Recovery: a Compressed Data Gathering Scheme for Wireless Sensor Network

Major Coefficients Recovery: a Compressed Data Gathering Scheme for Wireless Sensor Network This full text paper was peer reviewed at the directio of IEEE Commuicatios Society subject matter experts for publicatio i the IEEE Globecom proceedigs. Major Coefficiets Recovery: a Compressed Data Gatherig

More information

Lesson 15 ANOVA (analysis of variance)

Lesson 15 ANOVA (analysis of variance) Outlie Variability -betwee group variability -withi group variability -total variability -F-ratio Computatio -sums of squares (betwee/withi/total -degrees of freedom (betwee/withi/total -mea square (betwee/withi

More information

The Power of Free Branching in a General Model of Backtracking and Dynamic Programming Algorithms

The Power of Free Branching in a General Model of Backtracking and Dynamic Programming Algorithms The Power of Free Brachig i a Geeral Model of Backtrackig ad Dyamic Programmig Algorithms SASHKA DAVIS IDA/Ceter for Computig Scieces Bowie, MD [email protected] RUSSELL IMPAGLIAZZO Dept. of Computer

More information

Output Analysis (2, Chapters 10 &11 Law)

Output Analysis (2, Chapters 10 &11 Law) B. Maddah ENMG 6 Simulatio 05/0/07 Output Aalysis (, Chapters 10 &11 Law) Comparig alterative system cofiguratio Sice the output of a simulatio is radom, the comparig differet systems via simulatio should

More information

Ekkehart Schlicht: Economic Surplus and Derived Demand

Ekkehart Schlicht: Economic Surplus and Derived Demand Ekkehart Schlicht: Ecoomic Surplus ad Derived Demad Muich Discussio Paper No. 2006-17 Departmet of Ecoomics Uiversity of Muich Volkswirtschaftliche Fakultät Ludwig-Maximilias-Uiversität Müche Olie at http://epub.ub.ui-mueche.de/940/

More information

A model of Virtual Resource Scheduling in Cloud Computing and Its

A model of Virtual Resource Scheduling in Cloud Computing and Its A model of Virtual Resource Schedulig i Cloud Computig ad Its Solutio usig EDAs 1 Jiafeg Zhao, 2 Wehua Zeg, 3 Miu Liu, 4 Guagmig Li 1, First Author, 3 Cogitive Sciece Departmet, Xiame Uiversity, Xiame,

More information

CHAPTER 3 DIGITAL CODING OF SIGNALS

CHAPTER 3 DIGITAL CODING OF SIGNALS CHAPTER 3 DIGITAL CODING OF SIGNALS Computers are ofte used to automate the recordig of measuremets. The trasducers ad sigal coditioig circuits produce a voltage sigal that is proportioal to a quatity

More information

Decomposition of Gini and the generalized entropy inequality measures. Abstract

Decomposition of Gini and the generalized entropy inequality measures. Abstract Decompositio of Gii ad the geeralized etropy iequality measures Stéphae Mussard LAMETA Uiversity of Motpellier I Fraçoise Seyte LAMETA Uiversity of Motpellier I Michel Terraza LAMETA Uiversity of Motpellier

More information

THE CARDINALITY CONSTRAINED MULTIPLE KNAPSACK PROBLEM

THE CARDINALITY CONSTRAINED MULTIPLE KNAPSACK PROBLEM THE CARDINALITY CONSTRAINED MULTIPLE KNAPSACK PROBLEM A THESIS SUBMITTED TO THE GRADUATE SCHOOL OF NATURAL AND APPLIED SCIENCES OF MIDDLE EAST TECHNICAL UNIVERSITY BY MURAT ASLAN IN PARTIAL FULFILLMENT

More information

A Fuzzy Model of Software Project Effort Estimation

A Fuzzy Model of Software Project Effort Estimation TJFS: Turkish Joural of Fuzzy Systems (eissn: 309 90) A Official Joural of Turkish Fuzzy Systems Associatio Vol.4, No.2, pp. 68-76, 203 A Fuzzy Model of Software Project Effort Estimatio Oumout Chouseioglou

More information

Cantilever Beam Experiment

Cantilever Beam Experiment Mechaical Egieerig Departmet Uiversity of Massachusetts Lowell Catilever Beam Experimet Backgroud A disk drive maufacturer is redesigig several disk drive armature mechaisms. This is the result of evaluatio

More information

Incremental calculation of weighted mean and variance

Incremental calculation of weighted mean and variance Icremetal calculatio of weighted mea ad variace Toy Fich [email protected] [email protected] Uiversity of Cambridge Computig Service February 009 Abstract I these otes I eplai how to derive formulae for umerically

More information

Chapter 7 Methods of Finding Estimators

Chapter 7 Methods of Finding Estimators Chapter 7 for BST 695: Special Topics i Statistical Theory. Kui Zhag, 011 Chapter 7 Methods of Fidig Estimators Sectio 7.1 Itroductio Defiitio 7.1.1 A poit estimator is ay fuctio W( X) W( X1, X,, X ) of

More information

Infinite Sequences and Series

Infinite Sequences and Series CHAPTER 4 Ifiite Sequeces ad Series 4.1. Sequeces A sequece is a ifiite ordered list of umbers, for example the sequece of odd positive itegers: 1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29...

More information

Asymptotic Growth of Functions

Asymptotic Growth of Functions CMPS Itroductio to Aalysis of Algorithms Fall 3 Asymptotic Growth of Fuctios We itroduce several types of asymptotic otatio which are used to compare the performace ad efficiecy of algorithms As we ll

More information

An Efficient Polynomial Approximation of the Normal Distribution Function & Its Inverse Function

An Efficient Polynomial Approximation of the Normal Distribution Function & Its Inverse Function A Efficiet Polyomial Approximatio of the Normal Distributio Fuctio & Its Iverse Fuctio Wisto A. Richards, 1 Robi Atoie, * 1 Asho Sahai, ad 3 M. Raghuadh Acharya 1 Departmet of Mathematics & Computer Sciece;

More information

COMPARISON OF THE EFFICIENCY OF S-CONTROL CHART AND EWMA-S 2 CONTROL CHART FOR THE CHANGES IN A PROCESS

COMPARISON OF THE EFFICIENCY OF S-CONTROL CHART AND EWMA-S 2 CONTROL CHART FOR THE CHANGES IN A PROCESS COMPARISON OF THE EFFICIENCY OF S-CONTROL CHART AND EWMA-S CONTROL CHART FOR THE CHANGES IN A PROCESS Supraee Lisawadi Departmet of Mathematics ad Statistics, Faculty of Sciece ad Techoology, Thammasat

More information

Ranking Irregularities When Evaluating Alternatives by Using Some ELECTRE Methods

Ranking Irregularities When Evaluating Alternatives by Using Some ELECTRE Methods Please use the followig referece regardig this paper: Wag, X., ad E. Triataphyllou, Rakig Irregularities Whe Evaluatig Alteratives by Usig Some ELECTRE Methods, Omega, Vol. 36, No. 1, pp. 45-63, February

More information

Performance and Cost-effectiveness Analyses for Cloud Services Based on Rejected and Impatient Users

Performance and Cost-effectiveness Analyses for Cloud Services Based on Rejected and Impatient Users IEEE TRANSACTIONS ON SERVICES COMPUTING, TSC-2014-06-0107.R1 Performace ad Cost-effectiveess Aalyses for Cloud Services Based o Rejected ad Impatiet Users Yi-Ju Chiag 1, Studet Member, IEEE, Ye-Chieh Ouyag

More information

CHAPTER 3 THE TIME VALUE OF MONEY

CHAPTER 3 THE TIME VALUE OF MONEY CHAPTER 3 THE TIME VALUE OF MONEY OVERVIEW A dollar i the had today is worth more tha a dollar to be received i the future because, if you had it ow, you could ivest that dollar ad ear iterest. Of all

More information

INTER-CELL LOAD BALANCING TECHNIQUE FOR MULTI-CLASS TRAFFIC IN MIMO-LTE-A NETWORKS

INTER-CELL LOAD BALANCING TECHNIQUE FOR MULTI-CLASS TRAFFIC IN MIMO-LTE-A NETWORKS NTER-CELL LOAD BALANCNG TECHNQUE FOR MULT-CLASS TRAFFC N MMO-LTE-A NETWORKS 1 T.PADMAPRYA, 2 V. SAMNADAN 1 Research Scholar, Podicherry Egieerig College 2 Professor, Departmet of ECE, Podicherry Egieerig

More information

Domain 1 Components of the Cisco Unified Communications Architecture

Domain 1 Components of the Cisco Unified Communications Architecture Maual CCNA Domai 1 Compoets of the Cisco Uified Commuicatios Architecture Uified Commuicatios (UC) Eviromet Cisco has itroduced what they call the Uified Commuicatios Eviromet which is used to separate

More information

Optimal Adaptive Bandwidth Monitoring for QoS Based Retrieval

Optimal Adaptive Bandwidth Monitoring for QoS Based Retrieval 1 Optimal Adaptive Badwidth Moitorig for QoS Based Retrieval Yizhe Yu, Iree Cheg ad Aup Basu (Seior Member) Departmet of Computig Sciece Uiversity of Alberta Edmoto, AB, T6G E8, CAADA {yizhe, aup, li}@cs.ualberta.ca

More information

SPC on Ungrouped Data: Power Law Process Model

SPC on Ungrouped Data: Power Law Process Model Iteratioal Joural of Software Egieerig. ISSN 0974-3162 Volume 5, 1 (2014), pp. 7-16 Iteratioal Research Publicatio House http://www.irphouse.com SPC o Ugrouped Data: Power Law Process Model DR. R. Satya

More information

Capacity of Wireless Networks with Heterogeneous Traffic

Capacity of Wireless Networks with Heterogeneous Traffic Capacity of Wireless Networks with Heterogeeous Traffic Migyue Ji, Zheg Wag, Hamid R. Sadjadpour, J.J. Garcia-Lua-Aceves Departmet of Electrical Egieerig ad Computer Egieerig Uiversity of Califoria, Sata

More information

Statistical inference: example 1. Inferential Statistics

Statistical inference: example 1. Inferential Statistics Statistical iferece: example 1 Iferetial Statistics POPULATION SAMPLE A clothig store chai regularly buys from a supplier large quatities of a certai piece of clothig. Each item ca be classified either

More information

TIGHT BOUNDS ON EXPECTED ORDER STATISTICS

TIGHT BOUNDS ON EXPECTED ORDER STATISTICS Probability i the Egieerig ad Iformatioal Scieces, 20, 2006, 667 686+ Prited i the U+S+A+ TIGHT BOUNDS ON EXPECTED ORDER STATISTICS DIMITRIS BERTSIMAS Sloa School of Maagemet ad Operatios Research Ceter

More information

Effective Techniques for Message Reduction and Load Balancing in Distributed Graph Computation

Effective Techniques for Message Reduction and Load Balancing in Distributed Graph Computation Effective Techiques for Message Reductio ad Load Balacig i Distributed Graph Computatio ABSTRACT Da Ya, James Cheg, Yi Lu Dept. of Computer Sciece ad Egieerig The Chiese Uiversity of Hog Kog {yada, jcheg,

More information

Greening Multi-Tenant Data Center Demand Response

Greening Multi-Tenant Data Center Demand Response (215 1 3 Greeig Multi-Teat Data Ceter Demad Respose Niagju Che a, Xiaoqi Re a, Shaolei Re b, Adam Wierma a a Computig ad Mathematical Scieces Departmet, Califoria Istitute of Techology b Uiversity of Califoria,

More information

CONTROL CHART BASED ON A MULTIPLICATIVE-BINOMIAL DISTRIBUTION

CONTROL CHART BASED ON A MULTIPLICATIVE-BINOMIAL DISTRIBUTION www.arpapress.com/volumes/vol8issue2/ijrras_8_2_04.pdf CONTROL CHART BASED ON A MULTIPLICATIVE-BINOMIAL DISTRIBUTION Elsayed A. E. Habib Departmet of Statistics ad Mathematics, Faculty of Commerce, Beha

More information

STUDENTS PARTICIPATION IN ONLINE LEARNING IN BUSINESS COURSES AT UNIVERSITAS TERBUKA, INDONESIA. Maya Maria, Universitas Terbuka, Indonesia

STUDENTS PARTICIPATION IN ONLINE LEARNING IN BUSINESS COURSES AT UNIVERSITAS TERBUKA, INDONESIA. Maya Maria, Universitas Terbuka, Indonesia STUDENTS PARTICIPATION IN ONLINE LEARNING IN BUSINESS COURSES AT UNIVERSITAS TERBUKA, INDONESIA Maya Maria, Uiversitas Terbuka, Idoesia Co-author: Amiuddi Zuhairi, Uiversitas Terbuka, Idoesia Kuria Edah

More information

FEATURE BASED RECOGNITION OF TRAFFIC VIDEO STREAMS FOR ONLINE ROUTE TRACING

FEATURE BASED RECOGNITION OF TRAFFIC VIDEO STREAMS FOR ONLINE ROUTE TRACING FEATURE BASED RECOGNITION OF TRAFFIC VIDEO STREAMS FOR ONLINE ROUTE TRACING Christoph Busch, Ralf Dörer, Christia Freytag, Heike Ziegler Frauhofer Istitute for Computer Graphics, Computer Graphics Ceter

More information

Locating Performance Monitoring Mobile Agents in Scalable Active Networks

Locating Performance Monitoring Mobile Agents in Scalable Active Networks Locatig Performace Moitorig Mobile Agets i Scalable Active Networks Amir Hossei Hadad, Mehdi Dehgha, ad Hossei Pedram Amirkabir Uiversity, Computer Sciece Faculty, Tehra, Ira [email protected], {dehgha,

More information

Component Reliability in Fault Diagnosis Decision-Making based on Dynamic Bayesian Networks

Component Reliability in Fault Diagnosis Decision-Making based on Dynamic Bayesian Networks Compoet Reliability i Fault Diagosis Decisio-Makig based o Dyamic Bayesia Networks Philippe Weber, Didier Theilliol, Christophe Aubru To cite this versio: Philippe Weber, Didier Theilliol, Christophe Aubru.

More information

A Guide to Better Postal Services Procurement. A GUIDE TO better POSTAL SERVICES PROCUREMENT

A Guide to Better Postal Services Procurement. A GUIDE TO better POSTAL SERVICES PROCUREMENT A Guide to Better Postal Services Procuremet A GUIDE TO better POSTAL SERVICES PROCUREMENT itroductio The NAO has published a report aimed at improvig the procuremet of postal services i the public sector

More information

How to read A Mutual Fund shareholder report

How to read A Mutual Fund shareholder report Ivestor BulletI How to read A Mutual Fud shareholder report The SEC s Office of Ivestor Educatio ad Advocacy is issuig this Ivestor Bulleti to educate idividual ivestors about mutual fud shareholder reports.

More information

Basic Measurement Issues. Sampling Theory and Analog-to-Digital Conversion

Basic Measurement Issues. Sampling Theory and Analog-to-Digital Conversion Theory ad Aalog-to-Digital Coversio Itroductio/Defiitios Aalog-to-digital coversio Rate Frequecy Aalysis Basic Measuremet Issues Reliability the extet to which a measuremet procedure yields the same results

More information

Effective Techniques for Message Reduction and Load Balancing in Distributed Graph Computation

Effective Techniques for Message Reduction and Load Balancing in Distributed Graph Computation Effective Techiques for Message Reductio ad Load Balacig i Distributed Graph Computatio ABSTRACT Da Ya, James Cheg, Yi Lu Dept. of Computer Sciece ad Egieerig The Chiese Uiversity of Hog Kog {yada, jcheg,

More information

Overview on S-Box Design Principles

Overview on S-Box Design Principles Overview o S-Box Desig Priciples Debdeep Mukhopadhyay Assistat Professor Departmet of Computer Sciece ad Egieerig Idia Istitute of Techology Kharagpur INDIA -721302 What is a S-Box? S-Boxes are Boolea

More information

Domain 1: Designing a SQL Server Instance and a Database Solution

Domain 1: Designing a SQL Server Instance and a Database Solution Maual SQL Server 2008 Desig, Optimize ad Maitai (70-450) 1-800-418-6789 Domai 1: Desigig a SQL Server Istace ad a Database Solutio Desigig for CPU, Memory ad Storage Capacity Requiremets Whe desigig a

More information

Engineering Data Management

Engineering Data Management BaaERP 5.0c Maufacturig Egieerig Data Maagemet Module Procedure UP128A US Documetiformatio Documet Documet code : UP128A US Documet group : User Documetatio Documet title : Egieerig Data Maagemet Applicatio/Package

More information

Analyzing Longitudinal Data from Complex Surveys Using SUDAAN

Analyzing Longitudinal Data from Complex Surveys Using SUDAAN Aalyzig Logitudial Data from Complex Surveys Usig SUDAAN Darryl Creel Statistics ad Epidemiology, RTI Iteratioal, 312 Trotter Farm Drive, Rockville, MD, 20850 Abstract SUDAAN: Software for the Statistical

More information

Chair for Network Architectures and Services Institute of Informatics TU München Prof. Carle. Network Security. Chapter 2 Basics

Chair for Network Architectures and Services Institute of Informatics TU München Prof. Carle. Network Security. Chapter 2 Basics Chair for Network Architectures ad Services Istitute of Iformatics TU Müche Prof. Carle Network Security Chapter 2 Basics 2.4 Radom Number Geeratio for Cryptographic Protocols Motivatio It is crucial to

More information

Universal coding for classes of sources

Universal coding for classes of sources Coexios module: m46228 Uiversal codig for classes of sources Dever Greee This work is produced by The Coexios Project ad licesed uder the Creative Commos Attributio Licese We have discussed several parametric

More information

The Forgotten Middle. research readiness results. Executive Summary

The Forgotten Middle. research readiness results. Executive Summary The Forgotte Middle Esurig that All Studets Are o Target for College ad Career Readiess before High School Executive Summary Today, college readiess also meas career readiess. While ot every high school

More information

Lecture 4: Cauchy sequences, Bolzano-Weierstrass, and the Squeeze theorem

Lecture 4: Cauchy sequences, Bolzano-Weierstrass, and the Squeeze theorem Lecture 4: Cauchy sequeces, Bolzao-Weierstrass, ad the Squeeze theorem The purpose of this lecture is more modest tha the previous oes. It is to state certai coditios uder which we are guarateed that limits

More information