PBFVMC: A New Pseudo-Boolean Formulation to Virtual-Machine Consolidation

Over the course of the last decade, there have been several improvements in the performance of Boolean Satisfiability (SAT), Integer Linear Programming (ILP) and Pseudo-Boolean Optimization (PBO) solvers. These improvements have encouraged the applications of SAT, ILP and PBO techniques in modeling complex engineering problems. One such problem is the Virtual Machine Consolidation. The Virtual Machine Consolidation problem consists in placing a set of virtual machines in a set of hardware in a way to increase workload on hardware where they can operate more energy-efficient. This paper proposes an improved PBO formulation of the Virtual Machine Consolidation problem, PBFVMC. The improved formulation and enhancements are built on top of a previous work and a new set of constraints is created and rationalized to work more friendly with current PBO solvers. It is observed that this new formulation goes a step ahead and more problems can now be solved.

[1]  Tobias Achterberg,et al.  SCIP: solving constraint integer programs , 2009, Math. Program. Comput..

[2]  Matthew L. Ginsberg,et al.  Generalizing Boolean Satisfiability II: Theory , 2004, J. Artif. Intell. Res..

[3]  Matthew L. Ginsberg,et al.  Generalizing Boolean Satisfiability I: Background and Survey of Existing Work , 2011, J. Artif. Intell. Res..

[4]  Fabio Panzieri,et al.  Server consolidation in Clouds through gossiping , 2011, 2011 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks.

[5]  César A. F. De Rose,et al.  Server consolidation with migration control for virtualized data centers , 2011, Future Gener. Comput. Syst..

[6]  Luis Carlos Erpen De Bona,et al.  On Modelling Virtual Machine Consolidation to Pseudo-Boolean Constraints , 2012, IBERAMIA.

[7]  R. Harmon,et al.  Sustainable IT services: Assessing the impact of green computing practices , 2009, Portland International Conference on Management of Engineering and Technology.

[8]  Matthew L. Ginsberg,et al.  Generalizing Boolean Satisfiability III: Implementation , 2011, J. Artif. Intell. Res..

[9]  Werner Vogels,et al.  Beyond Server Consolidation , 2008, ACM Queue.

[10]  Sameep Mehta,et al.  ReCon: A tool to Recommend dynamic server Consolidation in multi-cluster data centers , 2008, NOMS 2008 - 2008 IEEE Network Operations and Management Symposium.

[11]  Luis Rodero-Merino,et al.  A break in the clouds: towards a cloud definition , 2008, CCRV.

[12]  H. Umeno,et al.  Performance Evaluation on Server Consolidation Using Virtual Machines , 2006, 2006 SICE-ICASE International Joint Conference.

[13]  Inês Lynce,et al.  Conflict-Driven Clause Learning SAT Solvers , 2009, Handbook of Satisfiability.

[14]  Jan Broeckhove,et al.  Cost-Optimal Scheduling in Hybrid IaaS Clouds for Deadline Constrained Workloads , 2010, 2010 IEEE 3rd International Conference on Cloud Computing.

[15]  Chris Rose,et al.  A Break in the Clouds: Towards a Cloud Definition , 2011 .

[16]  Neal Leavitt,et al.  Is Cloud Computing Really Ready for Prime Time? , 2009, Computer.

[17]  Theo Tryfonas,et al.  Frontiers in Artificial Intelligence and Applications , 2009 .

[18]  Antonio Corradi,et al.  Increasing Cloud power efficiency through consolidation techniques , 2011, 2011 IEEE Symposium on Computers and Communications (ISCC).

[19]  Randy H. Katz,et al.  Above the Clouds: A Berkeley View of Cloud Computing , 2009 .