Automated virtual machine placement planning using different placement solutions at different hierarchical tree levels
US8959523B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Mar 30, 2012 |
| Grant date | Feb 17, 2015 |
| Priority date | — |
| Expiry date | Jan 15, 2033 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F2009/45575
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A virtual machine placement framework is described to enable a data center operator to develop a placement scheme to satisfy its particular constraints while simultaneously optimizing resource utilization. To generate a placement solution, the virtual machine placement problem is first characterized as a “bin packing” problem. The framework provides simple interface tools and processing modules, and a pluggable architecture for receiving placement algorithms. To generate a solution, an administrator creates an XML representation that abstracts physical entities (e.g., data center, subnet, rack, physical server, and the like) into a hierarchical tree of bins. The administrator also defines a set of “rules” that govern (direct) the placement of the virtual machines by placing constraints on the placement scheme. Using the hierarchical tree and the rules, the framework is executed to generate a placement as a solution to a bin packing problem, preferably on a layer-by-layer basis.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.