公开(公告)号：US09658878B2

公开(公告)日：2017-05-23

申请号：US14467974

申请日：2014-08-25

Applicant: VMware, Inc.

Inventor： Daniel R. K. Ports ,  Xiaoxin Chen ,  Carl A. Waldspurger ,  Pratap Subrahmanyam ,  Tal Garfinkel

IPC: G06F9/46 ,  G06F11/14 ,  G06F9/48 ,  G06F9/455 ,  G06F9/44

CPC classification number: G06F9/461 ,  G06F9/4486 ,  G06F9/45533 ,  G06F9/45558 ,  G06F9/4881 ,  G06F11/1451 ,  G06F11/1484 ,  G06F2009/45562 ,  G06F2009/45583 ,  G06F2201/815 ,  G06F2201/84

Abstract: A virtual-machine-based system provides a mechanism to implement application file I/O operations of protected data by implementing the I/O operations semantics in a shim layer with memory-mapped regions. The semantics of these I/O operations are emulated in a shim layer with memory-mapped regions by using a mapping between a process' address space and a file or shared memory object. Data that is protected from viewing by a guest OS running in a virtual machine may nonetheless be accessed by the process.

公开(公告)号：US09632808B2

公开(公告)日：2017-04-25

申请号：US14273022

申请日：2014-05-08

Applicant: VMware, Inc.

Inventor： Haoqiang Zheng ,  Carl A. Waldspurger

IPC: G06F9/46 ,  G06F9/455 ,  G06F9/48 ,  G06F9/52

CPC classification number: G06F9/45533 ,  G06F9/45545 ,  G06F9/45558 ,  G06F9/46 ,  G06F9/485 ,  G06F9/4881 ,  G06F9/522 ,  G06F2009/4557 ,  G06F2009/45575

Abstract: Techniques for implicit coscheduling of CPUs to improve corun performance of scheduled contexts are described. One technique minimizes skew by implementing corun migrations, and another technique minimizes skew by implementing a corun bonus mechanism. Skew between schedulable contexts may be calculated based on guest progress, where guest progress represents time spent executing guest operating system and guest application code. A non-linear skew catch-up algorithm is described that adjusts the progress of a context when the progress falls far behind its sibling contexts.

公开(公告)号：US09563453B2

公开(公告)日：2017-02-07

申请号：US14508685

申请日：2014-10-07

Applicant: VMware, Inc.

Inventor： Ajay Gulati ,  Irfan Ahmad ,  Ganesha Shanmuganathan ,  Carl A. Waldspurger

IPC: G06F9/50 ,  G06F9/455 ,  H04L29/08 ,  G06F11/34

CPC classification number: G06F9/45533 ,  G06F9/5088 ,  G06F11/3433 ,  G06F2201/815 ,  H04L67/1008

Abstract: One or more embodiments of the present invention provide a technique for effectively managing virtualized computing systems with an unlimited number of hardware resources. Host systems included in a virtualized computer system are organized into a scalable, peer-to-peer (P2P) network in which host systems arrange themselves into a network overlay to communicate with one another. The network overlay enables the host systems to perform a variety of operations, which include dividing computing resources of the host systems among a plurality of virtual machines (VMs), load balancing VMs across the host systems, and performing an initial placement of a VM in one of the host systems.

Abstract translation: 本发明的一个或多个实施例提供了一种用于以无限数量的硬件资源有效地管理虚拟化计算系统的技术。 包括在虚拟化计算机系统中的主机系统被组织成可扩展的对等（P2P）网络，其中主机系统将其自身布置成网络覆盖以便彼此通信。 网络覆盖使得主机系统能够执行各种操作，其包括在多个虚拟机（VM）中划分主机系统的计算资源，跨主机系统负载平衡VM，以及执行VM的初始放置 其中一个主机系统。

公开(公告)号：US08719545B2

公开(公告)日：2014-05-06

申请号：US13670223

申请日：2012-11-06

Applicant: VMware, Inc.

Inventor： Vivek Pandey ,  Ole Agesen ,  Alexander Thomas Garthwaite ,  Carl A. Waldspurger ,  Rajesh Venkatasubramanian

IPC: G06F13/00 ,  G06F13/28

CPC classification number: G06F9/5033 ,  G06F9/45558 ,  G06F9/4856 ,  G06F2009/4557

Abstract: A system and related method of operation for migrating the memory of a virtual machine from one NUMA node to another. Once the VM is migrated to a new node, migration of memory pages is performed while giving priority to the most utilized pages, so that access to these pages becomes local as soon as possible. Various heuristics are described to enable different implementations for different situations or scenarios.

Abstract translation: 将虚拟机的存储器从一个NUMA节点迁移到另一个NUMA节点的系统和相关操作方法。 一旦将VM迁移到新节点，就会在优先使用最多的页面的同时执行内存页面的迁移，以便尽快访问这些页面。 描述了各种启发式方法，以实现不同情况或场景的不同实现。

公开(公告)号：US10241819B2

公开(公告)日：2019-03-26

申请号：US15055468

申请日：2016-02-26

Applicant: VMware, Inc.

Inventor： Xiaoxin Chen ,  Carl A. Waldspurger ,  Pratap Subrahmanyam

IPC: G06F9/455 ,  G06F12/109 ,  G06F12/14

Abstract: Virtualization software establishes multiple execution environments within a virtual machine, wherein software modules executing in one environment cannot access private memory of another environment. A separate set of shadow memory address mappings is maintained for each execution environment. For example, a separate shadow page table may be maintained for each execution environment. The virtualization software ensures that the shadow address mappings for one execution environment do not map to the physical memory pages that contain the private code or data of another execution environment. When execution switches from one execution environment to another, the virtualization software activates the shadow address mappings for the new execution environment. A similar approach, using separate mappings, may also be used to prevent software modules in one execution environment from accessing the private disk space or other secondary storage of another execution environment.

公开(公告)号：US20180203630A1

公开(公告)日：2018-07-19

申请号：US15918463

申请日：2018-03-12

Applicant: VMware, Inc.

Inventor： Carl A. Waldspurger

IPC: G06F3/06 ,  G06F9/48 ,  H04L12/26 ,  H04L12/917 ,  G06F9/50 ,  H04L12/24

CPC classification number: G06F3/0631 ,  G06F3/0604 ,  G06F3/0653 ,  G06F3/0683 ,  G06F9/4881 ,  G06F9/5016 ,  H04L41/5054 ,  H04L43/04 ,  H04L43/08 ,  H04L47/76

Abstract: A method and tangible medium embodying code for allocating resource units of an allocatable resource among a plurality of clients in a computer is described. In the method, resource units are initially distributed among the clients by assigning to each of the clients a nominal share of the allocatable resource. For each client, a current allocation of resource units is determined. A metric is evaluated for each client, the metric being a function both of the nominal share and a usage-based factor, the usage-based factor being a function of a measure of resource units that the client is actively using and a measure of resource units that the client is not actively using. A resource unit can be reclaimed from a client when the metric for that client meets a predetermined criterion.