Patent application number | Description | Published |
20110231680 | ENERGY SAVINGS FOR A NETWORKED COMPUTER - Energy saving virtualization technique embodiments are presented that save energy by virtualizing a network-connected client computer's computing session (or a part thereof) as a virtual machine (VM) and then migrating it between the client computer and a VM server, depending on whether the computing session is active or idle. The client computer VM is migrated to the VM server when the client computer is deemed to be idle, and the VM is migrated back when the client computer is deemed to have re-entered an active condition. When the VM has been migrated away from the client computer and is residing on the VM server, the client computer is put into a sleep mode, thereby saving energy. However, the user's computing session remains alive on the VM server so that ongoing network connections and other activity are not disturbed. | 09-22-2011 |
20130346969 | Opportunistically Proactive Resource Management Using Spare Capacity - Embodiments perform opportunistically proactive resource scheduling for a plurality of resource-consuming entities. The scheduling is based on both current entitlement (or demand) by the entities and predicted future entitlement (or demand) by the entities. Resources are allocated based on the current demands, while any remaining resource capacity is further allocated to entities based on predicted demands. In some embodiments, the scheduling is performed on a cluster of hosts executing a plurality of virtual machines (VMs) in a virtualized datacenter to implement load balancing. | 12-26-2013 |
20140059207 | CLIENT PLACEMENT IN A COMPUTER NETWORK SYSTEM USING DYNAMIC WEIGHT ASSIGNMENTS ON RESOURCE UTILIZATION METRICS - A system and method for placing a client in a computer network system uses continuously variable weights to resource utilization metrics for each candidate device, e.g., a host computer. The weighted resource utilization metrics are used to compute selection scores for various candidate devices to select a target candidate device for placement of the client. | 02-27-2014 |
20140173593 | SYSTEMS AND METHODS FOR FINDING SOLUTIONS IN DISTRIBUTED LOAD BALANCING - pa Systems and methods for finding solutions exhaustively in distributed load balancing are provided. A plurality of virtual machines (VMs) is in communication with a virtual machine management server (VMMS). The VMMS is configured to generate a matrix that represents a mapping of a plurality of virtual machines (VMs) to a plurality of hosts and to calculate a first imbalance metric of the matrix. The VMMS is also configured to identify a plurality of candidate migrations the VMs. The VMMS searches through the solution space efficiently and can perform an exhaustive search to find the optimal solution. For each candidate migration, the VMMS is configured to alter the matrix to represent the candidate migration and to calculate a candidate imbalance metric based on the altered matrix. The VMMS is also configured to determine which candidate migration to perform based at least in part on the candidate imbalance metric for each candidate migration and the first imbalance metric. | 06-19-2014 |
20140337837 | AUTOMATED SCALING OF APPLICATIONS IN VIRTUAL DATA CENTERS - A system and method for autoscaling a multi-tier application, that has components executing on a plurality of tiers of a virtual data center, allocates resources to each of the plurality of tiers based on cost and performance. An application performance is determined, and a new application performance is estimated based at least partially on an application reservation and an application limit. An optimized utility of the application is calculated based on the cost to execute the application, the application reservation, and the application limit. A scaling factor for each tier is then determined to scale up or down a number of virtual machines operating in each of the tiers. | 11-13-2014 |
20140380307 | PERFORMANCE-DRIVEN RESOURCE MANAGEMENT IN A DISTRIBUTED COMPUTER SYSTEM - A system and method for managing resources in a distributed computer system that includes at least one resource pool for a set of virtual machines (VMs) utilizes a set of desired individual VM-level resource settings that corresponds to target resource allocations for observed performance of an application running in the distributed computer system. The set of desired individual VM-level resource settings are determined by constructing a model for the observed application performance as a function of current VM-level resource allocations and then inverting the function to compute the target resource allocations in order to meet at least one user-defined service level objective (SLO). The set of desired individual VM-level resource settings are used to determine final RP-level resource settings for a resource pool to which the application belongs and final VM-level resource settings for the VMs running under the resource pool, which are then selectively applied. | 12-25-2014 |
20150058265 | AUTOMATED SCALING OF MULTI-TIER APPLICATIONS USING REINFORCED LEARNING - A module and method for automatically scaling a multi-tier application, wherein each tier of the multi-tier application is supported by at least one virtual machine, selects one of reinforced learning and heuristic operation based on a policy to recommend a scaling action from a current state of the multi-tier application. If reinforced learning is selected, the reinforced learning is applied to select the scaling action from a plurality of possible actions for the multi-tier application in the current state. If heuristic operation is selected, the heuristic operation is applied to select the scaling action using a plurality of defined heuristics. | 02-26-2015 |
20150120931 | AUTOMATIC REMEDIATION IN A DISTRIBUTED COMPUTER SYSTEM WITH MULTIPLE CLUSTERS OF HOST COMPUTERS - A system and method for performing automatic remediation in a distributed computer system with multiple clusters of host computers uses the same placement selection algorithm for initial placements and for remediation placements of clients. The placement selection algorithm is executed to generate a placement solution when a remediation request in response to a remediation-requiring condition in the distributed computer system for at least one client running in one of the multiple clusters of host computers is detected and a remediation placement problem for the client is constructed. The placement solution is then implemented for the client for remediation | 04-30-2015 |