Resource overbooking and application profiling in shared hosting platforms
ACM SIGOPS Operating Systems Review - OSDI '02: Proceedings of the 5th symposium on Operating systems design and implementation
Power-aware resource allocation in high-end systems via online simulation
Proceedings of the 19th annual international conference on Supercomputing
SC '05 Proceedings of the 2005 ACM/IEEE conference on Supercomputing
Power provisioning for a warehouse-sized computer
Proceedings of the 34th annual international symposium on Computer architecture
Model-based resource provisioning in a web service utility
USITS'03 Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4
Grid'5000: A Large Scale And Highly Reconfigurable Experimental Grid Testbed
International Journal of High Performance Computing Applications
Minimizing the stretch when scheduling flows of divisible requests
Journal of Scheduling
1000 Islands: Integrated Capacity and Workload Management for the Next Generation Data Center
ICAC '08 Proceedings of the 2008 International Conference on Autonomic Computing
Workload Analysis and Demand Prediction of Enterprise Data Center Applications
IISWC '07 Proceedings of the 2007 IEEE 10th International Symposium on Workload Characterization
Optimal power allocation in server farms
Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
Optimal Power Management for Server Farm to Support Green Computing
CCGRID '09 Proceedings of the 2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid
Power-aware load balancing of large scale MPI applications
IPDPS '09 Proceedings of the 2009 IEEE International Symposium on Parallel&Distributed Processing
Optimal sleep patterns for serving delay-tolerant jobs
Proceedings of the 1st International Conference on Energy-Efficient Computing and Networking
Proceedings of the 1st International Conference on Energy-Efficient Computing and Networking
Multi-facet approach to reduce energy consumption in clouds and grids: the GREEN-NET framework
Proceedings of the 1st International Conference on Energy-Efficient Computing and Networking
Towards energy-aware scheduling in data centers using machine learning
Proceedings of the 1st International Conference on Energy-Efficient Computing and Networking
A dynamic optimization model for power and performance management of virtualized clusters
Proceedings of the 1st International Conference on Energy-Efficient Computing and Networking
Resource allocation algorithms for virtualized service hosting platforms
Journal of Parallel and Distributed Computing
Opportunities and challenges to unify workload, power, and cooling management in data centers
ACM SIGOPS Operating Systems Review
Energy-efficient application-aware online provisioning for virtualized clouds and data centers
GREENCOMP '10 Proceedings of the International Conference on Green Computing
PAAS: Power Aware Algorithm for Scheduling in High Performance Computing
UCC '13 Proceedings of the 2013 IEEE/ACM 6th International Conference on Utility and Cloud Computing
Hi-index | 0.00 |
Placing compute jobs on clustered hosts in a way that optimizes both performance and power consumption has become a crucial issue. Most solutions to the power-aware job placement problem boil down to consolidating workload on a small number of hosts so as to reduce power consumption which achieving acceptable performance levels. The question we investigate in this paper is whether the capabilities provided by DVFS, i.e., the ability to configure a host in one of several power consumption modes, leads to improved solutions. We formalize the problem so that a bound on the optimal solution can be computed. We then study how the optimal, if it can be computed, and its bound vary across scenarios in which hosts provide various degrees of DVFS capabilities. We rely on a DVFS model that we instantiate based on real-world experiments. Our approach thus quantifies the potential improvements that hypothetical job placement algorithms can hope to achieve by exploiting DVFS capabilities.