Performance Evaluation of Infrastructure as Service Clouds with SLA Constraints


 Alberta Haynes
 2 years ago
 Views:
Transcription
1 Performance Evaluaton of Infrastructure as Servce Clouds wth SLA Constrants Anuar Lezama Barquet, Andre Tchernykh, and Ramn Yahyapour 2 Computer Scence Department, CICESE Research Center, Ensenada, BC, Mexco 2 GWDG Unversty of Göttngen, 3777 Göttngen, Germany {alezama, Abstract. In ths paper, we present an expermental study of ob schedulng algorthms n nfrastructure as a servce type n clouds. We analyze dfferent system servce levels whch are dstngushed by the amount of computng power a customer s guaranteed to receve wthn a tme frame and a prce for a processng tme unt. We analyze dfferent scenaros for ths model. These scenaros combne a sngle servce level wth sngle and parallel machnes. We apply our algorthms n the context of executng real workload traces avalable to HPC communty. In order to provde performance comparson, we make a ont analyss of several metrcs. A case study s gven. Keywords. Cloud computng, nfrastructure as a servce, qualty of servce, schedulng. Evaluacón del desempeño de servcos de nfraestructura en nubes con restrccones de acuerdos de nvel de servco (SLA) Resumen. En el presente artículo, mostramos un estudo expermental sobre algortmos de calendarzacón en servcos de nfraestructura en nubes. Analzamos dferentes nveles de servcos que se dstnguen por la cantdad de poder computaconal que al usuaro se le garantza recbr dentro de un perodo de tempo y el preco por undad de procesamento. Analzamos dferentes escenaros para este modelo. Estos escenaros combnan un únco nvel de servco en una sola máquna y en máqunas paralelas. Utlzamos nuestros algortmos para la eecucón de muestras de cargas de trabao reales dsponbles para la comundad de HPC. Con el fn de proveer una comparacón en el desempeño, realzamos un análss conunto de varas métrcas. Presentamos un caso de estudo. Palabras clave. Computacón en nube, servco de nfraestructura en nube, caldad de servco, calendarzacón. Introducton Infrastructure as a servce type n clouds allows users to take advantage of computatonal power ondemand. The focus of ths knd of clouds manages vrtual machnes (VMs) created by users to execute ther obs on the cloud resources. However, n ths new paradgm, there are ssues that prevent ts wdespread adopton. The man concern s ts necessty to provde Qualty of Servce (QoS) guarantees []. The use of Servce Level Agreements (SLAs) s a fundamentally new approach for ob schedulng. In ths approach, schedulers are based on satsfyng QoS constrants. The man dea s to provde dfferent levels of servce, each addressng a dfferent set of customers for the same servces, n the same SLA, and establsh blateral agreements between a servce provder and a servce consumer to guarantee ob delvery tme dependng on the selected level of servce. Bascally, SLAs contan nformaton such as the latest fnsh tme of the ob, reserved tme for ob executon, number of CPUs requred, and prce per tme unt. The shftng emphass of the Grd and Clouds towards a servceorented paradgm led to the adopton of SLA as a very mportant concept, but at the same tme led to the problem of fndng the strngent SLAs.
2 42 Anuar Lezama Barquet, Andre Tchernykh, and Ramn Yahyapour There has been sgnfcant amount of research on varous topcs related to SLAs: admsson control technques [2]; ncorporaton of the SLA nto the Grd/Cloud archtecture [3]; specfcatons of SLAs [4, 5]; usage of SLAs for resource management; SLAbased schedulng [6], SLA profts [7]; automatc negotaton protocols [8]; economc aspects assocated wth the usage of SLAs for servce provson [9], etc. Lttle s known about the worst case effcency of SLA schedulng solutons. There are only very few theoretcal results on SLA schedulng, and most of them address real tme schedulng wth gven deadlnes. Baruah and Hartsa [] dscuss the onlne schedulng of sequental ndependent obs on real tme systems. They presented the algorthm ROBUST (Resstance to Overload By Usng Slack Tme) whch guarantees a mnmum slack factor for every task. The slack factor f of a task s defned as a rato of ts relatve deadlne to ts executon tme requrement. It s a quanttatve ndcator of the tghtness of the task deadlne. The algorthm provdes an effectve processor utlzaton (EPU) of (f)/f durng the overload nterval. He shows that gven enough processors, onlne schedulng algorthms can be desgned wth performance guarantees arbtrarly close to that of optmal unprocessor schedulng algorthms. A more complete study s presented n [] by Schwegelshohn et al. The authors theoretcally analyze the sngle (SM) and the parallel machne (PM) models subect to obs wth sngle (SSL) and multple servce levels (MSL). Ther analyss s based on the compettve factor whch s measured as the rato of the ncome of the nfrastructure provder obtaned va the schedulng algorthm to the optmal ncome. They provde worst case performance bounds of four greedy acceptance algorthms named SSLSM, SSLPM, MSLSM, MSLPM, and two restrcted acceptance algorthms MSLSMR, and MSLPMR. All of them are based on adaptaton of the preemptve EDD (Earlest Due Date) algorthm for schedulng obs wth deadlnes. In ths paper, we make use of IaaS cloud model proposed n []. To show practcablty and compettveness of the algorthms, we conduct a comprehensve study of ther performance and dervatves usng smulaton. We take nto account an mportant ssue that s crtcal for practcal adopton of the schedulng algorthms: we use workloads based on real producton traces of heterogeneous HPC systems. We study two greedy algorthms: SSLSM and SSLPM. SSLSM accepts every new ob for a sngle machne f ths ob and all prevously accepted obs can be completed n tme. SSLPM accepts obs consderng all avalable processors n parallel machnes. Key propertes of SLA should be observed to provde benefts for real nstallatons. Snce SLAs are often consdered as successors of servce orented real tme paradgm wth deadlnes, we start wth a smple model wth a sngle servce level on a sngle computer, and extend t to a sngle SLA on multple computers. One of the most basc models of SLA provdes relatve deadlne as a functon of the ob executon tme wth a constant servce level parameter of usage. Ths model does not match every real SLA, but the assumptons are nonetheless reasonable. It s stll a vald basc abstracton of SLAs that can be formalzed and automatcally treated. We address an onlne schedulng problem. The obs arrve one by one and after the arrval of a new ob the decson maker must resolve whether he reects ths ncomng ob or schedules t on one of the machnes. The problem s onlne because the decson maker has to resolve t wthout nformaton about the followng obs. For ths problem, we measure the performance of the algorthms by a set of metrcs whch ncludes the compettve factor and the number of accepted obs. 2 Schedulng Model 2. Formal Defnton In ths work, we consder the followng model. A user submts obs to a servce provder, whch has to guarantee some level of servce (SL). Let S [ S, S2,..., S,..., Sk] be the set of servce levels offered by the provder. For a gven servce level S the user s charged at a cost u per unt of
3 Performance Evaluaton of Infrastructure as Servce Clouds wth SLA Constrants 43 executon tme dependng on the urgency of the submtted ob. u max{ u} denotes the max maxmum cost. The urgency of the ob s denoted by the slack factor f. The total number of obs submtted to the system s n r. Each ob J from the released ob set J [ J, J2,, J ] s descrbed by a tuple r n r ( r, p, S, d ) : ts release date r, ts executon tme p, and the SL S. The deadlne of each ob d s calculated at the release of the ob as d r f p. The maxmum deadlne s denoted by d max{ d }. The processng tme max of the ob p becomes known at tme r. Once the ob s released, the provder has to decde, before any other ob arrves, whether the ob s accepted or not. In order to accept the ob J the provder should ensure that some machne n the system s capable of completng J before ts deadlne. In the case of acceptance, further obs should prevent that the ob J msses ts deadlne. Once a ob s accepted, the scheduler uses some heurstc to schedule the ob. Fnally, the set of accepted obs J [ J, J2,, J n ] s a subset of J r where n s the number of obs successfully accepted and executed. 2.2 Metrcs We used several metrcs to evaluate the performance of our schedulng algorthms and SLAs. In contrast to tradtonal schedulng problems, the classc schedulng metrcs such as C max become rrelevant n evaluatng the system performance of systems scheduled through SLAs. One of the obectve functons represents the goal of the nfrastructure provder who wants to maxmze hs total ncome. Job J wth servce level S generates ncome u p n the case of acceptance and zero otherwse. The compettve factor c v n u p V A * s defned as a rato of total ncome generated by an algorthm to optmal ncome VA *. Due to maxmzaton of ncome, a larger compettve factor s better than a smaller one. Note that n our evaluaton of experments, we use the upper bound of the optmal ncome ˆV A nstead of the optmal ncome as we are, * n general, not able to determne the optmal ncome. * * V A Vˆ A m n( u p, u d m) n r max max max The frst bound s the sum of the processng tmes of all released obs multpled by the maxmum prce per unt executon of all avalable SLAs. The second bound s the maxmum deadlne of all released obs multpled by the maxmum prce per unt executon value and the number of machnes n the system. Due to our admsson control polcy, the system does not execute obs whose deadlne cannot be reached; therefore, ths second bound s also an upper bound of the maxmum processng tme n whch the system can execute work. In our experments we analyze SSLSM and SSLPM algorthms, snce only one SL s used; we do not take u max nto account to calculate the compettve factor. We also calculate the number of reected obs and use t as a measure of the capacty of the system to respond to the ncomng flow of obs. Fnally, we calculate the mean watng tme of the obs wthn the system as n MWT ( c p ), where c s the n completon tme of the ob. 3 Expermental Setup 3. Algorthms In our experments, we use SSLSM and SSLPM algorthms based on the EDD (Earlest Deadlne Deadlne) algorthm, whch gves prorty to obs accordng to ther deadlne. The obs that have been admtted but not yet completed are ntroduced n a queue. The obs are ordered n nondecreasng deadlnes. For ther executon,
4 %RJ 44 Anuar Lezama Barquet, Andre Tchernykh, and Ramn Yahyapour obs are taken from the head of the queue. When a new ob s released, t s placed n the queue accordng to ts deadlne. EDD s an optmal algorthm for mnmzng lateness n a sngle machne system. In our case, t corresponds to mnmzng the number of reected obs. Gupta and Paln [2] showed that there cannot exst an algorthm wth a compettve rato greater than (/ f ) ò wth m machnes, and ò s arbtrary small for the problem of allocatng obs on a hard realtme schedulng model n whch a ob must be completed f t was admtted for executon. They proposed an algorthm that acheves a compettve rato of at least ( / f ) and demonstrated that ths s an optmal scheduler for hard realtme schedulng wth m machnes. The admttance test also proposed by them conssts n verfyng that all the already accepted obs whose deadlne s greater than that of the ncomng ob wll be completed before ther deadlne s met. 3.2 Workload In order to evaluate the performance of SLA schedulng, we performed a seres of experments usng traces of HPC obs obtaned from the Parallel Workloads Archve (PWA) [3] and the Grd Workloads Archve (GWA) [4]. These traces are logs from real parallel computer systems, and they gve us a good nsght n how our proposed schemes wll perform wth real users. Predomnance of low parallel obs n real logs s well known. Even though some obs n the traces requre multple processors, we consder that n our model the machnes have enough capacty to process them, so we can abstract ther parallelsm. Snce we assume that IaaS clouds are a promsng alternatve to computatonal centers, we can expect that workload submtted to clouds wll have smlar characterstcs to the ones submtted to actual parallel and grd systems. In our log, we consdered nne traces from DAS2 (Unversty of Amsterdam), DAS2 (Delft Unversty), DAS2 (Utrecht Unversty), DAS2 (Leden Unversty), KTH, DAS2 (Vre Unversty), HPC2N, CTC, and LANL. Detals of the log characterstcs can be found n the PWA [3] and GWA [4]. To obtan vald statstcal values, 3 experments wthn one week perod were smulated for each SLA. We calculated ob deadlnes based on the real processng tme of the obs. 4 Expermental Results 4. Sngle Machne Model For the frst set of experments wth a sngle machne system scheme, we performed experments for 2 values of the slack factor:, 2, 5,, 5, 2, 25, 5,, 2, 5 and. Although we do not expect that a real SLA provdes slack factors greater than 5, large values are mportant to study expected system performance when slack factors tend to nfnty. Fgures 5 show smulaton results of SSLSM algorthm. They present percentage of reected obs, total processng tme of accepted obs, mean watng tme, mean number of nterruptons per ob, and mean compettve factor Percentage of Reected Jobs Fg.. Percentage of reected obs for SSLSM algorthm
5 seconds seconds Performance Evaluaton of Infrastructure as Servce Clouds wth SLA Constrants 45 x 6 Total Processng Tme x 5 Mean Watng Tme Fg. 2. Total processng tme for SSLSM algorthm Fgure shows the percentage of reected obs for the SSLSM algorthm. We see that the number of reected obs decreases whle the slack factor ncreases. Large values of slack factor ncrease the flexblty to accept new obs by delayng the executon of already accepted ones. In the case when a slack factor s equal to, the system cannot accept new obs untl the ob n executon s completed. We observe that the percentage of reected obs wth a slack factor of s a bt lower than that wth values of slack factor from 2 to 25. However, t does not mean that ths slack factor allows the system to execute more computatonal work as we see n Fgure 2. Fgure 2 shows the total processng tme of accepted obs for the gven slack factors. We see that the processng tme ncreases as the slack factor ncreases, meanng that the scheduler s able to explot the ncreased flexblty of the obs. Fgure 3 shows mean watng tme versus the slack factor. It demonstrates that an ncrease of total processng tme causes an ncrease of watng tme. We also evaluate the mean number of nterruptons per ob; these results are showed n Fgure 4. We see that for small slack factors the Fg. 3. Mean watng tme of obs for SSLSM algorthm number of nterruptons s greater than that for larger slack factors. Mean values are below nterrupton per ob. Moreover, f a slack factor s more than, the number of nterruptons per ob s stable and vary between.2 and.3. Ths fact s mportant; keepng the number of nterruptons low prevents the system overhead. Fgure 5 shows the mean compettve factor. It represents the nfrastructure provder obectve to maxmze hs total ncome. Note that a larger compettve factor s better than a smaller one. When the slack factor s equal to, the compettve factor s.85. Once the slack factor s ncreased to 5, we obtan better compettve factors. When the slack factor s equal to 5, the mean compettve factor has ts maxmum value of.94. Passng ths pont, the compettve factor decreases when the slack factor s equal to 2. We consder that at ths pont the deadlnes of the obs are much larger than ther processng tme. If the slack factor s between 2 and 5, the compettve factor s ncreased agan because the maxmum deadlne gets close to the sum of processng tmes. When the deadlne of all obs tends to nfnty, the completve factor s optmal as expected.
6 Interruptons/Job %RJ 46 Anuar Lezama Barquet, Andre Tchernykh, and Ramn Yahyapour Mean Number of Interruptons per Job Percentage of Reected Jobs One machne Two machnes Three machnes 92 Fg. 4. Mean number of nterruptons per ob for SSL SM algorthm Fg. 6. Percentage of reected obs for SSLPM algorthm.9.8 Compettve Factor end, hstorcal workload wthn a gven tme nterval can be analyzed to determne an approprate slack factor. The tme nterval for ths adustment should be set accordng to the dynamc characterstcs of the workload and n the IaaS confguraton. c V Fg. 5. Mean compettve factor of SSLSM algorthm In a real cloud scenaro, the slack factor can be dynamcally adusted n response to changes n the confguraton and/or the workload. To ths 4.2 Multple Machne Model In ths secton, we present the results of SSLPM algorthm smulatons on two and three machnes. We plotted the SSLSM results to analyze the change of the system performance when the number of machnes vares. Fgures 6 show the percentage of reected obs, total processng tme of accepted obs, mean watng tme, mean number of nterruptons per ob, effcency and mean compettve factor. Fgure 6 presents the percentage of reected obs. It can be seen that an ncrease of the number of machnes has a lmted effect on the acceptablty of obs when the slack factor s small. However, larger values of slack factor have greater mpact on the number of accepted obs. Fgure 7 shows the total processng tme of accepted obs. The processng tme s ncreased
7 seconds seconds Interruptons/Job Performance Evaluaton of Infrastructure as Servce Clouds wth SLA Constrants 47 2 x 7 Total Processng Tme.7 Mean Number of Interruptons per Job One machne Two machnes Three machnes Fg. 7. Total processng tme for SSLPM algorthm 9 x Mean Watng Tme One machne Two machnes Three machnes One machne Two machnes Three machnes Fg. 8. Mean watng tme for SSLPM algorthm as more machnes are added to the system. However, doublng and trplng the processng capacty do not cause the same ncrease n the processng tme. Ths effect can be clearly seen when the slack factor s large. We conclude that an ncrease n the processng capacty wll be more effectve wth smaller slack factors. Fgure 8 shows the mean watng tme when slack factor.2. Fg. 9. Mean number of nterrupton for SSLPM algorthm vares. We see that an ncrease of the total processng tme, as a result of larger slack factors, also causes an ncrease of watng tme. Addtonally, addng more machnes to the system makes the ncrease of the mean watng tme less sgnfcant. Fgure 9 shows the mean number of nterruptons per ob. We see that an ncrease of the number of machnes ncreases the number of nterruptons. Ths ncrease s not consderable, and s stablzed as the slack factor s ncreased. The number of nterruptons s maxmal wth a slack factor of 2 for all three models. Fgure shows the executon effcency. Ths metrc ndcates the relatve amount of useful work whch the system executes durng the nterval between the release tme of the frst ob and the completon of the last ob. We see that a decrease of effcency, at least wth moderate slack factors, manly depends on the number of machnes. Fgure presents the compettve factor whle the slack factor vares. We see that for the two and three machne system confguraton the maxmum compettve factor s obtaned wth a slack factor of 2. As we already mentoned, n the case of a sngle machne confguraton the best compettve
8 Effcency 48 Anuar Lezama Barquet, Andre Tchernykh, and Ramn Yahyapour Executon effcency USD 7 Executon cost per hour.95.9 One machne Two machnes Three machnes 6 5 One machne Two machnes Three machnes Fg.. Executon effcency for SSLPM algorthm Fg. 2. Executon cost per hour.9.8 Compettve Factor clearly seen when the slack factor s 2 for a sngle machne confguraton, and for two and three machnes. In the cases of two and three machnes confguraton, for the slack factor greater than 5, the compettve factor almost reached the optmal value. c V Executon Costs.6.5 One machne Two machnes Three machnes Fg.. Compettve factor for SSLPM algorthm factors are obtaned wth a slack factor of 2 and 5. We can also observe that when the slack factor s ncreased, the compettve factor s decreased. Ths happens untl the slack factor becomes large enough to create a sgnfcant dfference between ob deadlnes and ther processng tmes. Ths s In the IaaS scenaro, cloud provders offer computer resources to customers on a payasyougo bass. The prce per tme unt depends on the servces selected by the customer. Ths charge depends not only on the prce the user s wllng to accept, but also on the cost of the nfrastructure mantenance. In order to estmate ths charge, we propose a tarff functon that depends on the slack factor. We frst take nto account that the provder needs to recover the mantenance cost from the executon of obs. We assume that the provder pays a flat rate for the use/mantenance of the resources. The total mantenance cost of ob processng co can be calculated usng the expresson ( ) t
9 Performance Evaluaton of Infrastructure as Servce Clouds wth SLA Constrants 49 n r m p u u m can be calculated as. The cost per tme unt co u co u cot n p, where n r p s the sum of processng tmes of all released obs, u u s the prce per unt of mantenance, m s the number of machnes, and n p s the sum of processng tmes reached by the algorthm. We consder that u u s equal to 8.5 cents per hour, whch s the prce that Amazon EC2 charges for a small processng unt [5]. Fgure 2 shows the executon cost per hour when the slack factor vares. As t can be seen, the cost of processng obs wth a small slack factor s larger than the executon of obs wth a looser slack factor. Moreover, the costs are larger f fewer machnes are used. The reason s that a system wth less machnes and a small slack factor reects most of the obs wthn a gven nterval, so the executon s costly. Therefore, confguratons that execute more obs have lower costs per executon tme unt. Clear proft s generated f cost per tme unt s ncremented. 5 Conclusons and Future Work The use of Servce Level Agreements (SLAs) s a fundamentally new approach for ob schedulng. Accordng to ths approach, schedulng s based on satsfacton of QoS constrants. The man dea s to provde dfferent levels of servce, each addressng a dfferent set of customers. Whle a large number of servce levels leads to hgh flexblty for customers, t also produces a sgnfcant management overhead. Hence, a sutable tradeoff must be found and adusted dynamcally, f necessary. Whle theoretcal worst case IaaS schedulng models begn to emerge, fast statstcal technques appled to real data are effectve as have been shown emprcally. In ths paper, we presented an expermental study of two greedy acceptance algorthms, namely, SSLSM and SSLPM, wth known worst case performance bounds. They are based on the adaptaton of the preemptve EDD algorthm for ob schedulng wth dfferent servce levels on dfferent number of machnes. Our study results n several contrbutons. Frstly, we dentfed several servce levels to make schedulng decsons wth respect to ob acceptance; secondly, we consdered and analyzed two test cases on a sngle machne and on parallel machnes; thrdly, we estmated the cost functon for dfferent servce levels; then, we showed that the slack factor can be dynamcally adusted n response to changes n the confguraton and/or the workload. To ths end, the past workload wthn a gven tme nterval can be analyzed to determne an approprate slack factor. The tme nterval for ths adaptaton depends on the dynamcs of the workload characterstcs and IaaS confguraton. Though our model of IaaS s smplfed, t s stll a vald basc abstracton of SLAs that can be formalzed and treated automatcally. In ths paper, we explored only a few scenaros of usng SLAs. The IaaS clouds are usually large scale and vary sgnfcantly. It s not possble to satsfy all QoS constrants from the servce provder perspectve f a sngle servce level s used. Hence, a balance between the number of servce levels and the number of resources needs to be found and adusted dynamcally. A system can have several specfc servce levels (e.g., Bronze, Slver, Gold) and algorthms to keep the system wth QoS specfed n SLA. However, further study of algorthms for multple servce classes and the resource allocaton algorthms s requred to assess ther actual effcency and effectveness. Ths wll be the subect of future work to acheve a better understandng of servce levels n IaaS clouds. Moreover, other scenaros of the problem wth dfferent types of SLAs and workloads wth a combnaton of obs wth and wthout SLA stll need to be addressed. Also, as future work, we wll consder the elastcty of slack factors n order to ncrease proft whle provdng better QoS to users.
10 4 Anuar Lezama Barquet, Andre Tchernykh, and Ramn Yahyapour References. Garg, S.K., Gopalayengar, S.K., & Buyya, R. (2). SLAbased Resource Provsonng for Heterogeneous Workloads n a Vrtualzed Cloud Datacenter. th nternatonal conference on Algorthms and Archtectures for parallel processng (ICA3PP'), Melbourne, Australa, Wu, L., Garg, S.K., & Buyya, R. (2). SLAbased admsson control for a Softwareasa Servce provder n Cloud computng envronments. th IEEE/ACM Internatonal Symposum on Cluster, Cloud and Grd Computng (CCGrd 2), Newport Beach, CA., USA, Patel, P., Ranabahu, A., & Sheth, A. (29). Servce Level Agreement n Cloud Computng (Techncal Report). Oho Center of Excellence n Knowledgeenabled Computng. 4. Andreux, A., Czakowsk, K., Dan, A., Keahey, K., Ludwg, H., Nakata, T., Pruyne, J., Rofrano, J., Tuecke, S., & Xu, M. (24). Web servces agreement specfcaton (WSAgreement), (GFD RP.7). Global Grd. 5. Revew and summary of cloud servce level agreements. (s.f.). Retreved from rev2sla.html. 6. Wu, L., Garg, S.K., & Buyya, R. (2). SLA Based Resource Allocaton for Software as a Servce Provder (SaaS) n Cloud Computng Envronments. th IEEE/ACM Internatonal Symposum on Cluster, Cloud and Grd Computng (CCGrd 2), Newport Beach, CA,USA, Fretas, A.L., Parlavantzas, N., & Pazat, J.L. (2). Cost Reducton Through SLAdrven Self Management. Nnth IEEE European Conference on Web Servces (ECOWS), Lugano, Swtzerland, Slagh, G.C., Şerban, L.D., & Ltan, C.M. (2). A Framework for Buldng Intellgent SLA Negotaton Strateges under Tme Constrants. Economcs of Grds, Clouds, Systems, and Servces, Lecture Notes n Computer Scence, 6296, Macías, M., Smth, G., Rana, O., Gutart, J., & Torres, J. (2). Enforcng Servce Level Agreements Usng an Economcally Enhanced Resource Manager. Economc Models and Algorthms for Dstrbuted Systems, Autonomc Systems, Baruah, S.K. & Hartsa, J.R. (997). Schedulng for overload n realtme systems. IEEE Transactons on Computers, 46(9), Schwegelshohn, U. & Tchernykh, A. (22). Onlne Schedulng for Cloud Computng and Dfferent Servce Levels. IEEE 26th Internatonal Parallel and Dstrbuted Processng Symposum Workshops, Shangha, Chna, Gupta, B.D. & Pals, M.A. (2). Onlne realtme preemptve schedulng of obs wth deadlnes on multple machnes. Journal of Schedulng, 4(6), D. Fetelson (28). Parallel Workloads Archve. Algorthms and Archtectures for. 4. Iosup, A., L, H., Jan, M., Anoep, S., Dumtrescu, C., Wolters, L., & Epema, D.H. (28). The Grd Workloads Archve. Future Generaton Computer Systems, 24(7), Amazon Servces. (23). Precos deamazon EC2 Retreved from Anuar Lezama Barquet obtaned a degree n Electrc and Electronc Engneer from the Natonal Autonomous Unversty of Mexco (UNAM). He receved hs M.S. n Computer Scence from the CICESE Research Center n 22. Hs nterests nclude parallel computng, schedulng, and cloud computng. Andre Tchernykh s a researcher at the Computer Scence Department, CICESE Research Center, Ensenada, Baa Calforna, Mexco. From 975 to 99 he was wth the Insttute of Precse Mechancs and Computer Technology of the Russan Academy of Scences (Moscow, Russa). He receved hs Ph.D. n Computer Scence n 986. In CICESE, he s a coordnator of the Parallel Computng Laboratory. He s a member of the Natonal System of Researchers of Mexco
11 Performance Evaluaton of Infrastructure as Servce Clouds wth SLA Constrants 4 (SNI), Level II. He leads a number of natonal and nternatonal research proects. He served as a program commttee member of several professonal conferences and a general cochar for nternatonal conferences on Parallel Computng Systems. Hs man research nterests nclude schedulng, load balancng, adaptve resource allocaton, scalable energyaware algorthms, green grd and cloud computng, ecofrendly P2P schedulng, multobectve optmzaton, schedulng n real tme systems, computatonal ntellgence, heurstcs, metaheurstcs, and ncomplete nformaton processng. Ramn Yahyapour s executve drector of the GWDG Unversty of Göttngen. He has done research n Clouds, Grd and Servceorented Infrastructures for several years. Hs research nterests are n resource management. He s a steerng group member and on the Board of Drectors n the Open Grd Forum. He has partcpated n several natonal and European research proects. Also, he s a scentfc coordnator of the FP7 IP and was a steerng group member n the CoreGRID Network of Excellence. Artcle receved on 22/2/23; accepted /8/23.
Fault tolerance in cloud technologies presented as a service
Internatonal Scentfc Conference Computer Scence 2015 Pavel Dzhunev, PhD student Fault tolerance n cloud technologes presented as a servce INTRODUCTION Improvements n technques for vrtualzaton and performance
More informationA ReplicationBased and Fault Tolerant Allocation Algorithm for Cloud Computing
A ReplcatonBased and Fault Tolerant Allocaton Algorthm for Cloud Computng Tork Altameem Dept of Computer Scence, RCC, Kng Saud Unversty, PO Box: 28095 11437 RyadhSaud Araba Abstract The very large nfrastructure
More informationJ. Parallel Distrib. Comput. Environmentconscious scheduling of HPC applications on distributed Cloudoriented data centers
J. Parallel Dstrb. Comput. 71 (2011) 732 749 Contents lsts avalable at ScenceDrect J. Parallel Dstrb. Comput. ournal homepage: www.elsever.com/locate/pdc Envronmentconscous schedulng of HPC applcatons
More informationThe Development of Web Log Mining Based on ImproveKMeans Clustering Analysis
The Development of Web Log Mnng Based on ImproveKMeans Clusterng Analyss TngZhong Wang * College of Informaton Technology, Luoyang Normal Unversty, Luoyang, 471022, Chna wangtngzhong2@sna.cn Abstract.
More informationAn Optimal Model for Priority based Service Scheduling Policy for Cloud Computing Environment
An Optmal Model for Prorty based Servce Schedulng Polcy for Cloud Computng Envronment Dr. M. Dakshayn Dept. of ISE, BMS College of Engneerng, Bangalore, Inda. Dr. H. S. Guruprasad Dept. of ISE, BMS College
More informationOpen Access A Load Balancing Strategy with Bandwidth Constraint in Cloud Computing. Jing Deng 1,*, Ping Guo 2, Qi Li 3, Haizhu Chen 1
Send Orders for Reprnts to reprnts@benthamscence.ae The Open Cybernetcs & Systemcs Journal, 2014, 8, 115121 115 Open Access A Load Balancng Strategy wth Bandwdth Constrant n Cloud Computng Jng Deng 1,*,
More informationProject Networks With MixedTime Constraints
Project Networs Wth MxedTme Constrants L Caccetta and B Wattananon Western Australan Centre of Excellence n Industral Optmsaton (WACEIO) Curtn Unversty of Technology GPO Box U1987 Perth Western Australa
More informationCloud AutoScaling with Deadline and Budget Constraints
Prelmnary verson. Fnal verson appears In Proceedngs of 11th ACM/IEEE Internatonal Conference on Grd Computng (Grd 21). Oct 2528, 21. Brussels, Belgum. Cloud AutoScalng wth Deadlne and Budget Constrants
More informationIWFMS: An Internal Workflow Management System/Optimizer for Hadoop
IWFMS: An Internal Workflow Management System/Optmzer for Hadoop Lan Lu, Yao Shen Department of Computer Scence and Engneerng Shangha JaoTong Unversty Shangha, Chna lustrve@gmal.com, yshen@cs.sjtu.edu.cn
More informationCommunication Networks II Contents
8 / 1  Communcaton Networs II (Görg)  www.comnets.unbremen.de Communcaton Networs II Contents 1 Fundamentals of probablty theory 2 Traffc n communcaton networs 3 Stochastc & Marovan Processes (SP
More informationQoSbased Scheduling of Workflow Applications on Service Grids
QoSbased Schedulng of Workflow Applcatons on Servce Grds Ja Yu, Rakumar Buyya and Chen Khong Tham Grd Computng and Dstrbuted System Laboratory Dept. of Computer Scence and Software Engneerng The Unversty
More informationProfitAware DVFS Enabled Resource Management of IaaS Cloud
IJCSI Internatonal Journal of Computer Scence Issues, Vol. 0, Issue, No, March 03 ISSN (Prnt): 694084 ISSN (Onlne): 6940784 www.ijcsi.org 37 ProftAware DVFS Enabled Resource Management of IaaS Cloud
More informationInstitute of Informatics, Faculty of Business and Management, Brno University of Technology,Czech Republic
Lagrange Multplers as Quanttatve Indcators n Economcs Ivan Mezník Insttute of Informatcs, Faculty of Busness and Management, Brno Unversty of TechnologCzech Republc Abstract The quanttatve role of Lagrange
More informationPolitecnico di Torino. Porto Institutional Repository
Poltecnco d Torno Porto Insttutonal Repostory [Artcle] A costeffectve cloud computng framework for acceleratng multmeda communcaton smulatons Orgnal Ctaton: D. Angel, E. Masala (2012). A costeffectve
More informationData Broadcast on a MultiSystem Heterogeneous Overlayed Wireless Network *
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 24, 819840 (2008) Data Broadcast on a MultSystem Heterogeneous Overlayed Wreless Network * Department of Computer Scence Natonal Chao Tung Unversty Hsnchu,
More informationCostbased Scheduling of Scientific Workflow Applications on Utility Grids
Costbased Schedulng of Scentfc Workflow Applcatons on Utlty Grds Ja Yu, Rakumar Buyya and Chen Khong Tham Grd Computng and Dstrbuted Systems Laboratory Dept. of Computer Scence and Software Engneerng
More informationThe Greedy Method. Introduction. 0/1 Knapsack Problem
The Greedy Method Introducton We have completed data structures. We now are gong to look at algorthm desgn methods. Often we are lookng at optmzaton problems whose performance s exponental. For an optmzaton
More informationSurvey on Virtual Machine Placement Techniques in Cloud Computing Environment
Survey on Vrtual Machne Placement Technques n Cloud Computng Envronment Rajeev Kumar Gupta and R. K. Paterya Department of Computer Scence & Engneerng, MANIT, Bhopal, Inda ABSTRACT In tradtonal data center
More informationFeature selection for intrusion detection. Slobodan Petrović NISlab, Gjøvik University College
Feature selecton for ntruson detecton Slobodan Petrovć NISlab, Gjøvk Unversty College Contents The feature selecton problem Intruson detecton Traffc features relevant for IDS The CFS measure The mrmr measure
More informationSelfAdaptive SLADriven Capacity Management for Internet Services
SelfAdaptve SLADrven Capacty Management for Internet Servces Bruno Abrahao, Vrglo Almeda and Jussara Almeda Computer Scence Department Federal Unversty of Mnas Geras, Brazl Alex Zhang, Drk Beyer and
More informationAn Alternative Way to Measure Private Equity Performance
An Alternatve Way to Measure Prvate Equty Performance Peter Todd Parlux Investment Technology LLC Summary Internal Rate of Return (IRR) s probably the most common way to measure the performance of prvate
More informationMethodology to Determine Relationships between Performance Factors in Hadoop Cloud Computing Applications
Methodology to Determne Relatonshps between Performance Factors n Hadoop Cloud Computng Applcatons Lus Eduardo Bautsta Vllalpando 1,2, Alan Aprl 1 and Alan Abran 1 1 Department of Software Engneerng and
More informationA New Quality of Service Metric for Hard/Soft RealTime Applications
A New Qualty of Servce Metrc for Hard/Soft RealTme Applcatons Shaoxong Hua and Gang Qu Electrcal and Computer Engneerng Department and Insttute of Advanced Computer Study Unversty of Maryland, College
More informationMultiplePeriod Attribution: Residuals and Compounding
MultplePerod Attrbuton: Resduals and Compoundng Our revewer gave these authors full marks for dealng wth an ssue that performance measurers and vendors often regard as propretary nformaton. In 1994, Dens
More informationPower Consumption Optimization Strategy of Cloud Workflow. Scheduling Based on SLA
Power Consumpton Optmzaton Strategy of Cloud Workflow Schedulng Based on SLA YONGHONG LUO, SHUREN ZHOU School of Computer and Communcaton Engneerng Changsha Unversty of Scence and Technology 960, 2nd Secton,
More informationA Secure PasswordAuthenticated Key Agreement Using Smart Cards
A Secure PasswordAuthentcated Key Agreement Usng Smart Cards Ka Chan 1, WenChung Kuo 2 and JnChou Cheng 3 1 Department of Computer and Informaton Scence, R.O.C. Mltary Academy, Kaohsung 83059, Tawan,
More informationMETHODOLOGY TO DETERMINE RELATIONSHIPS BETWEEN PERFORMANCE FACTORS IN HADOOP CLOUD COMPUTING APPLICATIONS
METHODOLOGY TO DETERMINE RELATIONSHIPS BETWEEN PERFORMANCE FACTORS IN HADOOP CLOUD COMPUTING APPLICATIONS Lus Eduardo Bautsta Vllalpando 1,2, Alan Aprl 1 and Alan Abran 1 1 Department of Software Engneerng
More informationPAS: A Packet Accounting System to Limit the Effects of DoS & DDoS. Debish Fesehaye & Klara Naherstedt University of IllinoisUrbana Champaign
PAS: A Packet Accountng System to Lmt the Effects of DoS & DDoS Debsh Fesehaye & Klara Naherstedt Unversty of IllnosUrbana Champagn DoS and DDoS DDoS attacks are ncreasng threats to our dgtal world. Exstng
More informationAn InterestOriented Network Evolution Mechanism for Online Communities
An InterestOrented Network Evoluton Mechansm for Onlne Communtes Cahong Sun and Xaopng Yang School of Informaton, Renmn Unversty of Chna, Bejng 100872, P.R. Chna {chsun,yang}@ruc.edu.cn Abstract. Onlne
More informationComplex Service Provisioning in Collaborative Cloud Markets
Melane Sebenhaar, Ulrch Lampe, Tm Lehrg, Sebastan Zöller, Stefan Schulte, Ralf Stenmetz: Complex Servce Provsonng n Collaboratve Cloud Markets. In: W. Abramowcz et al. (Eds.): Proceedngs of the 4th European
More informationJoint Scheduling of Processing and Shuffle Phases in MapReduce Systems
Jont Schedulng of Processng and Shuffle Phases n MapReduce Systems Fangfe Chen, Mural Kodalam, T. V. Lakshman Department of Computer Scence and Engneerng, The Penn State Unversty Bell Laboratores, AlcatelLucent
More informationFORMAL ANALYSIS FOR REALTIME SCHEDULING
FORMAL ANALYSIS FOR REALTIME SCHEDULING Bruno Dutertre and Vctora Stavrdou, SRI Internatonal, Menlo Park, CA Introducton In modern avoncs archtectures, applcaton software ncreasngly reles on servces provded
More informationA DYNAMIC CRASHING METHOD FOR PROJECT MANAGEMENT USING SIMULATIONBASED OPTIMIZATION. Michael E. Kuhl Radhamés A. TolentinoPeña
Proceedngs of the 2008 Wnter Smulaton Conference S. J. Mason, R. R. Hll, L. Mönch, O. Rose, T. Jefferson, J. W. Fowler eds. A DYNAMIC CRASHING METHOD FOR PROJECT MANAGEMENT USING SIMULATIONBASED OPTIMIZATION
More informationResource Scheduling in Desktop Grid by GridJQA
The 3rd Internatonal Conference on Grd and Pervasve Computng  Worshops esource Schedulng n Destop Grd by GrdJQA L. Mohammad Khanl M. Analou Assstant professor Assstant professor C.S. Dept.Tabrz Unversty
More informationDynamic Pricing for Smart Grid with Reinforcement Learning
Dynamc Prcng for Smart Grd wth Renforcement Learnng ByungGook Km, Yu Zhang, Mhaela van der Schaar, and JangWon Lee Samsung Electroncs, Suwon, Korea Department of Electrcal Engneerng, UCLA, Los Angeles,
More informationAn Analysis of Central Processor Scheduling in Multiprogrammed Computer Systems
STANCS73355 I SUSE73013 An Analyss of Central Processor Schedulng n Multprogrammed Computer Systems (Dgest Edton) by Thomas G. Prce October 1972 Techncal Report No. 57 Reproducton n whole or n part
More informationMAPP. MERIS level 3 cloud and water vapour products. Issue: 1. Revision: 0. Date: 9.12.1998. Function Name Organisation Signature Date
Ttel: Project: Doc. No.: MERIS level 3 cloud and water vapour products MAPP MAPPATBDClWVL3 Issue: 1 Revson: 0 Date: 9.12.1998 Functon Name Organsaton Sgnature Date Author: Bennartz FUB Preusker FUB Schüller
More informationJ. Parallel Distrib. Comput.
J. Parallel Dstrb. Comput. 71 (2011) 62 76 Contents lsts avalable at ScenceDrect J. Parallel Dstrb. Comput. journal homepage: www.elsever.com/locate/jpdc Optmzng server placement n dstrbuted systems n
More informationA hybrid global optimization algorithm based on parallel chaos optimization and outlook algorithm
Avalable onlne www.ocpr.com Journal of Chemcal and Pharmaceutcal Research, 2014, 6(7):18841889 Research Artcle ISSN : 09757384 CODEN(USA) : JCPRC5 A hybrd global optmzaton algorthm based on parallel
More informationProfitMaximizing Virtual Machine Trading in a Federation of Selfish Clouds
ProftMaxmzng Vrtual Machne Tradng n a Federaton of Selfsh Clouds Hongxng L, Chuan Wu, Zongpeng L and Francs CM Lau Department of Computer Scence, The Unversty of Hong Kong, Hong Kong, Emal: hxl, cwu,
More informationResource Sharing Models and Heuristic Load Balancing Methods for
Resource Sharng Models and Heurstc Load Balancng Methods for Grd Schedulng Problems Wanneng Shu 1,2, Lxn Dng 2,3,*, Shenwen Wang 2,3 1 College of Computer Scence, SouthCentral Unversty for Natonaltes,
More informationFeasibility of Using Discriminate Pricing Schemes for Energy Trading in Smart Grid
Feasblty of Usng Dscrmnate Prcng Schemes for Energy Tradng n Smart Grd Wayes Tushar, Chau Yuen, Bo Cha, Davd B. Smth, and H. Vncent Poor Sngapore Unversty of Technology and Desgn, Sngapore 138682. Emal:
More informationModeling and Analysis of 2D Service Differentiation on ecommerce Servers
Modelng and Analyss of D Servce Dfferentaton on ecommerce Servers Xaobo Zhou, Unversty of Colorado, Colorado Sprng, CO zbo@cs.uccs.edu Janbn We and ChengZhong Xu Wayne State Unversty, Detrot, Mchgan
More informationAN APPOINTMENT ORDER OUTPATIENT SCHEDULING SYSTEM THAT IMPROVES OUTPATIENT EXPERIENCE
AN APPOINTMENT ORDER OUTPATIENT SCHEDULING SYSTEM THAT IMPROVES OUTPATIENT EXPERIENCE YuL Huang Industral Engneerng Department New Mexco State Unversty Las Cruces, New Mexco 88003, U.S.A. Abstract Patent
More informationA New Task Scheduling Algorithm Based on Improved Genetic Algorithm
A New Task Schedulng Algorthm Based on Improved Genetc Algorthm n Cloud Computng Envronment Congcong Xong, Long Feng, Lxan Chen A New Task Schedulng Algorthm Based on Improved Genetc Algorthm n Cloud Computng
More informationOn the Optimal Control of a Cascade of HydroElectric Power Stations
On the Optmal Control of a Cascade of HydroElectrc Power Statons M.C.M. Guedes a, A.F. Rbero a, G.V. Smrnov b and S. Vlela c a Department of Mathematcs, School of Scences, Unversty of Porto, Portugal;
More informationPowerofTwo Policies for Single Warehouse MultiRetailer Inventory Systems with Order Frequency Discounts
Powerofwo Polces for Sngle Warehouse MultRetaler Inventory Systems wth Order Frequency Dscounts José A. Ventura Pennsylvana State Unversty (USA) Yale. Herer echnon Israel Insttute of echnology (Israel)
More informationSciences Shenyang, Shenyang, China.
Advanced Materals Research Vols. 314316 (2011) pp 13151320 (2011) Trans Tech Publcatons, Swtzerland do:10.4028/www.scentfc.net/amr.314316.1315 Solvng the TwoObectve Shop Schedulng Problem n MTO Manufacturng
More informationThe OC Curve of Attribute Acceptance Plans
The OC Curve of Attrbute Acceptance Plans The Operatng Characterstc (OC) curve descrbes the probablty of acceptng a lot as a functon of the lot s qualty. Fgure 1 shows a typcal OC Curve. 10 8 6 4 1 3 4
More informationModule 2 LOSSLESS IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module LOSSLESS IMAGE COMPRESSION SYSTEMS Lesson 3 Lossless Compresson: Huffman Codng Instructonal Objectves At the end of ths lesson, the students should be able to:. Defne and measure source entropy..
More information1 Approximation Algorithms
CME 305: Dscrete Mathematcs and Algorthms 1 Approxmaton Algorthms In lght of the apparent ntractablty of the problems we beleve not to le n P, t makes sense to pursue deas other than complete solutons
More informationPeriod and Deadline Selection for Schedulability in RealTime Systems
Perod and Deadlne Selecton for Schedulablty n RealTme Systems Thdapat Chantem, Xaofeng Wang, M.D. Lemmon, and X. Sharon Hu Department of Computer Scence and Engneerng, Department of Electrcal Engneerng
More informationLITERATURE REVIEW: VARIOUS PRIORITY BASED TASK SCHEDULING ALGORITHMS IN CLOUD COMPUTING
LITERATURE REVIEW: VARIOUS PRIORITY BASED TASK SCHEDULING ALGORITHMS IN CLOUD COMPUTING 1 MS. POOJA.P.VASANI, 2 MR. NISHANT.S. SANGHANI 1 M.Tech. [Software Systems] Student, Patel College of Scence and
More informationA Novel Auction Mechanism for Selling TimeSensitive EServices
A ovel Aucton Mechansm for Sellng TmeSenstve EServces JuongSk Lee and Boleslaw K. Szymansk Optmaret Inc. and Department of Computer Scence Rensselaer Polytechnc Insttute 110 8 th Street, Troy, Y 12180,
More informationA heuristic task deployment approach for load balancing
Xu Gaochao, Dong Yunmeng, Fu Xaodog, Dng Yan, Lu Peng, Zhao Ja Abstract A heurstc task deployment approach for load balancng Gaochao Xu, Yunmeng Dong, Xaodong Fu, Yan Dng, Peng Lu, Ja Zhao * College of
More informationPreventive Maintenance and Replacement Scheduling: Models and Algorithms
Preventve Mantenance and Replacement Schedulng: Models and Algorthms By Kamran S. Moghaddam B.S. Unversty of Tehran 200 M.S. Tehran Polytechnc 2003 A Dssertaton Proposal Submtted to the Faculty of the
More informationLuby s Alg. for Maximal Independent Sets using Pairwise Independence
Lecture Notes for Randomzed Algorthms Luby s Alg. for Maxmal Independent Sets usng Parwse Independence Last Updated by Erc Vgoda on February, 006 8. Maxmal Independent Sets For a graph G = (V, E), an ndependent
More informationForecasting the Demand of Emergency Supplies: Based on the CBR Theory and BP Neural Network
700 Proceedngs of the 8th Internatonal Conference on Innovaton & Management Forecastng the Demand of Emergency Supples: Based on the CBR Theory and BP Neural Network Fu Deqang, Lu Yun, L Changbng School
More informationApplication of MultiAgents for Fault Detection and Reconfiguration of Power Distribution Systems
1 Applcaton of MultAgents for Fault Detecton and Reconfguraton of Power Dstrbuton Systems K. Nareshkumar, Member, IEEE, M. A. Choudhry, Senor Member, IEEE, J. La, A. Felach, Senor Member, IEEE AbstractThe
More informationCHOLESTEROL REFERENCE METHOD LABORATORY NETWORK. Sample Stability Protocol
CHOLESTEROL REFERENCE METHOD LABORATORY NETWORK Sample Stablty Protocol Background The Cholesterol Reference Method Laboratory Network (CRMLN) developed certfcaton protocols for total cholesterol, HDL
More informationAdaptive and Dynamic Load Balancing in Grid Using Ant Colony Optimization
Sandp Kumar Goyal et al. / Internatonal Journal of Engneerng and Technology (IJET) Adaptve and Dynamc Load Balancng n Grd Usng Ant Colony Optmzaton Sandp Kumar Goyal 1, Manpreet Sngh 1 Department of Computer
More informationEfficient Bandwidth Management in Broadband Wireless Access Systems Using CACbased Dynamic Pricing
Effcent Bandwdth Management n Broadband Wreless Access Systems Usng CACbased Dynamc Prcng Bader AlManthar, Ndal Nasser 2, Najah Abu Al 3, Hossam Hassanen Telecommuncatons Research Laboratory School of
More informationHeuristic Scheduling Algorithms for Allocation of Virtualized Network and Computing Resources
Journal of Software Engneerng and Applcatons, 203, 6, 3 http://dx.do.org/0.4236/sea.203.600 Publshed Onlne January 203 (http://www.scrp.org/ournal/sea) Heurstc Schedulng Algorthms for Allocaton of Vrtualzed
More informationEnabling P2P Oneview Multiparty Video Conferencing
Enablng P2P Onevew Multparty Vdeo Conferencng Yongxang Zhao, Yong Lu, Changja Chen, and JanYn Zhang Abstract MultParty Vdeo Conferencng (MPVC) facltates realtme group nteracton between users. Whle P2P
More informationA LoadBalancing Algorithm for Clusterbased Multicore Web Servers
Journal of Computatonal Informaton Systems 7: 13 (2011) 47404747 Avalable at http://www.jofcs.com A LoadBalancng Algorthm for Clusterbased Multcore Web Servers Guohua YOU, Yng ZHAO College of Informaton
More informationDynamic Scheduling of Emergency Department Resources
Dynamc Schedulng of Emergency Department Resources Junchao Xao Laboratory for Internet Software Technologes, Insttute of Software, Chnese Academy of Scences P.O.Box 8718, No. 4 South Fourth Street, Zhong
More informationOnline Auctions in IaaS Clouds: Welfare and Profit Maximization with Server Costs
Onlne Auctons n IaaS Clouds: Welfare and roft Maxmzaton wth Server Costs aox Zhang Dept. of Computer Scence The Unvety of Hong Kong xxzhang@cs.hku.hk Zongpeng L Dept. of Computer Scence Unvety of Calgary
More informationCalculating the high frequency transmission line parameters of power cables
< ' Calculatng the hgh frequency transmsson lne parameters of power cables Authors: Dr. John Dcknson, Laboratory Servces Manager, N 0 RW E B Communcatons Mr. Peter J. Ncholson, Project Assgnment Manager,
More informationIMPACT ANALYSIS OF A CELLULAR PHONE
4 th ASA & μeta Internatonal Conference IMPACT AALYSIS OF A CELLULAR PHOE We Lu, 2 Hongy L Bejng FEAonlne Engneerng Co.,Ltd. Bejng, Chna ABSTRACT Drop test smulaton plays an mportant role n nvestgatng
More informationPerformance Analysis of Energy Consumption of Smartphone Running Mobile Hotspot Application
Internatonal Journal of mart Grd and lean Energy Performance Analyss of Energy onsumpton of martphone Runnng Moble Hotspot Applcaton Yun on hung a chool of Electronc Engneerng, oongsl Unversty, 511 angdodong,
More informationEfficient Striping Techniques for Variable Bit Rate Continuous Media File Servers æ
Effcent Strpng Technques for Varable Bt Rate Contnuous Meda Fle Servers æ Prashant J. Shenoy Harrck M. Vn Department of Computer Scence, Department of Computer Scences, Unversty of Massachusetts at Amherst
More informationDEFINING %COMPLETE IN MICROSOFT PROJECT
CelersSystems DEFINING %COMPLETE IN MICROSOFT PROJECT PREPARED BY James E Aksel, PMP, PMISP, MVP For Addtonal Informaton about Earned Value Management Systems and reportng, please contact: CelersSystems,
More informationTraffic State Estimation in the Traffic Management Center of Berlin
Traffc State Estmaton n the Traffc Management Center of Berln Authors: Peter Vortsch, PTV AG, Stumpfstrasse, D763 Karlsruhe, Germany phone ++49/72/965/35, emal peter.vortsch@ptv.de Peter Möhl, PTV AG,
More informationDynamic Resource Allocation and Power Management in Virtualized Data Centers
Dynamc Resource Allocaton and Power Management n Vrtualzed Data Centers Rahul Urgaonkar, Ulas C. Kozat, Ken Igarash, Mchael J. Neely urgaonka@usc.edu, {kozat, garash}@docomolabsusa.com, mjneely@usc.edu
More informationAn Integrated Scheduling Mechanism for FaultTolerant Modular Avionics Systems
An Integrated Schedulng Mechansm for FaultTolerant Modular Avoncs Systems YannHang Lee Mohamed Youns Jeff Zhou CISE Department Unversty of Florda Ganesvlle, FL 326 yhlee@cse.ufl.edu Advanced System Technology
More informationWhat is Candidate Sampling
What s Canddate Samplng Say we have a multclass or mult label problem where each tranng example ( x, T ) conssts of a context x a small (mult)set of target classes T out of a large unverse L of possble
More informationA Performance Analysis of View Maintenance Techniques for Data Warehouses
A Performance Analyss of Vew Mantenance Technques for Data Warehouses Xng Wang Dell Computer Corporaton Round Roc, Texas Le Gruenwald The nversty of Olahoma School of Computer Scence orman, OK 739 Guangtao
More informationAuditing Cloud Service Level Agreement on VM CPU Speed
Audtng Cloud Servce Level Agreement on VM CPU Speed Ryan Houlhan, aojang Du, Chu C. Tan, Je Wu Department of Computer and Informaton Scences Temple Unversty Phladelpha, PA 19122, USA Emal: {ryan.houlhan,
More informationRealTime Process Scheduling
RealTme Process Schedulng ktw@cse.ntu.edu.tw (RealTme and Embedded Systems Laboratory) Independent Process Schedulng Processes share nothng but CPU Papers for dscussons: C.L. Lu and James. W. Layland,
More informationPrice Competition in an Oligopoly Market with Multiple IaaS Cloud Providers
Prce Competton n an Olgopoly Market wth Multple IaaS Cloud Provders Yuan Feng, Baochun L, Bo L Department of Computng, Hong Kong Polytechnc Unversty Department of Electrcal and Computer Engneerng, Unversty
More informationAnts Can Schedule Software Projects
Ants Can Schedule Software Proects Broderck Crawford 1,2, Rcardo Soto 1,3, Frankln Johnson 4, and Erc Monfroy 5 1 Pontfca Unversdad Católca de Valparaíso, Chle FrstName.Name@ucv.cl 2 Unversdad Fns Terrae,
More informationFlexible Distributed Capacity Allocation and Load Redirect Algorithms for Cloud Systems
2011 IEEE 4th Internatonal Conference on Cloud Computng Flexble Dstrbuted Capacty Allocaton and Load Redrect Algorthms for Cloud Systems Danlo Ardagna, Sara Casolar, Barbara Pancucc Poltecnco d Mlano,
More informationCost Minimization using Renewable Cooling and Thermal Energy Storage in CDNs
Cost Mnmzaton usng Renewable Coolng and Thermal Energy Storage n CDNs Stephen Lee College of Informaton and Computer Scences UMass, Amherst stephenlee@cs.umass.edu Rahul Urgaonkar IBM Research rurgaon@us.bm.com
More informationAn ILP Formulation for Task Mapping and Scheduling on Multicore Architectures
An ILP Formulaton for Task Mappng and Schedulng on Multcore Archtectures Yng Y, We Han, Xn Zhao, Ahmet T. Erdogan and Tughrul Arslan Unversty of Ednburgh, The Kng's Buldngs, Mayfeld Road, Ednburgh, EH9
More informationSchedulability Bound of Weighted Round Robin Schedulers for Hard RealTime Systems
Schedulablty Bound of Weghted Round Robn Schedulers for Hard RealTme Systems Janja Wu, JyhCharn Lu, and We Zhao Department of Computer Scence, Texas A&M Unversty {janjaw, lu, zhao}@cs.tamu.edu Abstract
More informationOptimal Pricing for IntegratedServices Networks. with Guaranteed Quality of Service &
Optmal Prcng for IntegratedServces Networks wth Guaranteed Qualty of Servce & y Qong Wang * Jon M. Peha^ Marvn A. Sru # Carnege Mellon Unversty Chapter n Internet Economcs, edted y Joseph Baley and Lee
More informationResearch of Network System Reconfigurable Model Based on the Finite State Automation
JOURNAL OF NETWORKS, VOL., NO. 5, MAY 24 237 Research of Network System Reconfgurable Model Based on the Fnte State Automaton Shenghan Zhou and Wenbng Chang School of Relablty and System Engneerng, Behang
More informationDBAVM: Dynamic Bandwidth Allocator for Virtual Machines
DBAVM: Dynamc Bandwdth Allocator for Vrtual Machnes Ahmed Amamou, Manel Bourguba, Kamel Haddadou and Guy Pujolle LIP6, Perre & Mare Cure Unversty, 4 Place Jusseu 755 Pars, France Gand SAS, 65 Boulevard
More informationVoIP Playout Buffer Adjustment using Adaptive Estimation of Network Delays
VoIP Playout Buffer Adjustment usng Adaptve Estmaton of Network Delays Mroslaw Narbutt and Lam Murphy* Department of Computer Scence Unversty College Dubln, Belfeld, Dubln, IRELAND Abstract The poor qualty
More informationStudy on Model of Risks Assessment of Standard Operation in Rural Power Network
Study on Model of Rsks Assessment of Standard Operaton n Rural Power Network Qngj L 1, Tao Yang 2 1 Qngj L, College of Informaton and Electrcal Engneerng, Shenyang Agrculture Unversty, Shenyang 110866,
More informationA generalized hierarchical fair service curve algorithm for high network utilization and linksharing
Computer Networks 43 (2003) 669 694 www.elsever.com/locate/comnet A generalzed herarchcal far servce curve algorthm for hgh network utlzaton and lnksharng Khyun Pyun *, Junehwa Song, HeungKyu Lee Department
More informationRESEARCH ON DUALSHAKER SINE VIBRATION CONTROL. Yaoqi FENG 1, Hanping QIU 1. China Academy of Space Technology (CAST) yaoqi.feng@yahoo.
ICSV4 Carns Australa 9 July, 007 RESEARCH ON DUALSHAKER SINE VIBRATION CONTROL Yaoq FENG, Hanpng QIU Dynamc Test Laboratory, BISEE Chna Academy of Space Technology (CAST) yaoq.feng@yahoo.com Abstract
More informationbenefit is 2, paid if the policyholder dies within the year, and probability of death within the year is ).
REVIEW OF RISK MANAGEMENT CONCEPTS LOSS DISTRIBUTIONS AND INSURANCE Loss and nsurance: When someone s subject to the rsk of ncurrng a fnancal loss, the loss s generally modeled usng a random varable or
More informationHosting Virtual Machines on Distributed Datacenters
Hostng Vrtual Machnes on Dstrbuted Datacenters Chuan Pham Scence and Engneerng, KyungHee Unversty, Korea pchuan@khu.ac.kr Jae Hyeok Son Scence and Engneerng, KyungHee Unversty, Korea sonaehyeok@khu.ac.kr
More informationRisk Model of LongTerm Production Scheduling in Open Pit Gold Mining
Rsk Model of LongTerm Producton Schedulng n Open Pt Gold Mnng R Halatchev 1 and P Lever 2 ABSTRACT Open pt gold mnng s an mportant sector of the Australan mnng ndustry. It uses large amounts of nvestments,
More informationCloudbased Social Application Deployment using Local Processing and Global Distribution
Cloudbased Socal Applcaton Deployment usng Local Processng and Global Dstrbuton Zh Wang *, Baochun L, Lfeng Sun *, and Shqang Yang * * Bejng Key Laboratory of Networked Multmeda Department of Computer
More informationForecasting the Direction and Strength of Stock Market Movement
Forecastng the Drecton and Strength of Stock Market Movement Jngwe Chen Mng Chen Nan Ye cjngwe@stanford.edu mchen5@stanford.edu nanye@stanford.edu Abstract  Stock market s one of the most complcated systems
More informationANALYZING THE RELATIONSHIPS BETWEEN QUALITY, TIME, AND COST IN PROJECT MANAGEMENT DECISION MAKING
ANALYZING THE RELATIONSHIPS BETWEEN QUALITY, TIME, AND COST IN PROJECT MANAGEMENT DECISION MAKING Matthew J. Lberatore, Department of Management and Operatons, Vllanova Unversty, Vllanova, PA 19085, 6105194390,
More informationPerformance Analysis and Comparison of QoS Provisioning Mechanisms for CBR Traffic in Noisy IEEE 802.11e WLANs Environments
Tamkang Journal of Scence and Engneerng, Vol. 12, No. 2, pp. 143149 (2008) 143 Performance Analyss and Comparson of QoS Provsonng Mechansms for CBR Traffc n Nosy IEEE 802.11e WLANs Envronments DerJunn
More informationAnswer: A). There is a flatter IS curve in the high MPC economy. Original LM LM after increase in M. IS curve for low MPC economy
4.02 Quz Solutons Fall 2004 MultpleChoce Questons (30/00 ponts) Please, crcle the correct answer for each of the followng 0 multplechoce questons. For each queston, only one of the answers s correct.
More information