Patent application number | Description | Published |
20090013029 | DEVICE, SYSTEM AND METHOD OF OPERATING A PLURALITY OF VIRTUAL LOGICAL SITES - Some demonstrative embodiments of the invention include, for example, devices, systems and methods of operating one or more virtual logical sites. A method may include, for example, running on a server at least one first virtual machine implementing at least part of a first virtual logical site, and at least one second virtual machine implementing at least part of a second virtual logical site interchangeable with the first virtual logical site. Other embodiments are described and claimed. | 01-08-2009 |
20090319653 | SERVER CONFIGURATION MANAGEMENT METHOD - A method for monitoring changes in at least two servers, that creates difference results that encapsulate effects of changes applied to file systems of at least two servers. These differences results are defined by predetermined creation rules. The method includes comparing the difference results between the at least two servers to detect differences in the respective difference results. These detected differences are defined in accordance with predetermined comparison rules. The method further includes: analyzing the detected differences in comparison results in accordance with predetermined analysis rules and indicating potential problems from the analyzed and detected differences. | 12-24-2009 |
20100250744 | SYSTEM AND METHOD FOR DEPLOYING VIRTUAL MACHINES IN A 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. | 09-30-2010 |
20120042311 | OPTIMIZED PLACEMENT PLANNING FOR VIRTUAL MACHINES IN A NETWORK - 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. | 02-16-2012 |
20120123825 | CONCURRENT SCHEDULING OF PLAN OPERATIONS 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. | 05-17-2012 |
20120151474 | DOMAIN MANAGEMENT AND INTERGRATION IN A VIRTUALIZED COMPUTING 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. | 06-14-2012 |
20130145368 | OPTIMIZED PLACEMENT OF VIRTUAL MACHINES IN A NETWORK ENVIRONMENT - 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. | 06-06-2013 |
20140068077 | Efficient Resource Management in a Virtualized Computing Environment - 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−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. | 03-06-2014 |
20140068609 | Resource Allocation in a Virtualized Computing Environment - Machines, systems and methods for deciding whether a plurality of virtual machines (VMs) may be hosted on a computing system with resources to support at least one of the VMs, the method comprising determining maximum permissible probability of infringement (maxPermInfrProb(v)) for a VM(v), wherein “v” is a value from 1 to n, such that n is the number of VMs in a set G, as stipulated by the VMs' SLA, wherein “v” is a value from 1 to n, such that n is the number of VMs in a set G; partitioning the set G into a plurality of groups G | 03-06-2014 |