中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

35 records (took 0.015 seconds)

    Tuning key space at the time of instantiation of a tree data structure
    13.
    发明授权
    Tuning key space at the time of instantiation of a tree data structure 有权

    公开(公告)号：US10262016B2

    公开(公告)日：2019-04-16

    申请号：US14869099

    申请日：2015-09-29

    Applicant: VMware, Inc.

    Inventor： Ritesh Shukla ,  Serge Pashenkov ,  Li Ding ,  Bret Needle ,  Mayank Rawat

    IPC: G06F17/30

    Abstract: Techniques for tuning the key space of an instance of a tree data structure are provided. In one embodiment, a computer system can receive a request to create the instance, where the request includes an expected key space value indicating an expected range of key values to be addressed by the instance. The computer system can further calculate a number of bits to allocate to each key of each node of the instance based on the expected key space value. The computer system can then, at a time of instantiating each node of the instance, allocate the keys for the node in accordance with the calculated number of bits.

    LEVERAGING HIERARCHY IN A TREE DATA STRUCTURE TO DYNAMICALLY ALLOCATE KEYS
    15.
    发明申请
    LEVERAGING HIERARCHY IN A TREE DATA STRUCTURE TO DYNAMICALLY ALLOCATE KEYS 审中-公开

    公开(公告)号：US20170091241A1

    公开(公告)日：2017-03-30

    申请号：US14869024

    申请日：2015-09-29

    Applicant: VMware, Inc.

    Inventor： Serge Pashenkov ,  Ritesh Shukla ,  Li Ding ,  Bret Needle ,  Mayank Rawat

    IPC: G06F17/30

    CPC classification number: G06F17/30327 ,  G06F17/30958 ,  G06F17/30961

    Abstract: Techniques for dynamically allocating keys in an instance of a tree data structure are provided. In one embodiment, a computer system can, at a time of instantiating each non-root node in the instance, determine a key space to be addressed by the non-root node, where the key space is based on a key subinterval in a parent node of the non-root node that is associated with a pointer to the non-root node. The computer system can further calculate a number of bits to allocate to each key of the non-root node in view of the determined key space. The computer system can then allocate the keys of the non-root node in accordance with the calculated number of bits.

    Techniques for dynamically relocating virtual disk file blocks between flash storage and HDD-based storage
    16.
    发明授权
    Techniques for dynamically relocating virtual disk file blocks between flash storage and HDD-based storage 有权
    在闪存和基于HDD的存储之间动态重定位虚拟磁盘文件块的技术

    公开(公告)号：US09280300B2

    公开(公告)日：2016-03-08

    申请号：US13931309

    申请日：2013-06-28

    Applicant: VMware, Inc.

    Inventor： Deng Liu ,  Wei Zhang ,  Xiaoyun Zhu ,  Mayank Rawat ,  Sandeep Uttamchandani ,  Li Zhou ,  Jianzhe Tai

    IPC: G06F3/00 ,  G06F3/06

    CPC classification number: G06F3/0685 ,  G06F3/0604 ,  G06F3/061 ,  G06F3/0649

    Abstract: Techniques for dynamically managing the placement of blocks of a logical file between a flash storage tier and an HDD storage tier are provided. In one embodiment, a computer system can collect I/O statistics pertaining to the logical file, where a first subset of blocks of the logical file are stored on the flash storage tier and where a second subset of blocks of the logical file are stored on the HDD storage tier. The computer system can further generate a heat map for the logical file based on the I/O statistics, where the heat map indicates, for each block of the logical file, the number of times the block has been accessed. The computer system can then identify, using the heat map, one or more blocks of the logical file as being performance-critical blocks, and can move data between the flash and HDD storage tiers such that the performance-critical blocks are placed on the flash storage tier.

    Abstract translation: 提供了用于在闪存存储层和HDD存储层之间动态管理逻辑文件块的位置的技术。 在一个实施例中，计算机系统可以收集与逻辑文件相关的I / O统计信息，其中逻辑文件的块的第一子集存储在闪存存储层上，并且逻辑文件的块的第二子集存储在 HDD存储层。 计算机系统可以基于I / O统计信息进一步生成用于逻辑文件的热图，其中热图针对逻辑文件的每个块指示块被访问的次数。 计算机系统然后可以使用热图将逻辑文件的一个或多个块识别为性能关键块，并且可以在闪存和HDD存储层之间移动数据，使得性能关键块被放置在闪存上 存储层。

    Tracking data of virtual disk snapshots using tree data structures
    18.
    发明授权
    Tracking data of virtual disk snapshots using tree data structures 有权

    公开(公告)号：US10860560B2

    公开(公告)日：2020-12-08

    申请号：US15882123

    申请日：2018-01-29

    Applicant: VMware, Inc.

    Inventor： Mayank Rawat ,  Ritesh Shukla ,  Li Ding ,  Serge Pashenkov ,  Raveesh Ahuja

    IPC: G06F16/22 ,  G06F3/06 ,  G06F16/11

    Abstract: User data of different snapshots for the same virtual disk are stored in the same storage object. Similarly, metadata of different snapshots for the same virtual disk are stored in the same storage object, and log data of different snapshots for the same virtual disk are stored in the same storage object. As a result, the number of different storage objects that are managed for snapshots do not increase proportionally with the number of snapshots taken. In addition, any one of the multitude of persistent storage back-ends can be selected as the storage back-end for the storage objects according to user preference, system requirement, snapshot policy, or any other criteria. Another advantage is that the storage location of the read data can be obtained with a single read of the metadata storage object, instead of traversing metadata files of multiple snapshots.

Patent Agency Ranking