Service Consolidation with End-to-End Response Time Constraints
SEAA '08 Proceedings of the 2008 34th Euromicro Conference Software Engineering and Advanced Applications
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
A Mathematical Programming Approach for Server Consolidation Problems in Virtualized Data Centers
IEEE Transactions on Services Computing
Bin repacking scheduling in virtualized datacenters
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Fundamentals of dynamic decentralized optimization in autonomic computing systems
Self-star Properties in Complex Information Systems
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
| Hi-index | 0.00 |
In this paper, we extend the machine reassignment model proposed by Google for the ROADEF/EURO Challenge. The aim of the challenge is to develop algorithms for the efficient solutions of data-center consolidation problems. The problem stated in the challenge mainly focus on dependability requirements and does not take into account performance requirements (end-to-end response times). We extend the Google problem definition by modeling and constraining end-to-end response times. We provide experimental results to show the effectiveness of this extension.