International Business Machines Corporation

Erez Hadad

Yosef Moatti

Ofer Biran

Sadek Jbara

Indrajit Poddar

Elliot Karl Kolodner

Alain Charles Azagury

Nitzan Peleg

Michael Rodeh

Alexey Miroshkin

Dean Lorenz

Evgeny Hazanovich

Igor Khapov

Ilsiyar I Gaynutdinov

Richard Edwin Harper

Lorrie Ann Tomek

Ari Freund

Gil Rapaport

Elliot K Kolodmer

A software container image that includes components dependent on a first computer instruction set architecture (ISA) is ported to enable a container to execute using the container image on a computer having a second ISA different from the first. Porting the container image entails replacing components of the container image not compatible with the second ISA with equivalent components compatible with the second ISA. The porting is performed, in some instances, dynamically as part of running a container with the container image on a computer implementing the second ISA.

ISA-ported container images

Systems and methods for allocating resources to service one or more requests, the method comprising: associating with at least one host from among N hosts, in a computing environment, a first value that reflects a probability that servicing a first request will interfere with operations on the host; selecting M hosts out of the N hosts, wherein the N hosts comprise one or more resources for servicing a first request and wherein at least one of the selected M hosts is determined to be at least as suitable as N&#x2212;M unselected hosts, for the purpose of servicing the first request; and prior to allocation of resources, updating for at least a first host from among the M hosts the corresponding first value to reflect that servicing the first request may interfere with operations pertaining to other previously received requests that are scheduled to be serviced by the first host.

Efficient resource management in a virtualized computing environment

Machines, systems and methods for managing resources allocated in a virtualized computing network are provided. The method comprises monitoring resource usage by a first host, wherein the first host, in addition to the first host's dedicated resources, has access to a first set of sharable resources, and wherein the second host, in addition to the second host's dedicated resources, has access to a second set of sharable resources; determining whether the second host has excess resource capacity in the second host's dedicated and sharable resources, in response to determining that resource usage of the first host in the first host's dedicated and sharable resources has exceeded a resource usage threshold; and reallocating one or more resources in the second set of sharable resources from the second host to the first host, in response to determining that the second host has excess resource capacity.

Optimized global capacity management in a virtualized computing environment

Systems and methods for planning the execution of one or more plans in a virtualized computing environment are provided. In one embodiment, the method comprises computing an order for execution for one or more plans, and the corresponding operations in said one or more plans; validating whether a plan and the corresponding operations for the plan may be successfully executed, prior to executing the plan and the corresponding operations; executing the plan and the corresponding operations, in response to a successful validation; and aborting execution of the plan and the corresponding operations, in response to an unsuccessful validation, wherein the validating process takes into consideration impact of other plans that are previously validated and possible changes in the computing environment since time the plan was computed.

Concurrent scheduling of plan operations in a virtualized computing environment

Methods and systems for generating a placement plan for one or more virtual machines (VMs) in a computing environment are provided. The method comprises providing, to a computing system, input parameters comprising a current placement for the one or more VMs on one or more hosts in a computing network; a target placement that assigns at least one of the one or more VMs to at least another host in said one or more hosts; and a set of constraints with which both the current placement and the target placement comply.

Optimized placement planning for virtual machines in a network by breaking relocation graph into one or more cores to apply different solutions

Systems and methods for reducing risk of service interruptions for one or more virtual machines (VMs) in a computing environment are provided. The method comprises computing a placement scheme for placing at least one VM on one or more hosts according to a set of placement constraints defined for the VM, wherein the set of placement constraints comprises at least one availability constraint defined for the VM, wherein the availability constraint designates a N resiliency level, wherein N corresponds to number of host failures that may occur before the services provided by the VM are interrupted.

Optimized placement of virtual machines in a network environment

Systems and methods for domain management in a virtualized computing environment are provided. In one embodiment, the method comprises collating advice received from one or more domain advisors connected in the virtualized computing environment; resolving any conflicts among the advice received from said one or more domain advisors; utilizing the collated advice to generate a placement plan comprising a plurality of operations for virtual machines in said virtualized computing environment; and executing the one or more operations in the placement plan, wherein one or more domain handlers may be called to update the virtualized computing environment before, during or after execution of one or more operations from among said plurality of operations in the plan.

Domain management and integration in a virtualized computing environment

A system and method for planning placement of virtual machines VMs in a computing environment comprising a set of hosting machines HM. The method includes constructing a bipartite directed graph-based model that represents both a current and a target placement states, both including virtual machine nodes v in VM and nodes h in HM. Using a technique of graph pruning, the method iteratively generates a plan for achieving a desired target placement starting from the current placement without temporarily violating any policy or resource constraint. The application of the pruning algorithm to VM deployment automation necessarily defines a new model. The methodology employed safely manages concurrent changes in a datacenter, so that the environment can adjust faster to changing constraints. Furthermore, the present invention allows detection of migration cycles, caused by deadlocked combinations of capacity and policy constraints, and resolving them.

Growing community of inventors

Nahariya, Israel

Erez Hadad