中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

3503 records (took 0.051 seconds)

    Memory Efficient Lookup Structure
    363.
    发明申请
    Memory Efficient Lookup Structure 审中-公开

    公开(公告)号：US20170316041A1

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

    申请号：US15142828

    申请日：2016-04-29

    Applicant: NetApp, Inc.

    Inventor： William P. Delaney ,  Joseph Blount ,  Charles Binford ,  Joseph Moore ,  Randolph Sterns ,  Jeff Stilger

    IPC: G06F17/30

    CPC classification number: G06F16/2246 ,  G06F16/2237 ,  G06F16/9017

    Abstract: A method for mapping a first address space to a second address space is provided. In some embodiments, the method includes creating a first array of lookup entries and one or more second arrays of metadata entries for maintaining an ordering among the lookup entries using a tree structure. Each of the metadata entries includes one or more data index values identifying a corresponding one of the lookup entries by its position in the first array and one or more metadata index values identifying a corresponding one of the metadata entries by its position in one of the one or more second arrays. The method further includes receiving a request including a lookup value, traversing the tree structure to locate a lookup entry corresponding to the lookup value, and when the lookup value is located among the lookup entries, using the located lookup entry to process the request.

    GRANSETS FOR MANAGING CONSISTENCY GROUPS OF DISPERSED STORAGE ITEMS
    365.
    发明申请
    GRANSETS FOR MANAGING CONSISTENCY GROUPS OF DISPERSED STORAGE ITEMS 审中-公开

    公开(公告)号：US20170316029A1

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

    申请号：US15140992

    申请日：2016-04-28

    Applicant: NetApp Inc.

    Inventor： Devang Kundanlal Shah ,  Dipankar Roy ,  Krishnaveni Budati ,  Kai Tan ,  Pranab Patnaik ,  Akhil Kaushik

    IPC: G06F17/30

    CPC classification number: G06F16/178 ,  G06F3/0605 ,  G06F3/065 ,  G06F3/0665 ,  G06F3/067 ,  G06F16/122 ,  G06F16/128

    Abstract: One or more techniques and/or computing devices are provided for managing an arbitrary set of storage items using a granset. For example, a storage controller may host a plurality of storage items and/or logical unit numbers (LUNs). A subset of the storage items are grouped into a consistency group. A granset is created for tracking, managing, and/or providing access to the storage items within the consistency group. For example, the granset comprises application programming interfaces (APIs) and/or properties used to provide certain levels of access to the storage items (e.g., read access, write access, no access), redirect operations to access either data of an active file system or to a snapshot, fence certain operations (e.g., rename and delete operations), and/or other properties that apply to each storage item within the consistency group. Thus, the granset provides a persistent on-disk layout used to manage an arbitrary set of storage items.

    CACHE SCORING SCHEME FOR A CLOUD-BACKED DEDUPLICATION STORAGE SYSTEM
    366.
    发明申请
    CACHE SCORING SCHEME FOR A CLOUD-BACKED DEDUPLICATION STORAGE SYSTEM 审中-公开

    公开(公告)号：US20170315930A1

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

    申请号：US15141447

    申请日：2016-04-28

    Applicant: NetApp, Inc.

    Inventor： Vinay Hangud ,  Sharad Jain ,  Sudhindra Prasad Tirupati Nagaraj

    IPC: G06F12/121

    CPC classification number: G06F12/121 ,  G06F12/0804 ,  G06F12/0868 ,  G06F2212/1021

    Abstract: Exemplary embodiments relate to cache replacement schemes. Incoming data may be sorted into buckets. When it comes time to replace information in the cache, an entire bucket may be eliminated or replaced at once. By sorting incoming data into the buckets and performing cache replacement on a bucket-by-bucket basis, cache fragmentation is reduced. Moreover, the buckets may be scored based on characteristics of the data in the buckets (e.g., whether a data item is cold archived, whether a customer has pinned the data item, or whether the customer has requested early eviction of the data item). By accounting for these metrics when the cache score is calculated, cache usage and hit rates may be improved. According to exemplary embodiments, scoring may be applied to entire buckets, or may be applied to individual cache items (e.g., for use as a cache replacement metric in a cache eviction scheme).

    EFFICIENT REPAIR OF B+ TREE DATABASES WITH VARIABLE-LENGTH RECORDS
    367.
    发明申请
    EFFICIENT REPAIR OF B+ TREE DATABASES WITH VARIABLE-LENGTH RECORDS 有权

    公开(公告)号：US20170315881A1

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

    申请号：US15142850

    申请日：2016-04-29

    Applicant: NetApp, Inc.

    Inventor： Richard P. JERNIGAN, IV

    IPC: G06F11/14 ,  G06F17/30

    CPC classification number: G06F11/1471 ,  G06F2201/80 ,  G06F2201/805

    Abstract: Presented herein are methods, non-transitory computer readable media, and devices for efficiently repairing tree databases with variable-length records. Methods for repairing tree databases with variable-length records are disclosed which include: iterating the tree database, detecting at least one recoverable leaf block, reducing the at least one recoverable leaf block to its legally formatted contents, and writing the at least one recoverable leaf block back into the tree database; processing the at least one recoverable leaf block to ensure the at least one recoverable leaf block represents a disjoint region within a record space within the tree database; and rebuilding branch blocks as necessary to provide a lookup and organizational index for the at least one recoverable leaf block.

    NAMESPACE POLICY BASED DEDUPLICATION INDEXES
    368.
    发明申请
    NAMESPACE POLICY BASED DEDUPLICATION INDEXES 审中-公开

    公开(公告)号：US20170315875A1

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

    申请号：US15143133

    申请日：2016-04-29

    Applicant: NetApp, Inc.

    Inventor： Sudhindra Prasad Tirupati Nagaraj ,  Pramodh Pisupati ,  Gregory Thomas Taleck

    IPC: G06F11/14 ,  G06F17/30

    CPC classification number: G06F11/1453 ,  G06F11/1451 ,  G06F11/1464 ,  G06F16/215 ,  G06F16/22 ,  G06F16/2272 ,  G06F16/2365 ,  G06F2201/82

    Abstract: A cloud storage gateway device can be used to deduplicate data across different namespaces while complying with SLOs that govern data of the different namespaces. A cloud storage gateway device can use multiple fingerprint indexes to comply with different SLOs. Each fingerprint index corresponds to a different SLO. Thus, the cloud storage gateway device deduplicates data against other data governed by a same SLO. Assuming an SLO aligns or indicates a cloud storage target, the cloud storage gateway device will deduplicate data against other data that will eventually migrate from the device to a same cloud storage target. The cloud storage gateway device ensures satisfaction of the governing SLO(s) from receipt of data, through deduplication, to the migration of the data to a cloud storage target.

    Drive Wear-Out Prediction Based on Workload and Risk Tolerance
    369.
    发明申请
    Drive Wear-Out Prediction Based on Workload and Risk Tolerance 有权

    公开(公告)号：US20170315753A1

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

    申请号：US15142923

    申请日：2016-04-29

    Applicant: NetApp, Inc.

    Inventor： Joseph Blount

    IPC: G06F3/06

    CPC classification number: G06F3/0649 ,  G06F3/0616 ,  G06F3/0631 ,  G06F3/0632 ,  G06F3/0644 ,  G06F3/0679 ,  G06F3/0688 ,  G06F3/0689

    Abstract: A system and method for optimizing the estimation and management of wear and replacement for an array of storage devices in a storage system is disclosed. An input/output workload is monitored over part of a service period for the array. An expected wear rate is determined, based on the workload and an endurance of the storage devices. A target wear rate is calculated for the service period and each of one or more contingency periods, based on the expected wear rate and a specified risk tolerance for each period. In response to determining that the expected wear rate exceeds the target wear rate calculated for at least one of the service period and the contingency period(s), an adjusted wear rate is calculated for the array of storage devices to match the target wear rate. A replacement schedule is generated for the array based on the adjusted wear rate.

    Coalescing metadata for mirroring to a remote storage node in a cluster storage system
    370.
    发明授权
    Coalescing metadata for mirroring to a remote storage node in a cluster storage system 有权

    公开(公告)号：US09805052B2

    公开(公告)日：2017-10-31

    申请号：US13752251

    申请日：2013-01-28

    Applicant: NetApp, Inc.

    Inventor： Harihara S. Kadayam

    IPC: G06F11/20 ,  G06F17/30

    CPC classification number: G06F17/30194 ,  G06F11/2066

    Abstract: Described herein are a system and method for remote mirroring/copying data and metadata sets from a local node to a remote node that reduces the number of metadata sets that are mirrored. In some embodiments, the local node may coalesce metadata sets into metadata chains, each metadata chain comprising a grouping of two or more metadata sets. In some instances, a “representative” metadata set of a metadata chain may be selected for sending to the remote node for storing, wherein the other metadata sets of the metadata chain are not sent to the remote node. In these embodiments, the selected metadata set may represent all the metadata sets in the chain and be the only metadata set in the chain that is transmitted and stored to the remote node. As such, the network congestion between the local and remote nodes may be reduced.

Patent Agency Ranking