Foundations of queueing theory
Foundations of queueing theory
Convex Optimization
PACE: A New Approach to Dynamic Voltage Scaling
IEEE Transactions on Computers
Monte Carlo Statistical Methods (Springer Texts in Statistics)
Monte Carlo Statistical Methods (Springer Texts in Statistics)
Classifying scheduling policies with respect to higher moments of conditional response time
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Optimal power allocation in server farms
Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
Cutting the electric bill for internet-scale systems
Proceedings of the ACM SIGCOMM 2009 conference on Data communication
PowerPack: Energy Profiling and Analysis of High-Performance Systems and Applications
IEEE Transactions on Parallel and Distributed Systems
INFOCOM'10 Proceedings of the 29th conference on Information communications
Capping the brown energy consumption of Internet services at low cost
GREENCOMP '10 Proceedings of the International Conference on Green Computing
Stochastic Network Optimization with Application to Communication and Queueing Systems
Stochastic Network Optimization with Application to Communication and Queueing Systems
Optimal power cost management using stored energy in data centers
Proceedings of the ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Greening geographical load balancing
Proceedings of the ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Proceedings of the 13th annual conference companion on Genetic and evolutionary computation
Genetic and Evolutionary Computation Conference
Online job-migration for reducing the electricity bill in the cloud
NETWORKING'11 Proceedings of the 10th international IFIP TC 6 conference on Networking - Volume Part I
Utilizing green energy prediction to schedule mixed batch and service jobs in data centers
HotPower '11 Proceedings of the 4th Workshop on Power-Aware Computing and Systems
GreenSlot: scheduling energy consumption in green datacenters
Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis
Renewable and cooling aware workload management for sustainable data centers
Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems
Joint Channel and Power Allocation in Wireless Mesh Networks: A Game Theoretical Perspective
IEEE Journal on Selected Areas in Communications
Provably-Efficient Job Scheduling for Energy and Fairness in Geographically Distributed Data Centers
ICDCS '12 Proceedings of the 2012 IEEE 32nd International Conference on Distributed Computing Systems
Proceedings of the 9th international conference on Autonomic computing
Carbon-Aware Energy Capacity Planning for Datacenters
MASCOTS '12 Proceedings of the 2012 IEEE 20th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems
AutoScale: Dynamic, Robust Capacity Management for Multi-Tier Data Centers
ACM Transactions on Computer Systems (TOCS)
ACM SIGMETRICS Performance Evaluation Review - Special issue on the 31st international symposium on computer performance, modeling, measurements and evaluation (IFIPWG 7.3 Performance 2013)
| Hi-index | 0.00 |
Due to the enormous energy consumption and associated environmental concerns, data centers have been increasingly pressured to reduce long-term net carbon footprint to zero, i.e., carbon neutrality. In this paper, we propose an online algorithm, called COCA (optimizing for COst minimization and CArbon neutrality), for minimizing data center operational cost while satisfying carbon neutrality without long-term future information. Unlike the existing research, COCA enables distributed server-level resource management: each server autonomously adjusts its processing speed and optimally decides the amount of workloads to process. We prove that COCA achieves a close-to-minimum operational cost (incorporating both electricity and delay costs) compared to the optimal algorithm with future information, while bounding the potential violation of carbon neutrality. We also perform trace-based simulation studies to complement the analysis, and the results show that COCA reduces cost by more than 25% (compared to state of the art) while resulting in a smaller carbon footprint.