中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

11 records (took 0.041 seconds)

    Key-value store on persistent memory
    1.
    发明授权
    Key-value store on persistent memory 有权

    公开(公告)号：US11360863B2

    公开(公告)日：2022-06-14

    申请号：US16171649

    申请日：2018-10-26

    Applicant: HEWLETT PACKARD ENTERPRISE DEVELOPMENT LP

    Inventor： Srikant Varadan ,  Tomasz Barszczak ,  Hao Luo

    IPC: G06F11/14 ,  G06F11/20 ,  H04L67/1097 ,  G06F16/22

    Abstract: A technique for reducing recovery time in a computing apparatus includes: storing data in a key-value store residing in a persistent memory, the key-value store including a plurality of persistent nodes including key-value pairs, the key-value pairs of the persistent nodes being unsorted; caching selected persistent nodes in a volatile memory, the key-value pairs of the cached nodes being sorted, the caching including instantiating a dual pointer for each cached node, the dual pointer including a volatile pointer to a child node of the cached node and a persistent pointer to the child node of the corresponding persistent node in the key-value store; and rebuilding the cache of selected nodes upon demand using the dual pointers in the event of recovery.

    METADATA PARTITIONING ACROSS VIRTUAL PROCESSORS
    2.
    发明申请
    METADATA PARTITIONING ACROSS VIRTUAL PROCESSORS 有权

    公开(公告)号：US20240411579A1

    公开(公告)日：2024-12-12

    申请号：US18332828

    申请日：2023-06-12

    Applicant: HEWLETT PACKARD ENTERPRISE DEVELOPMENT LP

    Inventor： Vinay Devadas ,  Srikant Varadan ,  Christopher Joseph Corsi ,  Shrikant Pramod Mether

    IPC: G06F9/455

    Abstract: In some examples, a system creates a partition map that maps partitions of a data bucket to respective virtual processors executed in a cluster of computer nodes. Responsive to a request to access a data object in the data bucket, the system identifies which partition contains metadata for the data object based on a key associated with the data object, and identifies, based on the identified partition and using the partition map, a virtual processor that has the metadata for the data object. Responsive to a migration of a first virtual processor from a first to a second computer node, the system updates a virtual processor-computer node map that maps the respective virtual processors to corresponding computer nodes of the cluster of computer nodes, where the partition map remains unchanged in response to the migration of the first virtual processor from the first computer node to the second computer node.

    Processing of incoming blocks in deduplicating storage system
    3.
    发明授权
    Processing of incoming blocks in deduplicating storage system 有权

    公开(公告)号：US09977746B2

    公开(公告)日：2018-05-22

    申请号：US14919414

    申请日：2015-10-21

    Applicant: HEWLETT PACKARD ENTERPRISE DEVELOPMENT LP

    Inventor： Nitin Muppalaneni ,  Umesh Maheshwari ,  Steve Rodrigues ,  Srikant Varadan

    IPC: G06F3/06 ,  G06F12/1009

    CPC classification number: G06F12/1009 ,  G06F3/0641 ,  G06F2212/65

    Abstract: Methods, systems, and computer programs are presented for deduplicating data. One method includes an operation for receiving a data block having a logical address. The storage system includes a logical address mapping index for mapping logical addresses to block numbers, a block index for mapping block numbers to physical locations, and a fingerprint index for mapping fingerprints of data blocks to block numbers. Additionally, the method includes an operation for inline processing the data block. Inline processing the data block includes determining a fingerprint of the data block, examining the fingerprint index to determine if the fingerprint is already mapped to an existing data block in the storage system, if the fingerprint is already mapped then adding a mapping of the logical address to the existing data block in the logical address mapping index, and if the fingerprint is not already mapped then creating the corresponding entries in the indices.

    Variable extent size
    4.
    发明授权
    Variable extent size 有权

    公开(公告)号：US11989436B2

    公开(公告)日：2024-05-21

    申请号：US17813075

    申请日：2022-07-18

    Applicant: Hewlett Packard Enterprise Development LP

    Inventor： Srikant Varadan

    IPC: G06F3/06

    CPC classification number: G06F3/0644 ,  G06F3/0608 ,  G06F3/0641 ,  G06F3/0673

    Abstract: Examples described herein relate to selection and variation of extent size thresholds in a storage volume. Examples may select an extent size threshold for a volume according to a type of application that is to store data on the volume. Examples may dynamically vary the extent size threshold based on data reduction metrics, such as deduplication ratio and/or compression ratio. Examples may dynamically vary the extent size threshold for the volume based on cache performance metrics, such as cache miss rate. Examples may dynamically vary the extent size threshold for the volume based on an amount of dead storage space corresponding to partially overwritten extents in the volume.

    Chunk and snapshot deletions
    5.
    发明授权
    Chunk and snapshot deletions 有权

    公开(公告)号：US11989097B2

    公开(公告)日：2024-05-21

    申请号：US17659583

    申请日：2022-04-18

    Applicant: HEWLETT PACKARD ENTERPRISE DEVELOPMENT LP

    Inventor： Srikant Varadan

    IPC: G06F11/14

    CPC classification number: G06F11/1453 ,  G06F11/1458 ,  G06F2201/84

    Abstract: In some examples, a system maintains mapping metadata for data in storage, the data divided into chunks, the mapping metadata comprising chunk entries mapping chunk identifiers of the chunks to storage locations, wherein the chunk identifiers are monotonically increasing as chunks are created. The system updates an epoch in response to triggering a creation of a snapshot of the data. In response to a deletion of a first chunk, the system updates a first chunk entry for the first chunk to include a creation epoch identifier and a deletion epoch identifier for the first chunk. In response to a deletion of a first snapshot of the multiple snapshots, the system uses the creation epoch identifier and the deletion epoch identifier to determine whether to remove the first chunk entry from the mapping metadata.

    CHUNK AND SNAPSHOT DELETIONS
    6.
    发明公开
    CHUNK AND SNAPSHOT DELETIONS 审中-公开

    公开(公告)号：US20230333939A1

    公开(公告)日：2023-10-19

    申请号：US17659583

    申请日：2022-04-18

    Applicant: HEWLETT PACKARD ENTERPRISE DEVELOPMENT LP

    Inventor： Srikant Varadan

    IPC: G06F11/14

    CPC classification number: G06F11/1453 ,  G06F11/1458 ,  G06F2201/84

    Abstract: In some examples, a system maintains mapping metadata for data in storage, the data divided into chunks, the mapping metadata comprising chunk entries mapping chunk identifiers of the chunks to storage locations, wherein the chunk identifiers are monotonically increasing as chunks are created. The system updates an epoch in response to triggering a creation of a snapshot of the data. In response to a deletion of a first chunk, the system updates a first chunk entry for the first chunk to include a creation epoch identifier and a deletion epoch identifier for the first chunk. In response to a deletion of a first snapshot of the multiple snapshots, the system uses the creation epoch identifier and the deletion epoch identifier to determine whether to remove the first chunk entry from the mapping metadata.

    DATA ACCESS IN A COLLECTION OF COMPUTING NODES
    8.
    发明公开
    DATA ACCESS IN A COLLECTION OF COMPUTING NODES 审中-公开

    公开(公告)号：US20240354144A1

    公开(公告)日：2024-10-24

    申请号：US18305481

    申请日：2023-04-24

    Applicant: HEWLETT PACKARD ENTERPRISE DEVELOPMENT LP

    Inventor： Vinay Devadas ,  Srikant Varadan ,  Christopher Joseph Corsi

    IPC: G06F9/455 ,  G06F3/06

    CPC classification number: G06F9/45558 ,  G06F3/061 ,  G06F3/0659 ,  G06F3/0673 ,  G06F2009/45583

    Abstract: In some examples, a first computing node receives a write request, where the first computing node is part of a collection of multiple computing nodes, and a plurality of virtual processors are executable in the multiple computing nodes to manage access of data in a shared storage system. In response to the write request, a first virtual processor at the first computing node sends, to a second virtual processor, a request for metadata stored by the second virtual processor. The first virtual processor updates an intent structure in a nonvolatile memory with information indicating an intent to write data for the write request. In response to the metadata received at the first virtual processor from the second virtual processor, a write of the data is initiated to cause storage of the data in the shared storage system.

    VARIABLE EXTENT SIZE
    9.
    发明公开
    VARIABLE EXTENT SIZE 审中-公开

    公开(公告)号：US20240020041A1

    公开(公告)日：2024-01-18

    申请号：US17813075

    申请日：2022-07-18

    Applicant: Hewlett Packard Enterprise Development LP

    Inventor： Srikant Varadan

    IPC: G06F3/06

    CPC classification number: G06F3/0644 ,  G06F3/0641 ,  G06F3/0608 ,  G06F3/0673

    Abstract: Examples described herein relate to selection and variation of extent size thresholds in a storage volume. Examples may select an extent size threshold for a volume according to a type of application that is to store data on the volume. Examples may dynamically vary the extent size threshold based on data reduction metrics, such as deduplication ratio and/or compression ratio. Examples may dynamically vary the extent size threshold for the volume based on cache performance metrics, such as cache miss rate. Examples may dynamically vary the extent size threshold for the volume based on an amount of dead storage space corresponding to partially overwritten extents in the volume.

Patent Agency Ranking