Abstract:
Dynamic adaptive reconfiguration of a computing system includes receiving a request to remove a first node in a plurality of physical nodes. An operating system is executing collectively across the plurality of physical nodes, and an application is running on the operating system. It further includes in response to the request, and while the application is running, evacuating virtualized resources associated with the first node to one or more other nodes in the plurality of physical nodes. It further includes subsequent to the evacuation of the virtualized resources, removing the first node from the plurality of physical nodes.
Abstract:
A computer-implemented method for managing virtual functions in a network. The method includes collecting instantiation and usage statistics of virtual function instances, detecting instantiation and usage patterns of the virtual function instances based on the collected instantiation and usage statistics, determining that one or more virtual function types are to be reconfigured based on an analysis of the detected instantiation and usage patterns, and reconfiguring the one or more virtual function types in response to a determination that the one or more virtual function types are to be reconfigured.
Abstract:
Methods, systems, and apparatuses increase virtual machine availability during server updates. A first resource set is designated to include one or more servers needing an update. A first set of virtual machines running on the one or servers in a live manner is migrated from the first resource set to a second resource set to convert the first resource set to an empty resource set, and such that the first set of virtual machines runs in a live manner on the second resource set. The update is performed on the one or more servers of the empty resource set to create an updated empty resource set.
Abstract:
The described technology is directed towards returning less data than is available for a data item in response to a request to a data service. A virtual graph node is returned in response to client requests, in which the virtual node comprises a relatively lightweight set of information relative to the full set of information for the data item, e.g., maintained in a main (graph) node. A requesting client indicates that a virtual node is desired, and receives a response comprising the virtual node, generally processed from the main node's data into a reduced subset of the main node. The main node may be cached at the data service, and returned if and when requested.
Abstract:
A system and method for fair resource allocation includes a method. The method includes determining demand for a plurality of communications features of a network. The method further includes determining resource allocations for virtual computing instances hosted by a plurality of servers. The virtual computing instances serve the communications features. The method further includes adjusting the resource allocations for the virtual computing instances according to the demand for the communications features and a fairness algorithm.
Abstract:
Techniques for executing one or more instances of a computer program using virtual machines, the computer program comprising multiple computer program portions including a first computer program portion. The techniques include determining whether an instance of any of the multiple computer program portions is to be executed; when it is determined that a first instance of the first computer program portion is to be executed, accessing first information specifying a first set of one or more virtual machine resources required for executing the first instance of the first computer program portion; determining whether any one of the plurality of virtual machines has at least the first set of virtual machine resources available; and when it is determined that a first of the plurality of virtual machines has the first set virtual machine resources available, causing the first virtual machine to execute the first instance of the first computer program portion.
Abstract:
Systems and methods described herein align various types of hypervisor threads with a non-uniform memory access (NUMA) client of a virtual machine (VM) that is driving I/O transactions from an application so that no remote memory access is required and the I/O transactions can be completed with local accesses to CPUs, caches, and the I/O devices of a same NUMA node of a hardware NUMA system. First, hypervisor of the VM detects whether the VM runs on a single or multiple NUMA nodes. If the VM runs on multiple NUMA nodes, a NUMA client on which the application is executing the I/O transactions is identified and knowledge of resource sharing between the NUMA client and its related hypervisor threads is established. Such knowledge is then utilized to schedule the NUMA client and its related hypervisor threads to the same NUMA node of the NUMA system.