Vmware, Inc.

Rajesh Venkatasubramanian

Pratap Subrahmanyam

Kiran Tati

Marcos Kawazoe Aguilera

Xavier Deguillard

Keerthi B Kumar

Qasim Ali

Ishan Banerjee

Yury Baskakov

Carl Alan Waldspurger

Alexander T Garthwaite

Pramod Kumar

Venkata Subhash Reddy Peddamallu

Julien Freche

Sahan Bamunavita Gamage

Mukund Gunti

Sairam Veeraswamy

Zhelong Pan

Arunachalam Ramanathan

Puneet Zaroo

Adrian Drzewiecki

Pranshu Jain

Ole Agesen

Keith Farkas

Andreas Georg Nowatzyk

Irina Calciu

Maarten Wiggers

Praveen Vegulla

Ashish Kaila

Timothy P Mann

Frederick Joseph Jacobs

Haoqiang Zheng

Benjamin J Corrie

Mark Russell Johnson

Xiaoxin Chen

Gabriel Tarasuk-Levin

Wei Xu

Michael Wei

Isam Wadih Akkawi

Preeti Agarwal

Zongwei Zhou

Seongbeom Kim

Sowgandh Sunil Gadi

Vivek Pandey

Halesh Sadashiv

Yi Yao

Anurekh Saxena

Lei Lu

Vishnu Sekhar

Varun S Lingaraju

Irene Zhang

Ying Yu

Charan K Singh

Nikhil Bhatia

Kiran Dikshit

Prashanth Victor

Michael Robert Stunes

Emmanuel Amaro Ramirez

Xiaoyuan Lu

Bing Hu

Alexandre Milouchev

Derek William Beard

Nadav Amit

Osten Kit Colbert

Jayneel Gandhi

Jesse Pool

Ivaylo Radoslavov Radev

Tongping Liu

Tomo Vladimirov Simeonov

Doug Covelli

Philip Peter Moltmann

Lalith Suresh

Tobias Stumpf

Alex Garthwaite

Adarsh Seethanadi Nayak

Nishchay Dua

Praveen Yedlapalli

Stanko Novakovic

Aniket Avinash Sakhardande

Richard Brunner

Yizhou Shan

Avinash Goud

Deepak Babarjung

Renu Raman

Xavier DeGuillard

Arun Ramanathan

Syed Zahed Khurasani

Manish Mishra

Yijiang Yuan

Sreekanth Setty

Various examples are disclosed for performing cross-cluster load balancing. In some aspects, a workload is selected for cross-cluster migration. A destination cluster is identified for a migration of the workload from a source cluster to the destination cluster. A cross-cluster migration recommendation is generated to migrate the workload from the source cluster to the destination cluster.

Cross-cluster load balancer

Disclosed are various embodiments for optimizing the migration of pages of memory servers in cluster memory systems. To begin, a computing device can mark in a page table of the computing device that a page stored on a first memory host is not present. Then, the computing device can flush a translation lookaside buffer of the computing device. Next, the computing device can copy the page from the first memory host to a second memory host. Moving on, the computing device can update a page mapping table to reflect that the page is stored in the second memory host. Then, the computing device can mark in the page table of the computing device that the page stored in the second memory host is present. Subsequently, the computing device can discard the page stored on the first memory host.

Migrating virtual machines in cluster memory systems

An example method of scheduling a workload in a virtualized computing system including a host cluster having a virtualization layer directly executing on hardware platforms of hosts is described. The virtualization layer supports execution of virtual machines (VMs) and is integrated with an orchestration control plane. The method includes: receiving, at the orchestration control plane, a workload specification for the workload; selecting, at the orchestration control plane, a plurality of nodes for the workload based on the workload specification, each of the plurality of nodes implemented by a host of the hosts; selecting, by the orchestration control plane in cooperation with a virtualization management server managing the host cluster, a node of the plurality of nodes; and deploying, by the orchestration control plane in cooperation with the virtualization management server, the workload on a host in the host cluster implementing the selected node.

Scheduling workloads in a container orchestrator of a virtualized computer system

Disclosed are various embodiments for optimized memory tiering. An ideal tier size for a first memory and an ideal tier size for a second memory can be determined for a process. Then, a host computing device can be identified that can accommodate the ideal tier size for the first memory and the second memory. Subsequently, the process can be assigned to the host computing device.

Optimized memory tiering

Techniques that enable a hypervisor to (1) maintain shared memory pages and (2) handle memory accounting for VMs that are suspended to and resumed from the volatile memory of a host system are provided. Regarding (1), the hypervisor can maintain shared memory pages in volatile memory across the suspend-to-memory and resume-from-memory operations, without having to save their reference counts. Regarding (2), the hypervisor can keep track of the volatile memory reserved and consumed by VMs as they are suspended and resumed, without erroneously double counting that memory.

Handling memory accounting when suspending and resuming virtual machines to/from volatile memory

Disclosed are various approaches for decreasing the latency involved in reading pages from swap devices. These approaches can include setting a first queue in the plurality of queues as a highest priority queue and a second queue in the plurality of queues as a low priority queue. Then, an input/output (I/O) request for an address in memory can be received. The type of the I/O request can be determined, and then the I/O request can be assigned to the first queue or the second queue of the swap device based at least in part on the type of the I/O request.

Low latency virtual memory management

Disclosed are various embodiments for improving resiliency and performance of clustered memory. A computing device can acquire a chunk of byte-addressable memory from a cluster memory host. The computing device can then identify an active set of allocated memory pages and an inactive set of allocated memory pages for a process executing on the computing device. Next, the computing device can store the active set of allocated memory pages for the process in the memory of the computing device. Finally, the computing device can store the inactive set of allocated memory pages for the process in the chunk of byte-addressable memory of the cluster memory host.

Resiliency and performance for cluster memory

Disclosed are various embodiments for improving the resiliency and performance for clustered memory. A computing device can mark a page of the memory as being reclaimed. The computing device can then set the page of the memory as read-only. Next, the computing device can submit a write request for the contents of the page to individual ones of a plurality of memory hosts. Subsequently, the computing device can receive individual confirmations of a successful write of the page from the individual ones of the plurality of memory hosts. Then, the computing device can mark the page as free in response to receipt of the individual confirmations of the successful write from the individual ones of the plurality of memory hosts.

Techniques for migrating virtual machines (VMs) in the presence of uncorrectable memory errors are provided. According to one set of embodiments, a source host hypervisor of a source host system can determine, for each guest memory page of a VM to be migrated from the source host system to a destination host system, whether the guest memory page is impacted by an uncorrectable memory error in a byte-addressable memory of the source host system. If the source host hypervisor determines that the guest memory page is impacted, the source host hypervisor can transmit a data packet to a destination host hypervisor of the destination host system that includes error metadata identifying the guest memory page as being corrupted. Alternatively, if the source host hypervisor determines that the guest memory page is not impacted, the source host hypervisor can attempt to read the guest memory page from the byte-addressable memory in a memory exception-safe manner.

Managing the migration of virtual machines in the presence of uncorrectable memory errors

In one set of embodiments, a hypervisor of a host system can determine that a delta between local and remote memory access latencies for each of a subset of NUMA nodes of the host system is less than a threshold. In response, the hypervisor can enable page sharing across the subset of NUMA nodes, where enabling page sharing comprises associating the subset of NUMA nodes with a single page sharing table, and where the single page sharing table holds entries identifying host physical memory pages of the host system that are shared by virtual machines (VMs) placed on the subset of NUMA nodes.

Increasing page sharing on non-uniform memory access (NUMA)-enabled host systems

Disclosed are various embodiments for improving the resiliency and performance of clustered memory. A computing device can generate at least one parity page from at least a first local page and a second local page. The computing device can then submit a first write request for the first local page to a first one of a plurality of memory hosts. The computing device can also submit a second write request for the second local page to a second one of the plurality of memory hosts. Additionally, the computing device can submit a third write request for the parity page to a third one of the plurality of memory hosts.

Methods, apparatus, systems, and articles of manufacture are disclosed for high availability (HA) application migration in a virtualized environment. An example apparatus includes at least one memory, instructions in the apparatus, and processor circuitry to at least one of execute or instantiate the instructions to identify an HA slot in a virtual server rack, the HA slot to facilitate a failover of an application executing on a first virtual machine (VM) in the virtual server rack, the first VM identified as a protected VM, deploy a second VM in the HA slot, transfer data from the first VM to the second VM, and, in response to not identifying a failure of at least one of the first or second VMs during the transfer, trigger a shutdown of the first VM, and synchronize migration data associated with the virtual server rack to identify the second VM as the protected VM.

Systems, methods, and apparatus for high availability application migration in a virtualized environment

Techniques for efficiently purging non-active blocks in an NVM region of an NVM device using virtblocks are provided. In one set of embodiments, a host system can maintain, in the NVM device, a pointer entry (i.e., virtblock entry) for each allocated data block of the NVM region, where page table entries of the NVM region that refer to the allocated data block include pointers to the pointer entry, and where the pointer entry includes a pointer to the allocated data block. The host system can further determine that a subset of the allocated data blocks of the NVM region are non-active blocks and can purge the non-active blocks from the NVM device to a mass storage device, where the purging comprises updating the pointer entry for each non-active block to point to a storage location of the non-active block on the mass storage device.

Efficiently purging non-active blocks in NVM regions using virtblock arrays

The disclosure provides an approach for the dynamic configuration of virtualized objects. A virtual object may be associated with a desired state defining a first plurality of resources for allocating to the virtual object. The first plurality of resources correspond to one or more resource types. Techniques include determining that each of a plurality of hosts does not have sufficient available resources to allocate the first plurality of resources to the virtual object according to the desired state. Techniques include selecting, a first host of the plurality of hosts to run the virtual object. Techniques include allocating a second plurality of resources to the virtual object from the first host, wherein the second plurality of resources is less than the first plurality of resources, and running the virtual object in the first host.

Dynamic configuration of virtual objects

Growing community of inventors

San Jose, CA, United States of America

Rajesh Venkatasubramanian