中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

35 records (took 0.014 seconds)

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

    公开(公告)号：US09881040B2

    公开(公告)日：2018-01-30

    申请号：US14831808

    申请日：2015-08-20

    Applicant: VMware, Inc.

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

    IPC: G06F3/06 ,  G06F17/30

    CPC classification number: G06F17/30327 ,  G06F3/0608 ,  G06F3/0641 ,  G06F3/067 ,  G06F17/30088

    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.

    Method and system for parallelizing data copy in a distributed file system
    24.
    发明授权
    Method and system for parallelizing data copy in a distributed file system 有权
    在分布式文件系统中并行化数据复制的方法和系统

    公开(公告)号：US09305014B2

    公开(公告)日：2016-04-05

    申请号：US14263196

    申请日：2014-04-28

    Applicant: VMware, Inc.

    Inventor： Christopher Frost ,  Jinyuan Li ,  Mayank Rawat ,  Murali Vilayannur

    IPC: G06F17/30

    CPC classification number: G06F17/302 ,  G06F17/30194 ,  G06F17/30215 ,  G06F17/30575

    Abstract: Multiple servers sharing a distributed file system are used to perform copies of regions of a source file in parallel from a source storage unit to corresponding temporary files at a destination storage unit. These temporary files are then merged or combined into a single file at the destination storage unit in a way that preserves the inode structure and attributes of the source file. A substantial speedup is obtained by copying regions of the file in parallel.

    Abstract translation: 共享分布式文件系统的多个服务器用于从源存储单元并行地执行源文件区域的副本到目的地存储单元处的相应临时文件。 然后将这些临时文件以保存源文件的inode结构和属性的方式合并或组合到目标存储单元中的单个文件中。 通过并行复制文件的区域可以获得实质的加速。

    TECHNIQUES FOR IMPLEMENTING HYBRID FLASH/HDD-BASED VIRTUAL DISK FILES
    25.
    发明申请
    TECHNIQUES FOR IMPLEMENTING HYBRID FLASH/HDD-BASED VIRTUAL DISK FILES 有权
    用于实施混合闪存/基于HDD的虚拟磁盘文件的技术

    公开(公告)号：US20160042005A1

    公开(公告)日：2016-02-11

    申请号：US14918569

    申请日：2015-10-21

    Applicant: VMWARE, INC.

    Inventor： DENG LIU ,  Sandeep Uttamchandani ,  Li Zhou ,  Mayank Rawat

    IPC: G06F17/30 ,  G06F9/455 ,  G06F3/06

    CPC classification number: G06F17/30132 ,  G06F3/0604 ,  G06F3/0611 ,  G06F3/0613 ,  G06F3/0643 ,  G06F3/0655 ,  G06F3/0659 ,  G06F3/0679 ,  G06F3/0685 ,  G06F9/455 ,  G06F9/45558 ,  G06F17/30233 ,  G06F2009/45579 ,  G06F2212/217

    Abstract: Techniques for utilizing flash storage as an extension of hard disk (HDD) storage are provided. In one embodiment, a computer system stores a subset of blocks of a logical file in a first physical file, associated with a first data structure that represents a filesystem object, on flash storage and a subset of blocks, associated with a second data structure that represents a filesystem object comprising tiering configuration information that includes an identifier of the first physical file, in a second physical file on HDD storage. The computer system processes an I/O request directed to the logical file by directing it to either the physical file on the flash storage or the HDD storage by verifying that the tiering configuration information exists in the data structure and determining whether the one or more blocks are part of the first subset of blocks or the second subset of blocks.

    Abstract translation: 提供了使用闪存作为硬盘（HDD）存储的扩展的技术。 在一个实施例中，计算机系统将逻辑文件的块的子集存储在第一物理文件中，该第一物理文件与代表文件系统对象的第一数据结构相关联，所述第一数据结构表示文件系统对象，与闪存存储器相关联的块子集， 代表在HDD存储器的第二物理文件中包括包括第一物理文件的标识符的分层配置信息的文件系统对象。 计算机系统通过将数据结构中存在分层配置信息并确定一个或多个块来确定指向该逻辑文件的I / O请求，该I / O请求通过将其指向闪存存储器或HDD存储器上的物理文件 是块的第一子集或块的第二子集的一部分。

    Techniques for implementing hybrid flash/HDD-based virtual disk files
    26.
    发明授权
    Techniques for implementing hybrid flash/HDD-based virtual disk files 有权

    公开(公告)号：US10657101B2

    公开(公告)日：2020-05-19

    申请号：US15990360

    申请日：2018-05-25

    Applicant: VMware, Inc.

    Inventor： Deng Liu ,  Sandeep Uttamchandani ,  Li Zhou ,  Mayank Rawat

    IPC: G06F16/00 ,  G06F16/172 ,  G06F3/06 ,  G06F9/455 ,  G06F16/188

    Abstract: Techniques for utilizing flash storage as an extension of hard disk (HDD) storage are provided. In one embodiment, a computer system stores a subset of blocks of a logical file in a first physical file, associated with a first data structure that represents a filesystem object, on flash storage and a subset of blocks, associated with a second data structure that represents a filesystem object comprising tiering configuration information that includes an identifier of the first physical file, in a second physical file on HDD storage. The computer system processes an I/O request directed to the logical file by directing it to either the physical file on the flash storage or the HDD storage by verifying that the tiering configuration information exists in the data structure and determining whether the one or more blocks are part of the first subset of blocks or the second subset of blocks.

    Tuning Key Space at the Time of Instantiation of a Tree Data Structure
    30.
    发明申请
    Tuning Key Space at the Time of Instantiation of a Tree Data Structure 审中-公开

    公开(公告)号：US20170091242A1

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

    申请号：US14869099

    申请日：2015-09-29

    Applicant: VMware, Inc.

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

    IPC: G06F17/30

    CPC classification number: G06F17/30327

    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.

Patent Agency Ranking