System and method for creating linked clones of storage objects with surface snapshots

    公开(公告)号:US11099938B2

    公开(公告)日:2021-08-24

    申请号:US16051456

    申请日:2018-07-31

    Applicant: VMware, Inc.

    Abstract: System and method for creating linked clones of storage objects stored in a storage uses a target storage structure that includes a linked clone being created from a selected snapshot of a storage object and surface snapshots. The linked clone is created in the target storage structure with references to the selected snapshot of the storage object in a source storage structure without completely copying the selected snapshot to the target storage structure. The surface snapshots, which correspond to other snapshots of the storage object in the source storage structure, are created in the target storage structure with references to the other snapshots without completely copying the other snapshots to the target storage structure to produce the linked clone with similar snapshots as the storage object at a point in time when the selected snapshot was captured.

    TREE STRUCTURE AWARE CACHE EVICTION POLICY
    13.
    发明申请

    公开(公告)号:US20200175074A1

    公开(公告)日:2020-06-04

    申请号:US16209965

    申请日:2018-12-04

    Applicant: VMware, Inc.

    Abstract: Nodes in tree data structure can be cached in a cache memory. When the cache memory becomes full, an eviction policy selects cached nodes based on their location in the tree data structure. The eviction policy selects cached nodes that correspond to leaf nodes in the tree data structure as candidates for eviction. The eviction policy selects cached nodes that correspond to internal (non-leaf) nodes from the lowest level possible for eviction, only if there are no cached leaf nodes.

    EFFICIENT GLOBAL CACHE PARTITION AND DYNAMIC SIZING FOR SHARED STORAGE WORKLOADS

    公开(公告)号:US20200142828A1

    公开(公告)日:2020-05-07

    申请号:US16178515

    申请日:2018-11-01

    Applicant: VMware, Inc.

    Abstract: A shared cache memory can be logically partitioned among different workloads to provide isolation between workloads and avoid excessive resource contention. Each logical partition is apportioned a share of the cache memory, and is exclusive to a respective one of the workloads. Each partition has an initial size allocation. Historical data can be collected and processed for each partition and used to periodically update its size allocation.

    SYSTEM AND METHOD FOR MANAGING DIFFERENT TYPES OF SNAPSHOTS OF STORAGE OBJECTS

    公开(公告)号:US20200065196A1

    公开(公告)日:2020-02-27

    申请号:US16112703

    申请日:2018-08-25

    Applicant: VMware, Inc.

    Abstract: System and method for managing different types of snapshots of storage objects stored in a storage system uses a storage structure that includes both a storage object and any snapshots of the storage object. When a request to delete a snapshot of the storage object is received, a determination is made whether the snapshot is a first snapshot type. After determining that the snapshot is not the first snapshot type, the snapshot is deleted from the storage structure. After determining that the snapshot is the first snapshot type, the snapshot is marked as delete designated, and a deletion of the snapshot from the storage structure is prevented when there is a second snapshot type snapshot remaining in the storage structure that was created after the snapshot had been created so that the snapshot is available when the second snapshot type snapshot is subsequently used.

    WATERMARKING AND SCALABILITY TECHNIQUES FOR A VIRTUAL DESKTOP PLANNING TOOL
    16.
    发明申请
    WATERMARKING AND SCALABILITY TECHNIQUES FOR A VIRTUAL DESKTOP PLANNING TOOL 审中-公开
    虚拟桌面计划工具的水印和可扩展性技术

    公开(公告)号:US20170011486A1

    公开(公告)日:2017-01-12

    申请号:US15276525

    申请日:2016-09-26

    Applicant: VMware, Inc.

    Abstract: A method for measuring performance of virtual desktop services offered by a server including a processor is described. A first encoded watermark is embedded into user interface display generated by a virtual desktop when initiating an operation. The first encoded watermark includes pixels identifying the operation and indicating its initiation. A second encoded watermark is embedded into the user interface upon completion of the operation indicating completion of the operation. An action performance time is then computed and stored in a memory. Multiple performance times may be compiled from multiple operations of multiple virtual desktops to assess the performance of the system as a whole.

    Abstract translation: 描述了一种用于测量由包括处理器的服务器提供的虚拟桌面服务的性能的方法。 当启动操作时,第一编码水印被嵌入到由虚拟桌面产生的用户界面显示中。 第一编码水印包括识别操作并指示其启动的像素。 完成操作完成后的第二编码水印被嵌入到用户界面中。 然后计算动作演奏时间并将其存储在存储器中。 可以从多个虚拟桌面的多个操作中编译多个性能时间,以评估整个系统的性能。

    Storage performance by heuristically coalescing IO requests
    17.
    发明授权
    Storage performance by heuristically coalescing IO requests 有权
    通过启发式地结合IO请求来实现存储性能

    公开(公告)号:US09411623B1

    公开(公告)日:2016-08-09

    申请号:US13849249

    申请日:2013-03-22

    Applicant: VMware, Inc.

    CPC classification number: G06F9/45558 G06F2009/45579

    Abstract: A method for coalescing IO requests includes maintaining a queue in a layer of an IO stack of a hypervisor, wherein (i) the queue holds IO requests received from an upper layer of the IO stack without forwarding the IO requests down the IO stack, and (ii) the layer of the IO stack resides above a file system layer of the IO stack. The method further includes receiving, at the layer, an IO request from the upper layer or a notification of a completion of certain IO requests previously transmitted by the layer down the IO stack. The method further includes determining whether any IO requests currently held in the queue should be transmitted down the IO stack based upon a condition; and combining any IO requests in the queue into at least one combined IO request to transmit down the IO stack if the condition is satisfied.

    Abstract translation: 用于聚合IO请求的方法包括在管理程序的IO堆栈的层中维护队列,其中(i)队列保持从IO栈的上层接收到的IO请求,而不将IO请求转发到IO堆栈之下,以及 (ii)IO堆栈的层位于IO堆栈的文件系统层之上。 该方法还包括在层上接收来自上层的IO请求或者在先前由层叠在IO堆栈之前传输的某些IO请求的完成的通知。 该方法还包括基于条件确定当前保存在队列中的任何IO请求是否应当被向下传送到IO栈; 并且将队列中的任何IO请求组合成至少一个组合的IO请求以在满足条件的情况下向下传送IO堆栈。

Patent Agency Ranking