-
公开(公告)号：US20210216394A1
公开(公告)日：2021-07-15
申请号：US16743895
申请日：2020-01-15
Applicant: VMware, Inc.
Inventor： Sowgandh Sunil Gadi , Rajesh Venkatasubramanian , Venkata Subhash Reddy Peddamallu , Arunachalam Ramanathan , Timothy P. Mann , Frederick Joseph Jacobs
Abstract: 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.
-
52.发明申请公开(公告)号：US20210133032A1
公开(公告)日：2021-05-06
申请号：US17144082
申请日：2021-01-07
Applicant: VMware, Inc.
Inventor： Pratap Subrahmanyam , Rajesh Venkatasubramanian , Kiran Tati , Qasim Ali , Marcos Aguilera , Irina Calciu , Venkata Subhash Reddy Peddamallu , Xavier Deguillard , Yi Yao
Abstract: Techniques for achieving application high availability via application-transparent battery-backed replication of persistent data are provided. In one set of embodiments, a computer system can detect a failure that causes an application of the computer system to stop running. In response to detecting the failure, the computer system can copy persistent data written by the application and maintained locally at the computer system to one or more remote destinations, where the copying is performed in a manner that is transparent to the application and while the computer system runs on battery power. The application can then be restarted on another computer system using the copied data.
-
公开(公告)号：US10936446B2
公开(公告)日：2021-03-02
申请号：US15889162
申请日：2018-02-05
Applicant: VMware, Inc.
Inventor： Kiran Tati , Rajesh Venkatasubramanian , Xavier Deguillard , Praveen Yedlapalli
Abstract: A journal-based process to achieve atomicity in a device driver write operation includes committing a transaction associated with the operation to a journal that include a status indicating the target block is corrupted. Subsequent to committing the transaction, the data is written to the target block. If the write operation is successfully committed, the transaction can be deleted from the journal. If a system crash occurs (e.g., power failure) before the write operation is successfully committed, the transaction remains in the journal and can be used to update block metadata associated with the target block when the system reboots to indicate that it is corrupted; e.g., the target block is a torn write.
-
公开(公告)号：US10705954B2
公开(公告)日：2020-07-07
申请号：US16174270
申请日：2018-10-29
Applicant: VMware, Inc.
Inventor： Rajesh Venkatasubramanian , Ishan Banerjee , Julien Freche , Kiran Tati , Preeti Agarwal , Xavier Deguillard
IPC: G06F13/00 , G06F12/02 , G06F12/0804 , G06F12/1009
Abstract: Techniques for efficiently purging non-active blocks in an NVM region of an NVM device while preserving large pages are provided. In one set of embodiments, a host system can receive a write request with respect to a data block of the NVM region, where the data block is referred to by a snapshot of the NVM region and was originally allocated as part of a large page. The host system can further allocate a new data block in the NVM region, copy contents of the data block to the new data block, and update the data block with write data associated with the write request. The host system can then update a level 1 (L1) page table entry of the NVM region's running point to point to the original data block.
-
公开(公告)号：US20200133847A1
公开(公告)日：2020-04-30
申请号：US16174270
申请日：2018-10-29
Applicant: VMware, Inc.
Inventor： Rajesh Venkatasubramanian , Ishan Banerjee , Julien Freche , Kiran Tati , Preeti Agarwal , Xavier Deguillard
IPC: G06F12/02 , G06F12/0804 , G06F12/1009
Abstract: Techniques for efficiently purging non-active blocks in an NVM region of an NVM device while preserving large pages are provided. In one set of embodiments, a host system can receive a write request with respect to a data block of the NVM region, where the data block is referred to by a snapshot of the NVM region and was originally allocated as part of a large page. The host system can further allocate a new data block in the NVM region, copy contents of the data block to the new data block, and update the data block with write data associated with the write request. The host system can then update a level 1 (L1) page table entry of the NVM region's running point to point to the original data block.
-
Patent Agency Ranking
公开(公告)号：US10255091B2
公开(公告)日：2019-04-09
申请号：US14492051
申请日：2014-09-21
Applicant: VMware, Inc.
Inventor： Seongbeom Kim , Haoqiang Zheng , Rajesh Venkatasubramanian , Puneet Zaroo
Abstract: Systems and methods for performing selection of non-uniform memory access (NUMA) nodes for mapping of virtual central processing unit (vCPU) operations to physical processors are provided. A CPU scheduler evaluates the latency between various candidate processors and the memory associated with the vCPU, and the size of the working set of the associated memory, and the vCPU scheduler selects an optimal processor for execution of a vCPU based on the expected memory access latency and the characteristics of the vCPU and the processors. The systems and methods further provide for monitoring system characteristics and rescheduling the vCPUs when other placements provide improved performance and efficiency.
-
公开(公告)号：US09529609B2
公开(公告)日：2016-12-27
申请号：US14101796
申请日：2013-12-10
Applicant: VMware, Inc.
Inventor： Xavier DeGuillard , Ishan Banerjee , Qasim Ali , Yury Baskakov , Kiran Tati , Rajesh Venkatasubramanian
CPC classification number: G06F9/455 , G06F9/45558 , G06F9/5016 , G06F9/5077 , G06F2009/45583 , G06F2212/152
Abstract: A system and method are disclosed for improving operation of a memory scheduler operating on a host machine supporting virtual machines (VMs) in which guest operating systems and guest applications run. For each virtual machine, the host machine hypervisor categorizes memory pages into memory usage classes and estimates the total number of pages for each memory usage class. The memory scheduler uses this information to perform memory reclamation and allocation operations for each virtual machine. The memory scheduler further selects between ballooning reclamation and swapping reclamation operations based in part on the numbers of pages in each memory usage class for the virtual machine. Calls to the guest operating system provide the memory usage class information. Memory reclamation not only can improve the performance of existing VMs, but can also permit the addition of a VM on the host machine without substantially impacting the performance of the existing and new VMs.
Abstract translation: 公开了一种系统和方法，用于改进在支持客机操作系统和来宾应用运行的虚拟机（VM）的主机上运行的存储器调度器的操作。 对于每个虚拟机，主机管理程序将内存页分为内存使用类，并估计每个内存使用类的总页数。 内存调度器使用该信息为每个虚拟机执行内存回收和分配操作。 存储器调度器还部分地基于虚拟机的每个存储器使用类别中的页数来选择气球回收和交换回收操作之间。 对客户机操作系统的调用提供了内存使用类信息。 内存回收不仅可以提高现有虚拟机的性能，还可以允许在主机上添加虚拟机，而不会对现有和新的虚拟机造成实质性的影响。
-
58.发明授权System and method for efficient swap space allocation in a virtualized environment 有权虚拟化环境中有效的交换空间分配的系统和方法公开(公告)号：US09524233B2
公开(公告)日：2016-12-20
申请号：US13785235
申请日：2013-03-05
Applicant: VMware, Inc.
Inventor： Rajesh Venkatasubramanian , Ishan Banerjee , Kiran Tati , Philip Peter Moltmann
CPC classification number: G06F12/023 , G06F3/0608 , G06F3/064 , G06F3/0665 , G06F3/0683 , G06F12/08 , G06F2212/152
Abstract: A technique for efficient swap space management creates a swap reservation file using thick provisioning to accommodate a maximum amount of memory reclamation from a set of one or more associated virtual machines (VMs). A VM swap file is created for each VM using thin provisioning. When a new block is needed to accommodate page swaps to a given VM swap file, a block is removed from the swap reservation file and a block is added to the VM swap file, thereby maintaining a net zero difference in overall swap storage. The removed block and the added block may be the same storage block if a block move operation is supported by a file system implementing the swap reservation file and VM swap files. The technique also accommodates swap space management of resource pools.
Abstract translation: 用于高效交换空间管理的技术使用厚配置来创建交换预留文件，以适应来自一组或多个相关虚拟机（VM）的最大量的内存回收。 使用精简配置为每个VM创建VM交换文件。 当需要新的块来容纳到给定的VM交换文件的页面交换时，从交换预留文件中移除一个块，并将一个块添加到VM交换文件中，从而在整个交换存储中保持净零点差异。 如果实施交换预留文件和VM交换文件的文件系统支持块移动操作，则移除的块和添加的块可能是相同的存储块。 该技术还适应资源池的交换空间管理。
-
公开(公告)号：US20150012722A1
公开(公告)日：2015-01-08
申请号：US13935382
申请日：2013-07-03
Applicant: VMware, Inc.
Inventor： Yury BASKAKOV , Alexander Thomas Garthwaite , Rajesh Venkatasubramanian , Irene Zhang , Seongbeom Kim , Nikhil Bhatia , Kiran Tati
IPC: G06F12/10
CPC classification number: G06F12/121 , G06F9/45558 , G06F12/023 , G06F12/1009 , G06F12/1027 , G06F2009/45583 , G06F2212/1016 , G06F2212/1044
Abstract: Memory performance in a computer system that implements large page mapping is improved even when memory is scarce by identifying page sharing opportunities within the large pages at the granularity of small pages and breaking up the large pages so that small pages within the large page can be freed up through page sharing. In addition, the number of small page sharing opportunities within the large pages can be used to estimate the total amount of memory that could be reclaimed through page sharing.
Abstract translation: 通过在小页面的大小页面上识别大页面中的页面共享机会，并分解大页面，使大页面中的小页面可以被释放，即使在内存不足的情况下，也可以提高实现大页面映射的计算机系统中的内存性能 通过页面共享。 此外，大页面中的小页面共享机会数量可用于估计可通过页面共享回收的总内存量。
-
公开(公告)号：US11762681B2
公开(公告)日：2023-09-19
申请号：US17190325
申请日：2021-03-02
Applicant: VMware, Inc.
Inventor： Avinash Goud , Aniket Sakhardande , Praveen Vegulla , Rajesh Venkatasubramanian , Maarten Wiggers , Keith Farkas , Derek Beard
CPC classification number: G06F9/45558 , G06F9/44505 , G06F9/45545 , G06F9/5077 , G06F2009/45591
Abstract: 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.
-
-
-
-
-
-
-
-
-
Search Results
111
records
(took 0.019 seconds)
