On the Consolidation of Data-Centers with Performance Constraints
QoSA '09 Proceedings of the 5th International Conference on the Quality of Software Architectures: Architectures for Adaptive Software Systems
Cooling-aware workload placement with performance constraints
Performance Evaluation
A constraint programming approach for the service consolidation problem
CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Modeling response times in the Google ROADEF/EURO challenge
ACM SIGMETRICS Performance Evaluation Review
Closed Queueing Networks Under Congestion: Nonbottleneck Independence and Bottleneck Convergence
Mathematics of Operations Research
| Hi-index | 0.00 |
In this paper, we address the service consolidation problem: given a data-center, a set of servers and a set of multi-tiered services or applications, the problem is to allocate services to the available servers in order to minimize the number of servers to use while avoiding the overloading of system resources and satisfying end-to-end response time constraints. Exploiting queueing networks theory, we describe a number of linear and non-linear combinatorial optimization problems related to the server consolidation problem. Since their solution is difficult to obtain through standard solution techniques, we propose accurate heuristics which quickly compute a sub-optimal solution and let us deal with hundreds of servers and applications. Experimental results illustrate the impact of the consolidation in data-centers and show that the heuristic solution is almost very close to the optimum.