中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

3810 records (took 0.068 seconds)

    N-way merge technique for updating volume metadata in a storage I/O stack
    311.
    发明授权
    N-way merge technique for updating volume metadata in a storage I/O stack 有权

    公开(公告)号：US09836229B2

    公开(公告)日：2017-12-05

    申请号：US14546214

    申请日：2014-11-18

    Applicant: NetApp, Inc.

    Inventor： Janice D'Sa ,  Ling Zheng ,  Blake H. Lewis

    IPC: G06F3/06 ,  H04L29/08

    CPC classification number: G06F3/0619 ,  G06F3/0607 ,  G06F3/0626 ,  G06F3/0644 ,  G06F3/0665 ,  G06F3/067 ,  G06F3/0689 ,  H04L67/1097

    Abstract: A N-way merge technique efficiently updates metadata in accordance with a N-way merge operation managed by a volume layer of a storage input/output (I/O) stack executing on one or more nodes of a cluster. The metadata is embodied as mappings from logical block addresses (LBAs) of a logical unit (LUN) accessible by a host to durable extent keys, and is organized as a multi-level dense tree. The mappings are organized such that a higher level of the dense tree contains more recent mappings than a next lower level, i.e., the level immediately below. The N-way merge operation is an efficient (i.e., optimized) way of updating the volume metadata mappings of the dense tree by merging the mapping content of all three levels in a single iteration, as opposed to merging the content of the first level with the content of the second level in a first iteration of a two-way merge operation and then merging the results of the first iteration with the content of the third level in a second iteration of the operation.

    Data migration preserving storage efficiency
    312.
    发明授权
    Data migration preserving storage efficiency 有权

    公开(公告)号：US09832260B2

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

    申请号：US14494450

    申请日：2014-09-23

    Applicant: NetApp, Inc.

    Inventor： Keith Bare, II ,  Jonathan Curley

    IPC: H04L29/08 ,  G06F3/06

    CPC classification number: H04L67/1095 ,  G06F3/0619 ,  G06F3/0647 ,  G06F3/0685 ,  H04L67/1097

    Abstract: Technology is disclosed for a data migration process for a storage server that preserves storage efficiency information. The storage server receives an indication of a group of two or more files and selects among the two or more files a reference file and one or more selected files. The storage server initiates a first migration operation to copy or move the reference file from a source storage server to a destination storage server. The storage server initiates one or more additional migration operations to copy or move the selected files from the source storage server to the destination storage server. At least one of the additional migration operations include a step of transmitting to the destination storage server data blocks of the selected files that are not shared between the reference file and the selected files, but avoid transmitting to the destination storage server the blocks shared with the reference file.

    Drive wear-out prediction based on workload and risk tolerance
    314.
    发明授权
    Drive wear-out prediction based on workload and risk tolerance 有权

    公开(公告)号：US09830107B2

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

    申请号：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.

    Application-specific chunk-aligned prefetch for sequential workloads
    315.
    发明授权
    Application-specific chunk-aligned prefetch for sequential workloads 有权

    公开(公告)号：US09830097B2

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

    申请号：US15042945

    申请日：2016-02-12

    Applicant: NetApp, Inc.

    Inventor： Sai Susarla ,  Sandeep Ummadi

    IPC: G06F12/00 ,  G06F3/06

    CPC classification number: G06F3/0619 ,  G06F3/0611 ,  G06F3/0653 ,  G06F3/0659 ,  G06F3/067 ,  G06F3/0685

    Abstract: A method, a computing device, and a non-transitory machine-readable medium for identifying a set of transactions directed to a contiguous chunk of data, even if received out of order, determining the data chunk size from the set of transactions, and for sequentially retrieving data chunks using the data chunk size is provided. In some embodiments, the method includes receiving, by a storage system, a set of data transactions from an initiator. The storage system identifies a subset of the set of data transactions that is directed to accessing a first chunk of data and determines, from the subset of transactions, a chunk size of the first chunk of data. The storage system sequentially retrieves a second chunk of data based on the determined chunk size.

    Access management techniques for storage networks
    316.
    发明授权
    Access management techniques for storage networks 有权

    公开(公告)号：US09819738B2

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

    申请号：US14163067

    申请日：2014-01-24

    Applicant: NetApp, Inc.

    Inventor： Dean Kalman ,  Joseph R. Sunday ,  Raj Lalsangi

    IPC: H04L29/08 ,  G06F17/30

    CPC classification number: H04L67/1097 ,  G06F17/30194

    Abstract: Improved access management techniques for storage networks are described. In one embodiment, for example, an apparatus may comprise a processor circuit and an access control component for execution by the processor circuit to select a set of hosts for which to enable access to a logical storage volume of a network storage cluster, select, from among a plurality of nodes of the network storage cluster, a set of nodes via which to enable access to the logical storage volume by the set of hosts, and generate a storage configuration object comprising a parameter identifying the set of nodes. Other embodiments are described and claimed.

    Resiliency fragment tiering
    317.
    发明授权
    Resiliency fragment tiering 有权

    公开(公告)号：US09817715B2

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

    申请号：US14696302

    申请日：2015-04-24

    Applicant: NetApp, Inc.

    Inventor： David Slik

    IPC: G11C29/00 ,  G06F11/10 ,  G06F3/06 ,  H03M13/37 ,  H03M13/15

    CPC classification number: G06F11/1076 ,  G06F3/0619 ,  G06F3/064 ,  G06F3/0689 ,  H03M13/1515 ,  H03M13/373 ,  H03M13/3761

    Abstract: Technology is disclosed for a data storage architecture for providing enhanced storage resiliency for a data object. The data storage architecture can be implemented in a single-tier configuration and/or a multi-tier configuration. In the single-tier configuration, a data object is encoded, e.g., based on an erasure coding method, to generate many data fragments, which are stored across many storage devices. In the multi-tier configuration, a data object is encoded, e.g., based on an erasure coding method, to generate many data segments, which are sent to one or more tiers of storage nodes and at least one latent storage. Each of the storage nodes further encodes the data segment to generate many data fragments representing the data segment, which are stored across many storage devices associated with the storage node. The I/O operations for rebuilding the data in case of device failures is spread across many storage devices, which minimizes the wear of a given storage device.

    Coalescing metadata for mirroring to a remote storage node in a cluster storage system
    319.
    发明授权
    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