Distributed Dynamic Speed Scaling

Abstract

Abstract-In recent years we have witnessed a great interest in large distributed computing platforms, also known as clouds. While these systems offer enormous computing power, they are major energy consumers. In existing data centers CPUs are responsible for approximately half of the energy consumed by the servers. A promising technique for saving CPU energy consumption is dynamic speed scaling, in which the speed at which the processor is run is adjusted based on demand and performance constraints. In this paper we look at the problem of allocating the demand in the network of processors (each being capable to perform dynamic speed scaling) to minimize the global energy consumption/cost subject to a performance constraint. The nonlinear dependence between the energy consumption and the performance as well as the high variability in the energy prices result in a nontrivial resource allocation. The problem can be abstracted as a fully distributed convex optimization with a linear constraint. On the theoretical side, we propose two low-overhead fully decentralized algorithms for solving the problem of interest and provide closed-form conditions that ensure stability of the algorithms. Then we evaluate the efficacy of the optimal solution using simulations driven by the real-world energy prices. Our findings indicate a possible cost reduction of 10 − 40% compared to power-oblivious 1/N load balancing, for a wide range of load factors. Index Terms-

Cost Efficient Resource Management Framework for Hybrid Job Scheduling Under Geo Distributed Data Centers

“…In this paper, we leverage both location and temporal price diversity to reduce IDC energy costs. Different from server provisioning, load shifting can be performed in a small time scale, e.g., on the order of hundreds of milliseconds [14]. How to jointly and efficiently use server provisioning, load shifting and SEN/TOL capacity allocation, which have different time granularities, to provision SENs and TOLs for distributed IDCs is a challenging problem, which is our another key contribution.…”

On Optimality Criteria for Reverse Charging of Electric Vehicles

“…Of course, such users probably have a financial benefit. Nevertheless, one alternative method to achieve fairness in the network is to use the utility functions to dictate how much energy each user gives back to the network; this is known as utility fairness [21]. Fig.…”

“…Here, we ensure that the environmental cost to each user is the same. The previous minimization problem becomes now an equalization problem that can be solved either in a centralized manner or in a decentralized manner, for instance, using implicit consensus techniques [21].…”

Geographical Load Balancing for Online Service Applications in Distributed Datacenters

“…Some prior work has focused on reducing the operational cost of the cloud system by using the load balancing opportunity -see [19] and [20]. Model predictive control has been used to solve the GLB problem using the estimated future load, e.g., [21] and [22].…”