Dynamic Resource Allocation and Power Management in Virtualized Data Centers


 Nelson Norton
 2 years ago
 Views:
Transcription
1 Dynamc Resource Allocaton and Power Management n Vrtualzed Data Centers Rahul Urgaonkar, Ulas C. Kozat, Ken Igarash, Mchael J. Neely {kozat, Abstract We nvestgate optmal resource allocaton and power management n vrtualzed data centers wth tmevaryng workloads and heterogeneous applcatons. Pror work n ths area uses predcton based approaches for resource provsonng. In ths work, we take an alternate approach that makes use of the queueng nformaton avalable n the system to make onlne control decsons. Specfcally, we use the recently developed technque of Lyapunov Optmzaton to desgn an onlne admsson control, routng, and resource allocaton algorthm for a vrtualzed data center. Ths algorthm maxmzes a jont utlty of the average applcaton throughput and energy costs of the data center. Our approach s adaptve to unpredctable changes n the workload and does not requre estmaton and predcton of ts statstcs. Index Terms Data Center Automaton, Cloud Computng, Vrtualzaton, Resource Allocaton, Lyapunov Optmzaton I. INTRODUCTION There s growng nterest n mprovng the energy effcency of largescale enterprse data centers and cloud computng envronments. Recent studes [1] [2] ndcate that the costs assocated wth the power consumpton, coolng requrements, etc., of servers over ther lfetme are sgnfcant. As a result, there have been numerous works n the area of power management for such data centers (see [3] and references theren). At the data center level, applcaton consoldaton has been studed for reducng the total power consumpton. Vrtualzaton s a promsng technque that enables consoldaton of heterogeneous applcatons onto a fewer number of servers, whle ensurng secure colocaton between competng applcatons. Ths results n hgher resource utlzaton and reducton n energy costs (by turnng off extra servers). However, snce multple applcatons now contend for the same resource pool, t s mportant to develop schedulng algorthms that allocate resources n a far and effcent manner. At the ndvdual server level, technques such as Dynamc Voltage and Frequency Scalng, low power Pstates, etc. are avalable that allow a tradeoff between performance and power consumpton. Several recent works (e.g., [4] [5]) have studed the problem of dynamcally scalng the CPU speed for energy savngs. In ths work, we consder the problem of maxmzng a jont utlty of the longterm throughput of the hosted applcatons and the average total power expendture n a vrtualzed data center. Our formulaton unfes these two technques for power control under a common analytcal framework. Ths work was performed when Rahul Urgaonkar worked as a summer ntern at DOCOMO USA Labs. A 1 A 2 A/C 1 A/C 2 W 1 W 2 A N W N A/C M A/C : Admsson Controller for Applcaton R: Router R/C j: Resource Controller for Server j W : Router buffer for Applcaton U j : Buffer for Applcaton on Server j A : Request arrvals for Applcaton Fg. 1. R U 11 U 21 U N1 U 12 U 22 U N2 U 1M U 2M U NM Illustraton of the Vrtualzed Data Center Archtecture. II. RELATED WORK R/C 1 Server 1 R/C 2 Server 2 R/C M Server M Dynamc resource allocaton n vrtualzed data centers has been studed extensvely n recent years. The work n [6] [9] formulates ths as a feedback control problem and uses tools from adaptve control theory to desgn onlne control algorthms. Such technques use a closedloop control model where the objectve s to converge to a target performance level by takng control actons that try to mnmze the error between the measured output and the reference nput. Whle ths technque s useful as a trackng problem, t cannot be used for utlty maxmzaton problems where the target optmal value s unknown. Work n [10] consders the problem of maxmzng a jont utlty of the proft generated by satsfyng gven SLA and the power consumpton costs. Ths s formulated as a sequental optmzaton problem and solved usng lmted lookahead control. Ths approach requres buldng estmates of the future workloads. Much pror work on resource allocaton s based on predctonbased provsonng and steady state queueung models [11] [14]. Here, statstcal models
2 2 for the workloads are frst developed usng hstorcal traces offlne or va onlne learnng. Resource allocaton decsons are then made to satsfy such predcted demand. Ths approach s lmted by ts ablty to accurately predct future arrvals. In ths work, we do not take ths approach. Instead, we make use of the recently developed technque of Lyapunov Optmzaton [18] to desgn an onlne admsson control, routng, and resource allocaton algorthm for a vrtualzed data center. Ths algorthm makes use of the queueng nformaton avalable n the system to mplctly learn and adapt to unpredctable changes n the workload and does not requre estmaton and predcton of ts statstcs. The technque of Lyapunov Optmzaton has been used to develop throughput and energy optmal crosslayer control algorthms n tmevaryng wreless networks (see [18] and references). Ths technque has certan smlartes wth the feedback control based approach as t also uses a Lyapunov functon based analyss to desgn onlne control algorthms. In addton, ths technque also allows stablty and utlty optmzaton to be treated n the same framework. Unlke works that use steady state queueng models, ths approach takes nto account the full effects of the queueng dynamcs by makng use of the queue backlog nformaton to make onlne control decsons. III. BASIC VIRTUALIZED DATA CENTER MODEL We consder a vrtualzed data center wth M servers that host a set of N applcatons. The set of servers s denoted by S and the set of applcatons s denoted by A. Each server j S hosts a subset of the applcatons. It does so by provdng a vrtual machne () for every applcaton hosted on t. An applcaton may have multple nstances runnng across dfferent s n the data center. We defne the followng ndcator varables for {1, 2,..., N}, j {1, 2,..., M}: { 1 f applcaton s hosted on server j a j = 0 else For smplcty, n the basc model, we assume that a j = 1, j,.e., each server can host all applcatons. In general, applcatons may be multtered and the dfferent ters correspondng to an nstance of an applcaton may be located on dfferent servers and s. For smplcty, n the basc model we assume that each applcaton conssts of a sngle ter. These assumptons are relaxed n Sec. VI where we dscuss extensons to the multter as well as nhomogeneous hostng scenaro. We assume a tmeslotted system. Every slot, new requests arrve for each applcaton accordng to a random arrval process A that has a tme average rate λ requests/slot. Ths process s assumed to be ndependent of the current amount of unfnshed work n the system and has fnte second moment. However, we do not assume any knowledge of the statstcs of A. For example, A could be a Markovmodulated process wth tmevaryng nstantaneous rates where the transton probabltes between dfferent states are not known. Ths models a scenaro wth unpredctable and tmevaryng workloads. Power Consumpton (W) utlzaton 100% quadratc model utlzaton 50% quadratc model utlzaton 38% quadratc model CPU Frequency (GHz) Fg. 2. Power vs CPU frequency for a Dell PowerEdge R610 server. Also note the sgnfcant dle power. A. Control Archtecture Our control archtecture for the vrtualzed data center conssts of three components as shown n Fg. 1. Every slot, for each applcaton A, an Admsson Controller determnes whether to admt or declne the new requests. The requests that are admtted are stored n the Router buffer before beng routed to one of the servers hostng that applcaton by the Router. Each server j S has a set of resources W j (such as CPU, dsk, memory, network resources, etc.) that are allocated to the s hosted on t by ts Resource Controller. In practce, ths Resource Controller resdes on the host Operatng System (Dom0) of each vrtualzed server. The control optons avalable to the Resource Controller are dscussed n detal n Sec. IIIC. For smplcty, n the basc model, we assume that the sets W j contan only one resource. Specfcally, we focus on case where the CPU s the bottleneck resource. Ths can happen, for example, when all applcatons runnng on the servers are computatonally ntensve. Our formulaton can be extended to treat the multpleresource case by representng them as a vector of resources and approprately redefnng the control optons and expected servce rates. All servers n the data center are assumed to be resource constraned. Specfcally, n the basc model, we focus on CPU frequency and power constrants. Ths s dscussed n detal n the followng. B. CPU PowerFrequency Relatonshp Modern CPUs can be operated at dfferent speeds at runtme by usng technques such as Dynamc Frequency Scalng (DFS), Dynamc Voltage Scalng (DVS), or a combnaton Dynamc Voltage and Frequency Scalng (DVFS). These technques result n a nonlnear powerfrequency relatonshp. For example, Fg. 2 shows the power consumed by a Dell PowerEdge R610 server for dfferent operatng frequences and utlzaton levels. Ths curve was obtaned by runnng a CPU ntensve applcaton at dfferent CPU frequences and utlzaton levels and measurng the power consumpton. We observe that at each utlzaton level, the powerfrequency relatonshp s wellapproxmated by a quadratc model,.e.,
3 3 P(f) = P mn + α(f f mn ) 2. Smlar results have been observed n recent works [4]. In our model, we assume that CPUs follow a smlar nonlnear powerfrequency relatonshp that s known to the Resource Controllers. The CPUs can run at a fnte number of operatng frequences n an nterval [f mn, f max ] wth an assocated power consumpton [P mn, P max ]. Ths allows a tradeoff between performance and power costs. All servers n our model are assumed to have dentcal CPU resources. Addtonally, the servers may be operated n an nactve mode (such as Pstates, CPU hbernaton, or turnng OFF) n order to further save on energy costs. Ths can be advantageous f the workload s low. Indeed, we note from Fg. 2 that the mnmum power P mn requred to mantan the server n the actve state s typcally substantal. It can be as hgh as 65% of P max as reported n other works [1]. Therefore, turnng dle servers to OFF mode, or to some low power hbernaton state, can yeld sgnfcant savngs n power consumpton. Whle an nactve server does not consume any power, t also cannot provde any servce to the applcatons hosted on t. We thus assume that, n any slot, new requests can only be routed to actve servers. Inactve servers can be turned actve to handle ncreases n workload. Snce turnng servers ON/OFF frequently may be undesrable (for example, due to hardware relablty ssues), we wll focus on framebased control polces n whch tme s dvded nto frames of length T slots. The set of actve servers s chosen at the begnnng of each frame and s held fxed for the duraton of that frame. Ths set can potentally change n the next frame as workloads change. We note that whle ths control decson s taken at a slower tmescale, other resource allocatons decsons (such as admsson control, routng, CPU frequency scalng and resource allocaton at each actve server) are made every slot. The choce of an approprate value for T s an mplementaton ssue. We do not focus on optmzng ths parameter n ths work. The choce of T affects a complextyutlty tradeoff as dscussed n Sec. VB. C. Queueng Dynamcs and Control Decsons Let A denote the number of new request arrvals for applcaton n slot t. Let R be the number of requests out of A that are admtted nto the Router buffer for applcaton by the Admsson Controller. We denote ths buffer by W. We assume that any new request that s not admtted by the Admsson Controller s declned. Ths can easly be generalzed to the case where arrvals that are not mmedately accepted are stored n a buffer for future admsson decson. Thus, for all, t, we have: 0 R A (1) Let R j be the number of requests for applcaton that are routed from ts Router buffer to server j n slot t. Then the queueng dynamcs for W s gven by: W (t + 1) = W j R j + R (2) Let S denote the set of actve servers n slot t. For each applcaton, the admtted requests can only be routed to those servers that host applcaton and are actve n slot t. Thus, the routng decsons R j must satsfy the followng constrants every slot: R j = 0 f j / S or a j = 0 (3) 0 a j R j W (4) j S Every slot, the Resource Controller allocates the resources of each server among the s that host the applcatons runnng on that server. Ths allocaton s subject to the avalable control optons. For example, the Resource Controller may allocate dfferent fractons of the CPU (or dfferent number of cores n case of multcore processors) to the s n that slot. 1 The Resource Controller may also use avalable technques such as DFS, DVS, DVFS, etc. to modulate the current CPU speed whch affects the CPU power consumpton. We use I j to denote the set of all such control optons avalable at server j. Ths ncludes the opton of makng server j nactve (so that no power s consumed) f the current slot s the begnnng of a new frame. Let I j I j denote the partcular control decson taken at server j n slot t under any polcy and let P j be the correspondng power consumpton. Then, the queueng dynamcs for the requests of applcaton at server j follows: U j (t + 1) = max[u j µ j (I j ), 0] + R j (5) where µ j (I j ) denotes the servce rate (n unts of requests/slot) provded to applcaton on server j n slot t by takng control acton I j. We assume that, for each applcaton, the expected value of ths servce rate as a functon of the control acton I j s known for all I j I j. Ths can be obtaned by applcaton proflng and applcaton modelng technques (e.g., [15] [16]). It s mportant to note that we do not need to mplement the dynamc (5). We wll only requre a measure of the current backlog and knowledge of the expected servce rate as a functon of control decsons to mplement our control algorthm. Thus, n every slot t, a control polcy needs to make the followng decsons: 1) If t = nt (.e., begnnng of a new frame), determne the new set of actve servers S. Else, contnue usng the actve set already computed for the current frame. 2) Admsson control decsons R for all applcatons. 3) Routng decsons R j for the admtted requests. 4) Resource allocaton decson I j at each actve server (ths ncludes selectng the CPU frequency that affects the power consumpton P j as well as CPU resource dstrbuton among dfferent s). Our goal s to desgn an onlne control polcy that maxmzes a jont utlty of the sum throughput of the applcatons and the energy costs of the servers subject to the avalable control optons and the structural constrants mposed by ths 1 Addtonal constrants such as allocatng a mnmum amount of CPU share to all actve s can be ncluded n ths model.
4 4 model. It s desrable to develop a flexble and robust resource allocaton algorthm that automatcally adapts to tmevaryng workloads. In ths work, we wll use the technque of Lyapunov Optmzaton [18] to desgn such an algorthm. IV. CONTROL OBJECTIVE Consder any polcy η for ths model that takes control decsons S η, R η, Rη j, Iη j I j, P η j for all, j n slot t. Note that under any feasble polcy η, these control decsons must satsfy the admsson control constrant (1), routng constrants (3), (4), and the resource allocaton constrant I j I j every slot for all, j. Let r η denote the tme average expected rate of admtted requests for applcaton under polcy η,.e., r η = lm 1 t 1 E {R η t (τ)} (6) t τ=0 Let r = (r 1,...,r N ) denote the vector of these tme average rates. Smlarly, let e η j denote the tme average expected power consumpton of server j under polcy η: t 1 e η 1 j= lm t t τ=0 E { P η j (τ)} (7) The expectatons above are wth respect to the possbly randomzed control actons that polcy η mght take. Let α and β be a collecton of nonnegatve weghts. Then our objectve s to desgn a polcy η that solves the followng stochastc optmzaton problem: Maxmze: Subject to: e η j α r η β A j S 0 r η λ A I η j I j j S, t r Λ (8) Here, Λ represents the capacty regon of the data center model as descrbed above. It s defned as the set of all possble longterm throughput values that can be acheved under any feasble resource allocaton strategy. The objectve n problem (8) s a general weghted lnear combnaton of the sum throughput of the applcatons and the average power usage n the data center. Ths formulaton allows us to consder several scenaros. Specfcally, t allows the desgn of polces that are adaptve to tmevaryng workloads. For example, f the current workload s nsde the nstantaneous capacty regon, then ths objectve encourages scalng down the nstantaneous capacty (by runnng CPUs at slower speeds and/or turnng OFF some actve servers) to acheve energy savngs. Smlarly, f the current workload s outsde the nstantaneous capacty regon, then ths objectve encourages scalng up the nstantaneous capacty (by runnng CPUs at faster speeds and/or turnng ON some nactve servers). Fnally, f the workload s so hgh that t cannot be supported by usng all avalable resources, ths objectve allows prortzaton among dfferent applcatons. Furthermore, t allows us to assgn prortes between throughput and energy by choosng approprate values of α, β. A. Optmal Statonary, Randomzed Polcy Problem (8) s smlar to the general stochastc network utlty maxmzaton problem presented n [18] n the context of wreless networks wth tmevaryng channels. Suppose (8) s feasble and let r and e j, j denote the optmal value of the objectve functon, potentally acheved by some arbtrary polcy. Usng the technques developed n [17], [18], t can be shown that to solve (8) and acheve the optmal value of the objectve functon, t s suffcent to consder only the class of statonary, randomzed polces that take control decsons ndependent of the current queue backlog every slot. Specfcally, at the begnnng of each frame, ths polcy chooses an actve set of servers accordng to a statonary dstrbuton n an..d. fashon. Once chosen, other control decsons are lkewse taken n an..d. fashon accordng to statonary dstrbutons. For the basc model of Sec. III wth homogeneous applcaton hostng and dentcal CPU resources, n choosng an actve server set, we do not need to consder all possble subsets of S. Specfcally, we defne the followng collecton O of subsets of S: { } O=, {1}, {1, 2}, {1, 2, 3},..., {1, 2, 3,..., M} (9) Then we have the followng. For brevty, we state ths fact here wthout proof: Fact 1: (Optmal Statonary, Randomzed Polcy) For any arrval rate vector (λ 1,...,λ N ) (nsde or outsde of the data center capacty regon Λ), there exsts a framebased statonary randomzed control polcy that chooses actve sets from O every frame, makes admsson control, routng and resource allocaton decsons every slot ndependent of the queue backlog and yelds the followng steady state values: 1 lm t t t 1 [ τ=0 A α E {R (τ)} β j S ] E {P j (τ)} = α r β e j (10) A j S However, computng the optmal statonary, randomzed polcy explctly can be challengng and ts mplementaton mpractcal as t requres knowledge of all system parameters (lke workload statstcs) as well as the capacty regon n advance. Even f ths polcy can be computed for a gven workload, t would not be adaptve to unpredctable changes n the workload and must be recomputed. In the next secton, we wll present an onlne control algorthm that overcomes these challenges. V. OPTIMAL CONTROL ALGORITHM In ths secton, we use the framework of Lyapunov Optmzaton to develop an optmal control algorthm for our model. Specfcally, we present a dynamc control algorthm that can be shown to acheve the optmal soluton r and, j to the stochastc optmzaton problem (8). Ths e j
5 5 algorthm s smlar n sprt to the backpressure algorthms proposed n [17], [18] for problems of throughput and energy optmal networkng n tme varyng wreless networks. A. Data Center Control Algorthm (DCA) Let V 0 be a control parameter that s nput to the algorthm. Ths parameter s chosen by the system admnstrator and allows a utltydelay tradeoff as dscussed later n Sec. VB. Approprate choce of ths parameter depends on the partcular system as well as the desred tradeoff between performance and power cost. Ths parameter may also be vared over tme to affect ths tradeoff. Let W, U j, j be the queue backlog values n slot t. These are ntalzed to 0. Every slot, the DCA algorthm uses the backlog values n that slot to make jont Admsson Control, Routng and Resource Allocaton decsons. As the backlog values evolve over tme accordng to the dynamcs (2) and (5), the control decsons made by DCA adapt to these changes. However, we note that ths s mplemented usng knowledge of current backlog values only and does not rely on knowledge of statstcs governng future arrvals. Thus, DCA solves for the objectve n (8) by mplementng a sequence of optmzaton problems over tme. The queue backlogs themselves can be vewed as dynamc Lagrange multplers that enable stochastc optmzaton [18]. The DCA algorthm operates as follows. Admsson Control: For each applcaton, choose the number of new requests to admt R as the soluton to the followng problem: Maxmze: R [V α W ] Subject to: 0 R A (11) Ths problem has a smple thresholdbased soluton. In partcular, f the current Router buffer backlog for applcaton, W > V α, then R = 0 and no new requests are admtted. Else, f W V α, then R = A and all new requests are admtted. Note that ths admsson control decson can be performed separately for each applcaton. Routng and Resource Allocaton: Let S be the actve server set for the current frame. If t nt, then we contnue to use the same actve set. The Routng and Resource Allocaton decsons are gven as follows: Routng: Gven an actve server set, routng follows a smple Jon the Shortest Queue polcy. Specfcally, for any applcaton, let j S be the actve server wth the smallest queue backlog U j. If W > U j, then R j = W,.e., all requests n the Router buffer for applcaton are routed to server j. Else, R j = 0 j and no requests are routed to any server for applcaton. In order to make these decsons, the Router requres the queue backlog nformaton U j, j. Gven ths nformaton, we note that ths routng decson can be performed separately for each applcaton. Resource Allocaton: At each actve server j S, choose a resource allocaton I j that solves the followng problem: Maxmze: U j E {µ j (I j )} V βp j Subject to: I j I j, P j P mn (12) The above problem s a generalzed maxweght problem where the servce rate provded to any applcaton s weghted by ts current queue backlog. Thus, the optmal soluton would allocate resources so as to maxmze the servce rate of the most backlogged applcaton. The complexty of ths problem depends on the sze of the control optons I j avalable at server j. In practce, the number of control optons such as avalable DVFS states, CPU shares, etc. s small and thus, the above optmzaton can be mplemented n real tme. It s mportant to note that each server solves ts own resource allocaton problem ndependently usng the queue backlog values of applcatons hosted on t and ths can be mplemented n a fully dstrbuted fashon. If t = nt, then a new actve set S for the current frame s determned by solvng the followng: S =argmax S O [ U j E {µ j (I j )} V β j j ] R j (W U j ) + j P j subject to: j S, I j I j, P j P mn constrants (1), (3), (4) (13) The above optmzaton can be understood as follows. To determne the optmal actve set S, the algorthm computes the optmal cost for the expresson wthn the brackets for every possble actve server set n the collecton O. Gven an actve set, the above maxmzaton s separable nto Routng decsons for each applcaton and Resource Allocaton decsons at each actve server. Ths computaton s easly performed usng the procedure descrbed earler for Routng and Resource Allocaton when t nt. Snce O has sze M, the worstcase complexty of ths step s polynomal n M. However, the computaton can be sgnfcantly smplfed as follows. It can be shown that f the maxmum queue backlog over all applcatons on any server j exceeds a fnte constant U thresh, then that server must be part of the actve set. Thus, only those subsets of O that contan these servers need to be consdered when searchng for the optmal actve set. We note that t s possble for ths algorthm to nactvate certan servers even f they have nonzero queue backlog (and process t later when the server s actvated agan). Ths can happen, for example, f the backlog on the server s small and the optmzaton (13) determnes that the energy cost of keepng the server ON (the second term) exceeds the weghted servce rate acheved (the frst term). Whle we can show optmalty of ths algorthm n terms of solvng the objectve (8), we also consder a more practcal (and potentally suboptmal) strategy DCAM that mgrates or reroutes such unfnshed
6 6 requests from nactve servers to other actve servers n the next frame. Our smulaton results n Sec. VII suggest that the performance of ths strategy s very close to that under DCA. Fnally, the computaton n (13) requres knowledge of the values of queue backlogs at all servers as well as the router buffers. Ths can be mplemented by a centralzed controller (that also mplements Routng) that perodcally gathers the backlog nformaton and determnes the actve set for each frame. B. Performance Analyss Theorem 1: (Algorthm Performance) Assume that all queues are ntalzed to 0. Suppose all arrvals n a slot A..d. and are upper bounded by fnte constants so that A A max for all, t. Also let µ max be the maxmum servce rate (n requests/slot) over all applcatons n any slot. Then, mplementng the DCA algorthm every slot for any fxed control parameter V 0 and frame sze T yelds the followng performance bounds: 1) The worst case queue backlog for each applcaton Router buffer W s upper bounded by a fnte constant W max for all t: W W max =V α + A max (14) Smlarly, the worst case queue backlog for applcaton on any server j s upper bounded by 2W max for all, t: U j 2W max = 2(V α + A max ) (15) 2) The tme average utlty acheved by the DCA algorthm s wthn BT/V of the optmal value: lm nf t 1 t t 1 [ τ=0 ] E {P j (τ)} E {R (τ)} β Aα j S r Aα β e j BT V j S (16) where B s a fnte constant (defned precsely n (18)) that depends on the second moments of the arrval and servce processes. We note that the performance bounds above are qute strong. In partcular, part (1) establshes determnstc worst case bounds on the maxmum backlogs n the system at all tmes. Therefore, by part (2) of the theorem, the acheved average utlty s wthn O(1/V ) of the optmal value. Ths can be pushed arbtrarly close to the optmal value by ncreasng the control parameter V. However, ths ncreases the maxmum queue backlog bound (14), (15) lnearly n V, leadng to a utltydelay tradeoff. We next prove the frst part of Theorem 1. Proof of part (2) uses the technque of Lyapunov Optmzaton [18] and s provded n the Appendx. Proof of part (1): Suppose that W W max for all for some tme t. Ths s true for t = 0 as all queues are ntalzed to 0. We show that the same holds for tme t + 1. We have 2 cases. If W W max A max, then from (2), we have W (t+1) W max (because R A max for all t). Else, f W > W max A max, then W > V α +A max A max = V α. Then, the flow control part of the algorthm chooses R = 0, so that by (2): W (t + 1) W W max Ths proves (14). To prove (15), note that new requests are routed from a Routng buffer W to an applcaton queue U j only when W > U j. Snce W W max and snce the maxmum number of arrvals n a slot to U j s, U j cannot exceed 2W max. W max VI. EXTENSIONS In ths secton, we brefly dscuss two extensons to the basc model of Sec. III. A. Inhomogeneous Applcaton Placement and CPU Resources In ths case, the a j varables need not be equal to 1, j so that requests for an applcaton can only be routed to one of those servers that hosts ths applcaton. The routng constrants n (3), (4) are already general enough to capture ths. In the case of nhomogeneous CPU resources, the DCA algorthm needs the followng modfcaton. In the actve server determnaton step, nstead of only searchng over the collecton O of subsets n (9), now t may have to search over all possble subsets of S. Ths can be computatonally ntensve when S s large. It s possble to tradeoff complexty for utlty optmalty by resortng to suboptmum heurstc approaches, nvestgaton of whch s left out for brevty n ths paper. B. Multter Applcatons Modern enterprse applcatons typcally have multple components workng n a tered structure [16] [11]. An ncomng request for such a multter applcaton s servced by each ter n a certan order before departng the system. Our framework can be extended to treat ths scenaro by modelng the multter applcaton as a network of queues. Specfcally, we defne U (k) j as the queue backlog for the kth ter of applcaton on server j. Then, the queueng dynamcs for U (k) are gven by: U (k) j (t + 1) = max[u(k) j µ(k) j (I j), 0] + j l S R (k 1) l where R (k 1) l denotes the arrvals to U (k) j from the (k 1) th ter of applcaton on server l. Usng the framework presented n the prevous sectons, DCA can be extended to treat such multter scenaros. VII. SIMULATIONS We smulate the DCA and DCAM algorthms n an example vrtualzed data center consstng of 100 servers and hostng 10 applcatons. Each applcaton s CPU ntensve and receves requests exogenously accordng to a random arrval process of rate λ. In the smulaton setup, each CPU s assumed to follow a quadratc powerfrequency relatonshp smlar to the expermentally obtaned quadratc powerfrequency curve n Fg. 2. Specfcally, each CPU s assumed
7 7 3 x Average Total Utlty DCA gamma 0.75 DCA M gamma 0.75 DCA gamma 1.0 DCA M gamma 1.0 DCA gamma 2.0 DCA M gamma 2.0 Average Delay of Admtted Requests DCA gamma 0.75 DCA M gamma 0.75 DCA gamma 1.0 DCA M gamma 1.0 DCA gamma 2.0 DCA M gamma V V Fg. 3. Average total utlty vs V for dfferent values of γ. Fg. 4. Average delay of admtted requests vs V for dfferent values of γ. to have a dscrete set of frequency optons n the nterval [1.6GHz,..., 2.6GHz] at ncrements of 0.2 GHz and the correspondng power consumpton (n Watts) at frequency f s gven by P mn + θ(f 1.6GHz) 2 where P mn = 120W and θ = 120W/(GHz) 2. Thus, the CPU power consumpton at the hghest frequency s 240W. We assume that half of the servers n the data center are always ON and that decsons to dynamcally turn servers ON/OFF are appled to the remanng servers. Note that the dynamc operatng frequency decsons are stll appled to all servers. The frame sze T = 1000 slots and the smulatons were run for one mllon slots. The number of new requests generated for an applcaton n a slot s assumed to be unformly and randomly dstrbuted n [0, 2λ ]. On average, a server runnng at the mnmum (maxmum) speed can process 200 (400) requests/slot. In the smulatons, the throughput utlty weghts are chosen to be equal for all applcatons, so that α = α. In the frst experment, we fx the nput rate λ = 2000 requests/slot for all applcatons and smulate the DCA and DCAM algorthms for dfferent choces of the rato γ = α/β. Fgs. 3 shows the total average utlty for dfferent values of the nput parameter V under the two control algorthms. We observe that the performance of DCAM s very close to DCA. Further, the total average utlty acheved ncreases wth V and converges to a maxmum value for larger values of V as predcted by (16). Fg. 4 plots the average delay of the admtted requests vs V. It can be seen that the average delay ncreases lnearly wth V as predcted by the bounds n (14), (15). Fg. 5 shows the fracton of declned requests vs V under both algorthms. Ths, along wth Fgs. 3 and 4 shows the O(1/V, V ) utltydelay tradeoff offered by the DCA algorthm where the average utlty acheved can be pushed closer to the optmal value wth a tradeoff n terms of a lnear ncrease n average delay. In the second experment, we fx the parameters V = 5000, γ = 1.0 and consder the scenaro where the nput rate changes n an unpredctable manner. Specfcally, for the frst 1/3 of the smulaton nterval, the nput rate λ = 1000 requests/slot for all applcatons. Then the nput rate abruptly ncreases to 3000 requests/slot before droppng to 2000 requests/slot n the last 1/3 of the smulaton nterval. In Fg. 6, we plot the number of actve servers vs. frame number under the DCA algorthm. It can be seen that the algorthm quckly adapts to the new workload by ncreasng or decreasng the number of actve servers (and hence the nstantaneous capacty) even when the workload changes n an unpredctable manner. VIII. CONCLUSIONS AND FUTURE WORK In ths paper, we consdered the problem of dynamc resource allocaton and power management n vrtualzed data centers. Pror work n ths area uses predcton based approaches for resource provsonng. In ths work, we have used an alternate approach that makes use of the queueng nformaton avalable n the system to make onlne control decsons. Ths approach s adaptve to unpredctable changes n workload and does not requre estmaton and predcton of ts statstcs. Our approach uses the recently developed technque of Lyapunov Optmzaton that allows us to derve analytcal performance guarantees of the algorthm. The man focus of ths work was on buldng an analytcal framework. As part of future work, we plan to have real system mplementaton of our algorthm and use standard benchmark workloads and applcatons to evaluate ts performance. APPENDIX A PROOF OF THEOREM 1 PART (2) Here, we prove part (2) of Theorem 1 usng the technque of Lyapunov Optmzaton [18]. Ths technque nvolves constructng an approprate Lyapunov functon of the queue backlogs n the system, defnng the condtonal Lyapunov drft of ths functon, and then developng a dynamc algorthm that mnmzes ths drft over all control polces. The performance bounds for ths algorthm are obtaned by comparng the Lyapunov drft of ths wth that of the backlog ndependent optmal statonary, randomzed polcy descrbed n Sec. IVA. Let Q = (U 11,..., U NM, W 1,..., W M ) represent the collecton of all queue backlogs n the system. We defne the followng Lyapunov functon: L(Q) = 1 [ Uj ] W 2 A,j S A
8 DCA gamma 0.75 DCA M gamma 0.75 DCA gamma 1.0 DCA M gamma 1.0 DCA gamma 2.0 DCA M gamma Fracton of Requests Declned Number of Actve Servers V Frame Number Fg. 5. Fracton of declned requests vs V for dfferent values of γ. Fg. 6. Number of actve servers over tme. Defne the condtonal Lyapunov drft (Q) as follows: (Q) =E {L(Q(t + 1)) L(Q) Q} Usng queueng dynamcs (2) and (5), the condtonal Lyapunov drft under any control polcy (ncludng DCA) can be computed as follows: B j where B = U j E {µ j (I j ) R j Q} W E R j R Q (17) j (Amax ) 2 + NMµ 2 max 2 (18) For a gven control parameter V 0, we subtract the reward metrc V E{ α R β } j P j Q from both sdes of the drft nequalty (17) and rearrange the terms to get the followng: V E α R β P j Q B j j j U j E {µ j (I j ) Q} + V β j E {R j (W U j ) Q} E {P j Q} E {R (V α W Q} (19) From the above, t can be seen that the dynamc control algorthm DCA descrbed n Sec. VA s desgned to take Admsson Control, Routng and Resource Allocaton decsons that mnmze the rght hand sde of (19) over all possble optons, ncludng the statonary polcy of Sec. IVA. Theorem 1 part (2) can now be shown usng a drect applcaton of the Lyapunov Optmzaton Theorem (see Theorem 5.4 n [18]) along wth a T slot delayed Lyapunov analyss. 2 REFERENCES [1] A. Greenberg, J. Hamlton, D. A. Maltz, and P. Patel. The cost of a cloud: research problems n data center networks. ACM SIGCOMM Computer Communcaton Revew, vol. 39, no. 1, Jan [2] X. Fan, W. Weber, and L. Borroso. Power provsonng for a warehouseszed computer. In Proceedngs of ISCA, June [3] R. Raghavendra, P. Ranganathan, V. Talwar, Z. Wang, and X. Zhu. No power struggles: coordnated multlevel power management for the data center. In Proceedngs of ASPLOS, March [4] A. Gandh, M. HarcholBalter, R. Das, and C. Lefurgy. Optmal power allocaton n server farms. In Proceedngs of SIGMETRICS, June [5] A. Werman, L. L. H. Andrew, and A. Tang. Poweraware speed scalng n processor sharng systems. In Proceedngs of INFOCOM, Aprl [6] P. Padala, KY. Hou, K. G. Shn, X. Zhu, M. Uysal, Z. Wang, S. Snghal, and A. Merchant. Automatc control of multple vrtualzed resources. In Proceedngs of EuroSys, Aprl [7] P. Padala, K. G. Shn, X. Zhu, M. Uysal, Z. Wang, S. Snghal, A. Merchant, and K. Salem. Adaptve control of vrtualzed resources n utlty computng envronments. In Proceedngs of EuroSys, March [8] X. Zhu, M. Uysal, Z. Wang, S. Snghal, A. Merchant, P. Padala, and K. G. Shn. What does control theory brng to systems research? ACM SIGOPS Operatng Systems Revew, vol. 43, no. 1, Jan [9] X. Lu, X. Zhu, P. Padala, Z. Wang, and S. Snghal. Optmal multvarate control for dfferentated servces on a shared hostng platform. In Proceedngs of CDC, Dec [10] D. Kusc and N. Kandasamy. Power and performance management of vrtualzed computng envronments va lookahead control. In Proceedngs of ICAC, June [11] X. Wang, D. Lan, X. Fang, M. Ye, and Y. Chen. A resource management framework for multter servce delvery n autonomc vrtualzed envronments. In Proceedngs of NOMS, Aprl [12] S. Govndan, J. Cho, B. Urgaonkar, A. Svasubramanam, and A. Baldn. Statstcal proflngbased technques for effectve power provsonng n data centers. In Proceedngs of EuroSys, Aprl [13] Y. Chen, A. Das, W Qn, A. Svasubramanam, Q. Wang, and N. Gautam. Managng server energy and operatonal costs n hostng centers. In Proceedngs of SIGMETRICS, June [14] J. S. Chase, D. C. Anderson, P. N. Thakur, A. M. Vahdat, and R. P. Doyle. Managng enrgy and server resources n hostng centers. In Proceedngs of SOSP, Oct [15] B. Urgaonkar, P. Shenoy, and T. Roscoe. Resource overbookng and applcaton proflng n shared hostng platforms. In Proceedngs of OSDI, Dec [16] B. Urgaonkar, G. Pacfc, P. Shenoy, M. Spretzer, and A. Tantaw. An analytcal model for multter nternet servces and ts applcatons. In Proceedngs of SIGMETRICS, June [17] M. J. Neely. Energy optmal control for tme varyng wreless networks. IEEE Transactons on Informaton Theory, vol. 52, no. 7, pp , July [18] L. Georgads, M. J. Neely, L. Tassulas. Resource allocaton and crosslayer control n wreless networks. Foundatons and Trends n Networkng, vol. 1, no. 1, pp , detals omtted for brevty.
Communication 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 informationFault 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 Lyapunov Optimization Approach to Repeated Stochastic Games
PROC. ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING, OCT. 2013 1 A Lyapunov Optmzaton Approach to Repeated Stochastc Games Mchael J. Neely Unversty of Southern Calforna http://wwwbcf.usc.edu/
More information2. SYSTEM MODEL. the SLA (unlike the only other related mechanism [15] we can compare it is never able to meet the SLA).
Managng Server Energy and Operatonal Costs n Hostng Centers Yyu Chen Dept. of IE Penn State Unversty Unversty Park, PA 16802 yzc107@psu.edu Anand Svasubramanam Dept. of CSE Penn State Unversty Unversty
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 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 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 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 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 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 informationSupport Vector Machines
Support Vector Machnes Max Wellng Department of Computer Scence Unversty of Toronto 10 Kng s College Road Toronto, M5S 3G5 Canada wellng@cs.toronto.edu Abstract Ths s a note to explan support vector machnes.
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 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 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 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 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 informationINVESTIGATION OF VEHICULAR USERS FAIRNESS IN CDMAHDR NETWORKS
21 22 September 2007, BULGARIA 119 Proceedngs of the Internatonal Conference on Informaton Technologes (InfoTech2007) 21 st 22 nd September 2007, Bulgara vol. 2 INVESTIGATION OF VEHICULAR USERS FAIRNESS
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 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 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 informationNetwork Aware LoadBalancing via Parallel VM Migration for Data Centers
Network Aware LoadBalancng va Parallel VM Mgraton for Data Centers KunTng Chen 2, Chen Chen 12, PoHsang Wang 2 1 Informaton Technology Servce Center, 2 Department of Computer Scence Natonal Chao Tung
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 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 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 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 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 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 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 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 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 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 informationCLoud computing technologies have enabled rapid
1 CostMnmzng Dynamc Mgraton of Content Dstrbuton Servces nto Hybrd Clouds Xuana Qu, Hongxng L, Chuan Wu, Zongpeng L and Francs C.M. Lau Department of Computer Scence, The Unversty of Hong Kong, Hong Kong,
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 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 information1. Fundamentals of probability theory 2. Emergence of communication traffic 3. Stochastic & Markovian Processes (SP & MP)
6.3 /  Communcaton Networks II (Görg) SS20  www.comnets.unbremen.de Communcaton Networks II Contents. Fundamentals of probablty theory 2. Emergence of communcaton traffc 3. Stochastc & Markovan Processes
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 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 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 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 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 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 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 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 informationCredit Limit Optimization (CLO) for Credit Cards
Credt Lmt Optmzaton (CLO) for Credt Cards Vay S. Desa CSCC IX, Ednburgh September 8, 2005 Copyrght 2003, SAS Insttute Inc. All rghts reserved. SAS Propretary Agenda Background Tradtonal approaches to credt
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 informationCalculation of Sampling Weights
Perre Foy Statstcs Canada 4 Calculaton of Samplng Weghts 4.1 OVERVIEW The basc sample desgn used n TIMSS Populatons 1 and 2 was a twostage stratfed cluster desgn. 1 The frst stage conssted of a sample
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 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 information行 政 院 國 家 科 學 委 員 會 補 助 專 題 研 究 計 畫 成 果 報 告 期 中 進 度 報 告
行 政 院 國 家 科 學 委 員 會 補 助 專 題 研 究 計 畫 成 果 報 告 期 中 進 度 報 告 畫 類 別 : 個 別 型 計 畫 半 導 體 產 業 大 型 廠 房 之 設 施 規 劃 計 畫 編 號 :NSC 962628E009026MY3 執 行 期 間 : 2007 年 8 月 1 日 至 2010 年 7 月 31 日 計 畫 主 持 人 : 巫 木 誠 共 同
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 informationRetailers must constantly strive for excellence in operations; extremely narrow profit margins
Managng a Retaler s Shelf Space, Inventory, and Transportaton Gerard Cachon 300 SH/DH, The Wharton School, Unversty of Pennsylvana, Phladelpha, Pennsylvana 90 cachon@wharton.upenn.edu http://opm.wharton.upenn.edu/cachon/
More informationAnalysis of EnergyConserving Access Protocols for Wireless Identification Networks
From the Proceedngs of Internatonal Conference on Telecommuncaton Systems (ITC97), March 223, 1997. 1 Analyss of EnergyConservng Access Protocols for Wreless Identfcaton etworks Imrch Chlamtac a, Chara
More informationMinimal Coding Network With Combinatorial Structure For Instantaneous Recovery From Edge Failures
Mnmal Codng Network Wth Combnatoral Structure For Instantaneous Recovery From Edge Falures Ashly Joseph 1, Mr.M.Sadsh Sendl 2, Dr.S.Karthk 3 1 Fnal Year ME CSE Student Department of Computer Scence Engneerng
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 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 informationEnergy Efficient Routing in Ad Hoc Disaster Recovery Networks
Energy Effcent Routng n Ad Hoc Dsaster Recovery Networks Gl Zussman and Adran Segall Department of Electrcal Engneerng Technon Israel Insttute of Technology Hafa 32000, Israel {glz@tx, segall@ee}.technon.ac.l
More informationRecurrence. 1 Definitions and main statements
Recurrence 1 Defntons and man statements Let X n, n = 0, 1, 2,... be a MC wth the state space S = (1, 2,...), transton probabltes p j = P {X n+1 = j X n = }, and the transton matrx P = (p j ),j S def.
More informationAvailabilityBased Path Selection and Network Vulnerability Assessment
AvalabltyBased Path Selecton and Network Vulnerablty Assessment Song Yang, Stojan Trajanovsk and Fernando A. Kupers Delft Unversty of Technology, The Netherlands {S.Yang, S.Trajanovsk, F.A.Kupers}@tudelft.nl
More informationOn the Interaction between Load Balancing and Speed Scaling
On the Interacton between Load Balancng and Speed Scalng Ljun Chen, Na L and Steven H. Low Engneerng & Appled Scence Dvson, Calforna Insttute of Technology, USA Abstract Speed scalng has been wdely adopted
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 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 informationSelfAdaptive Capacity Management for MultiTier Virtualized Environments
SelfAdaptve Capacty Management for MultTer Vrtualzed Envronments Ítalo Cunha, Jussara Almeda, Vrgílo Almeda, Marcos Santos Computer Scence Department Federal Unversty of Mnas Geras Belo Horzonte, Brazl,
More informationOutsourcing inventory management decisions in healthcare: Models and application
European Journal of Operatonal Research 154 (24) 271 29 O.R. Applcatons Outsourcng nventory management decsons n healthcare: Models and applcaton www.elsever.com/locate/dsw Lawrence Ncholson a, Asoo J.
More informationOn the Interaction between Load Balancing and Speed Scaling
On the Interacton between Load Balancng and Speed Scalng Ljun Chen and Na L Abstract Speed scalng has been wdely adopted n computer and communcaton systems, n partcular, to reduce energy consumpton. An
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 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 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 informationFormulating & Solving Integer Problems Chapter 11 289
Formulatng & Solvng Integer Problems Chapter 11 289 The Optonal Stop TSP If we drop the requrement that every stop must be vsted, we then get the optonal stop TSP. Ths mght correspond to a ob sequencng
More informationM3S MULTIMEDIA MOBILITY MANAGEMENT AND LOAD BALANCING IN WIRELESS BROADCAST NETWORKS
M3S MULTIMEDIA MOBILITY MANAGEMENT AND LOAD BALANCING IN WIRELESS BROADCAST NETWORKS Bogdan Cubotaru, GabrelMro Muntean Performance Engneerng Laboratory, RINCE School of Electronc Engneerng Dubln Cty
More informationtaposh_kuet20@yahoo.comcsedchan@cityu.edu.hk rajib_csedept@yahoo.co.uk, alam_shihabul@yahoo.com
G. G. Md. Nawaz Al 1,2, Rajb Chakraborty 2, Md. Shhabul Alam 2 and Edward Chan 1 1 Cty Unversty of Hong Kong, Hong Kong, Chna taposh_kuet20@yahoo.comcsedchan@ctyu.edu.hk 2 Khulna Unversty of Engneerng
More informationLinear Regression, Regularization BiasVariance Tradeoff
HTF: Ch3, 7 B: Ch3 Lnear Regresson, Regularzaton BasVarance Tradeoff Thanks to C Guestrn, T Detterch, R Parr, N Ray 1 Outlne Lnear Regresson MLE = Least Squares! Bass functons Evaluatng Predctors Tranng
More informationCALL ADMISSION CONTROL IN WIRELESS MULTIMEDIA NETWORKS
CALL ADMISSION CONTROL IN WIRELESS MULTIMEDIA NETWORKS Novella Bartoln 1, Imrch Chlamtac 2 1 Dpartmento d Informatca, Unverstà d Roma La Sapenza, Roma, Italy novella@ds.unroma1.t 2 Center for Advanced
More informationControltheoretical loadbalancing for cloud applications with brownout
Controltheoretcal loadbalancng for cloud applcatons wth brownout Jonas Dürango, Manfred Dellkrantz, Martna Maggo, Crstan Klen 2, Alessandro Vttoro Papadopoulos, Francsco HernándezRodrguez 2, Erk Elmroth
More informationNasdaq Iceland Bond Indices 01 April 2015
Nasdaq Iceland Bond Indces 01 Aprl 2015 Fxed duraton Indces Introducton Nasdaq Iceland (the Exchange) began calculatng ts current bond ndces n the begnnng of 2005. They were a response to recent changes
More informationJoint Resource Allocation and BaseStation. Assignment for the Downlink in CDMA Networks
Jont Resource Allocaton and BaseStaton 1 Assgnment for the Downlnk n CDMA Networks Jang Won Lee, Rav R. Mazumdar, and Ness B. Shroff School of Electrcal and Computer Engneerng Purdue Unversty West Lafayette,
More information9.1 The Cumulative Sum Control Chart
Learnng Objectves 9.1 The Cumulatve Sum Control Chart 9.1.1 Basc Prncples: Cusum Control Chart for Montorng the Process Mean If s the target for the process mean, then the cumulatve sum control chart s
More informationMultiResource Fair Allocation in Heterogeneous Cloud Computing Systems
1 MultResource Far Allocaton n Heterogeneous Cloud Computng Systems We Wang, Student Member, IEEE, Ben Lang, Senor Member, IEEE, Baochun L, Senor Member, IEEE Abstract We study the multresource allocaton
More informationDistributed Optimal Contention Window Control for Elastic Traffic in Wireless LANs
Dstrbuted Optmal Contenton Wndow Control for Elastc Traffc n Wreless LANs Yalng Yang, Jun Wang and Robn Kravets Unversty of Illnos at UrbanaChampagn { yyang8, junwang3, rhk@cs.uuc.edu} Abstract Ths paper
More informationAn EnergyEfficient Data Placement Algorithm and Node Scheduling Strategies in Cloud Computing Systems
2nd Internatonal Conference on Advances n Computer Scence and Engneerng (CSE 2013) An EnergyEffcent Data Placement Algorthm and Node Schedulng Strateges n Cloud Computng Systems Yanwen Xao Massve Data
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 informationCooperative Load Balancing in IEEE 802.11 Networks with Cell Breathing
Cooperatve Load Balancng n IEEE 82.11 Networks wth Cell Breathng Eduard Garca Rafael Vdal Josep Paradells Wreless Networks Group  Techncal Unversty of Catalona (UPC) {eduardg, rvdal, teljpa}@entel.upc.edu;
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 informationdenote the location of a node, and suppose node X . This transmission causes a successful reception by node X for any other node
Fnal Report of EE359 Class Proect Throughput and Delay n Wreless Ad Hoc Networs Changhua He changhua@stanford.edu Abstract: Networ throughput and pacet delay are the two most mportant parameters to evaluate
More informationOnline Advertisement, Optimization and Stochastic Networks
Onlne Advertsement, Optmzaton and Stochastc Networks Bo (Rambo) Tan and R. Srkant Department of Electrcal and Computer Engneerng Unversty of Illnos at UrbanaChampagn Urbana, IL, USA 1 arxv:1009.0870v6
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 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 informationMultitimescale Distributed Capacity Allocation and Load Redirect Algorithms for Cloud System
Multtmescale Dstrbuted Capacty Allocaton and Load Redrect Algorthms for Cloud System Danlo Ardagna, Sara Casolar Mchele Colajann, Barbara Pancucc Report n. 2011.23 Multtme Scale Dstrbuted Capacty Allocaton
More informationApproximation algorithms for allocation problems: Improving the factor of 1 1/e
Approxmaton algorthms for allocaton problems: Improvng the factor of 1 1/e Urel Fege Mcrosoft Research Redmond, WA 98052 urfege@mcrosoft.com Jan Vondrák Prnceton Unversty Prnceton, NJ 08540 jvondrak@gmal.com
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 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 informationValue Driven Load Balancing
Value Drven Load Balancng Sherwn Doroud a, Esa Hyytä b,1, Mor HarcholBalter c,2 a Tepper School of Busness, Carnege Mellon Unversty, 5000 Forbes Ave., Pttsburgh, PA 15213 b Department of Communcatons
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 informationA Computer Technique for Solving LP Problems with Bounded Variables
Dhaka Unv. J. Sc. 60(2): 163168, 2012 (July) A Computer Technque for Solvng LP Problems wth Bounded Varables S. M. Atqur Rahman Chowdhury * and Sanwar Uddn Ahmad Department of Mathematcs; Unversty of
More informationAn MILP model for planning of batch plants operating in a campaignmode
An MILP model for plannng of batch plants operatng n a campagnmode Yanna Fumero Insttuto de Desarrollo y Dseño CONICET UTN yfumero@santafeconcet.gov.ar Gabrela Corsano Insttuto de Desarrollo y Dseño
More informationCausal, Explanatory Forecasting. Analysis. Regression Analysis. Simple Linear Regression. Which is Independent? Forecasting
Causal, Explanatory Forecastng Assumes causeandeffect relatonshp between system nputs and ts output Forecastng wth Regresson Analyss Rchard S. Barr Inputs System Cause + Effect Relatonshp The job of
More informationJoint Dynamic Radio Resource Allocation and Mobility Load Balancing in 3GPP LTE MultiCell Network
288 FENG LI, LINA GENG, SHIHUA ZHU, JOINT DYNAMIC RADIO RESOURCE ALLOCATION AND MOBILITY LOAD BALANCING Jont Dynamc Rado Resource Allocaton and Moblty Load Balancng n 3GPP LTE MultCell Networ Feng LI,
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 informationEfficient OnDemand Data Service Delivery to HighSpeed Trains in Cellular/Infostation Integrated Networks
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. XX, NO. XX, MONTH 2XX 1 Effcent OnDemand Data Servce Delvery to HghSpeed Trans n Cellular/Infostaton Integrated Networks Hao Lang, Student Member,
More informationIntroduction CONTENT.  Whitepaper 
OneCl oud ForAl l YourCr t c al Bus nes sappl c at ons Bl uew r esol ut ons www. bl uew r e. c o. uk Introducton Bluewre Cloud s a fully customsable IaaS cloud platform desgned for organsatons who want
More information