Vmware, Inc.

Facebook, Inc.

Kalyan Saladi

Ganesha Shanmuganathan

Xiaoyun Zhu

Puneet Zaroo

Sahan Bamunavita Gamage

Madhuri Yechuri

Narsing Krishna Vijayrao

Rishi Mehta

Jin Heo

Daniel Michael Hecht

Adarsh Jagadeeshwaran

Sai Inabattini

Nikhil Bhatia

Jean-Pascal Billaud

Shobhit O Kanaujia

Jeffrey Buell

Aravind Pavuluri

Reza Taheri

Disclosed herein are embodiments for managing the placement of virtual machines in a virtual machine network. In an embodiment, a method involves determining whether to separate at least one virtual machine in a set of virtual machines supporting a process and running on a first host computer from other virtual machines in the set. If at least one virtual machine is to be separated, then at least one virtual machine is selected based on a number of memory pages changed. The selected virtual machine is then separated from the other virtual machines in the set.

Load balancing of cloned virtual machines

A method, a non-transitory computer-readable storage medium, and a computer system for managing the placement of virtual machines in a virtual machine network are disclosed. In an embodiment, a method involves determining if at least one virtual machine in a set of virtual machines supporting a process and running on a first host computer needs to be separated from other virtual machines in the set. If at least one virtual machine needs to be separated, then at least one virtual machine is selected to be separated based on the number of memory pages changed. The selected VM is then separated from the other virtual machines in the set.

Techniques for representative-based approach to store historical resource usage data are disclosed. In one embodiment, a management node may include a statistical representative computational unit to obtain historical resource usage data associated with a workload running on a host, divide the historical resource usage data into a plurality of pools with each pool comprising a predefined number of resource usage statistics, and determine a statistical representative corresponding to each of the pools. Each statistical representative may represent the predefined number of resource usage statistics in a corresponding one of the pools. Further, the management node may include a monitoring and managing unit to monitor and/or manage the workload using the statistical representatives.

Representative-based approach to store historical resource usage data

A method, a non-transitory computer-readable storage medium, and a computer system for managing bandwidth allocated to a virtual machine running on a host computer is disclosed. In an embodiment, a method involves obtaining the current bandwidth for a virtual machine running on a host computer, determining bandwidth demand for the virtual machine as a function of the current bandwidth and a growth margin, and adjusting a bandwidth cap for the virtual machine based on the determined bandwidth demand. In an embodiment, when applied, the technique allows for bandwidth to be allocated to the virtual machines without the sum of allocated bandwidth exceeding a global bandwidth cap.

Method and system for determining bandwidth demand

In a computer-implemented method for reducing delay of bursty data transmission in a network employing a congestion control protocol, data is accessed that is to be periodically transmitted over a network employing a congestion control protocol. The data is to be periodically transmitted with a high burst rate followed by an idle period. The congestion control protocol progressively increases a data transmission rate during a data transmission rate increase period invoked immediately following a predetermined idle period. Prior to transmitting the data, priming data is transmitted during at least a portion of the idle period until the congestion control protocol progressively increases the data transmission rate to a desired transmission rate. The data is transmitted at the desired transmission rate.

Bursty data transmission in a congestion controlled network

A computer implemented method receives a request to run a group of instruction sets. Each instruction set is associated with a sequence of common instructions. The method executes the sequence of common instructions in a first virtual machine (VM) to generate a result which is stored in a first memory associated with the first VM. The method then clones a second VM that shares the first memory with the first VM. The method continues by executing a first instruction set in the second VM. Since the second VM shares memory with the first VM, the second VM can use the result stored in the first memory and the sequence of common instructions does not need to be executed on the second VM. In one example, the result is a run-time model of a circuit and the second VM runs the first instruction set on the run-time model.

Techniques for improving computational throughput by using virtual machines

A management server and method for performing resource management operations in a distributed computer system utilizes interference scores for clients executing different workloads to create an interference affinity-type rule for at least some of the clients contending for a resource based on the interference scores for that resource. The interference affinity-type rule can then be used to recommend a target host computer to place a client.

Interference-aware client placement

A management server and method for performing resource management operations in a distributed computer system utilizes interference scores for clients executing different workloads, including a client to be placed in the distributed computer system, as utilization values of resources, which are assigned continuously variable weights to produce weighted resource utilization values. The weighted resource utilization values are used to generate overall selection scores for host computers of the distributed compute system, which are then used to recommend a target host computer among the host computers of the distributed computer system to place the client.

Interference-based client placement using dynamic weights

The disclosure is directed to a cache management system ('system') for storing data in a cache of a computer system in a compact form. The system identifies multiple instances of a candidate value stored in a primary cache and stores those instances as a single value in a value cache. The system stores multiple pointers to the candidate value in the value cache, e.g., as many as the number of occurrences of the candidate value in the primary cache, each of which corresponds to an address in a memory of the computer system storing an instance of the primary cache candidate value. By storing multiple instances of the candidate value as a single instance, the system reduces the cache pollution and the memory bandwidth and facilitates storing more number of distinct values in the primary cache of a given size.

Value cache in a computing system

The current document is directed to virtualized PMUs provided by virtualization layers. The currently disclosed virtualized PMUs are decoupled from the underlying PMU hardware features of processors on which the virtualization layer executes. The decoupling is achieved, in part, by time multiplexing the underlying hardware PMU registers to provide a greater number of virtualized PMU registers than the number of hardware-PMU registers provided by at least some of the underlying hardware PMUs. The decoupling is also achieved by providing for monitoring, by the virtualized PMU registers, of computed processor events and approximated processor events in addition to the processor events monitored by the underlying hardware PMUs. In addition, the virtualized PMU registers are implemented, in certain implementations, to support a variety of different monitoring modes, including monitoring of processor events that occur only during execution of the virtualization layer and monitoring of hardware-thread-specific processor events.

Growing community of inventors

Sunnyvale, CA, United States of America

Kalyan Saladi