中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

45 records (took 0.022 seconds)

    SNAPSHOTS AND CLONES OF VOLUMES IN A STORAGE SYSTEM
    2.
    发明申请
    SNAPSHOTS AND CLONES OF VOLUMES IN A STORAGE SYSTEM 审中-公开
    存储系统中的卷轴和卷的克隆

    公开(公告)号：US20150370485A1

    公开(公告)日：2015-12-24

    申请号：US14838614

    申请日：2015-08-28

    Applicant: NetApp, Inc.

    Inventor： Ling Zheng ,  Blake H. Lewis ,  Kayuri H. Patel

    IPC: G06F3/06 ,  G06F11/14

    CPC classification number: G06F3/065 ,  G06F3/0604 ,  G06F3/0619 ,  G06F3/0659 ,  G06F3/067 ,  G06F3/0685 ,  G06F3/0688 ,  G06F3/0689 ,  G06F11/1464 ,  G06F17/30575 ,  G06F2201/84 ,  G06F2212/262

    Abstract: In one embodiment, a node coupled to one or more storage devices executes a storage input/output (I/O) stack having a volume layer, a persistence layer and an administration layer that interact to create a copy of a parent volume associated with a storage container on the one or more storage devices. A copy create start message is received at the persistence layer from the administration layer. The persistence layer ensures that dirty data for the parent volume is incorporated into the copy of the parent volume. New data for the parent volume received at the persistence layer during creation of the copy of the parent volume is prevented from incorporation into the copy of the parent volume. A reply to the copy create start message is sent from the persistence layer to the administration layer to initiate the creation of the copy of the parent volume at the volume layer.

    Abstract translation: 在一个实施例中，耦合到一个或多个存储设备的节点执行具有卷层，持久层和管理层的存储输入/输出（I / O）堆栈，所述卷层，持久层和管理层进行交互以创建与 存储容器在一个或多个存储设备上。 在管理层的持久层收到复制创建开始消息。 持久层确保父卷的脏数据合并到父卷的副本中。 在创建父卷的副本期间，在持久层处收到的父卷的新数据将被阻止并入父卷的副本。 将复制创建开始消息的答复从持久层发送到管理层，以启动在卷层创建父卷的副本。

    SNAPSHOTS AND CLONES OF VOLUMES IN A STORAGE SYSTEM
    3.
    发明申请
    SNAPSHOTS AND CLONES OF VOLUMES IN A STORAGE SYSTEM 有权
    存储系统中的卷轴和卷的克隆

    公开(公告)号：US20150134879A1

    公开(公告)日：2015-05-14

    申请号：US14078146

    申请日：2013-11-12

    Applicant: NetApp, Inc.

    Inventor： Ling Zheng ,  Blake H. Lewis ,  Kayuri H. Patel

    IPC: G06F3/06

    CPC classification number: G06F3/065 ,  G06F3/0604 ,  G06F3/0619 ,  G06F3/0659 ,  G06F3/067 ,  G06F3/0685 ,  G06F3/0688 ,  G06F3/0689 ,  G06F11/1464 ,  G06F17/30575 ,  G06F2201/84 ,  G06F2212/262

    Abstract: In one embodiment, a node coupled to one or more storage devices executes a storage input/output (I/O) stack having a volume layer that manages volume metadata. The volume metadata is organized as one or more dense tree metadata structures having a top level residing in memory and lower levels residing on the one or more storage devices. The dense tree metadata structures include a first dense tree metadata structure associated with a parent volume and a second dense tree metadata structure associated with a copy of the parent volume. The top level of the first dense tree metadata structure may be copied to the second dense tree metadata structure. The lower levels of the first dense tree metadata structure are initially shared with the second dense tree metadata structure. The shared lower levels may eventually be split as the parent volume diverges from the copy of the parent volume.

    Abstract translation: 在一个实施例中，耦合到一个或多个存储设备的节点执行具有管理卷元数据的卷层的存储输入/输出（I / O）堆栈。 卷元数据被组织为一个或多个密集树元数据结构，其具有驻留在存储器中的顶级和驻留在一个或多个存储设备上的较低级别。 密集树元数据结构包括与父卷相关联的第一密集树元数据结构和与父卷的副本相关联的第二密集树元数据结构。 第一密集树元数据结构的顶层可以被复制到第二密集树元数据结构。 第一密集树元数据结构的较低级别最初与第二密集树元数据结构共享。 共享的较低级别最终可能会因父体卷从父卷的副本分歧而被拆分。

    SNAPSHOTS AND CLONES OF VOLUMES IN A STORAGE SYSTEM
    4.
    发明申请
    SNAPSHOTS AND CLONES OF VOLUMES IN A STORAGE SYSTEM 有权
    存储系统中的卷轴和卷的克隆

    公开(公告)号：US20150134616A1

    公开(公告)日：2015-05-14

    申请号：US14162106

    申请日：2014-01-23

    Applicant: NetApp, Inc.

    Inventor： Ling Zheng ,  Blake H. Lewis ,  Kayuri H. Patel

    IPC: G06F17/30

    CPC classification number: G06F3/065 ,  G06F3/0604 ,  G06F3/0619 ,  G06F3/0659 ,  G06F3/067 ,  G06F3/0685 ,  G06F3/0688 ,  G06F3/0689 ,  G06F11/1464 ,  G06F17/30575 ,  G06F2201/84 ,  G06F2212/262

    Abstract: In one embodiment, snapshots and/or clones of storage objects are created and managed by a volume layer of a storage input/output (I/O) stack executing on one or more nodes of a cluster. Illustratively, the snapshots and clones may be represented as independent volumes, and embodied as respective read-only copies (snapshots) and read-write copies (clones) of a parent volume. Volume metadata is illustratively organized as one or more multi-level dense tree metadata structures, wherein each level of the dense tree metadata structure (dense tree) includes volume metadata entries for storing the metadata. Each snapshot/clone may be derived from a dense tree of the parent volume (parent dense tree). Portions of the parent dense tree may be shared with the snapshot/clone.

    Abstract translation: 在一个实施例中，由集群的一个或多个节点上执行的存储输入/输出（I / O）栈的卷层创建和管理存储对象的快照和/或克隆。 说明性地，快照和克隆可以表示为独立卷，并且被体现为父卷的相应的只读副本（快照）和读写副本（克隆）。 卷元数据被示例性地组织为一个或多个多级密集树元数据结构，其中密集树元数据结构（密集树）的每个级别包括用于存储元数据的卷元数据条目。 每个快照/克隆可以从父卷（父密集树）的密集树导出。 父密度树的部分可能与快照/克隆共享。

    Dense tree volume metadata organization
    5.
    发明授权
    Dense tree volume metadata organization 有权
    密集树卷元数据组织

    公开(公告)号：US08892818B1

    公开(公告)日：2014-11-18

    申请号：US14162228

    申请日：2014-01-23

    Applicant: NetApp, Inc.

    Inventor： Ling Zheng ,  Blake H. Lewis ,  Kayuri H. Patel

    IPC: G06F12/00 ,  G06F17/30

    CPC classification number: G06F17/30327 ,  G06F3/0611 ,  G06F3/0619 ,  G06F3/0638 ,  G06F3/0641 ,  G06F3/0655 ,  G06F3/0665 ,  G06F3/067 ,  G06F3/0689 ,  G06F17/30 ,  G06F17/30292

    Abstract: The embodiments described herein are directed to an organization of metadata managed by a volume layer of a storage input/output (I/O) stack executing on one or more nodes of a cluster. The metadata managed by the volume layer, i.e., the volume metadata, is illustratively embodied as mappings from addresses, i.e., logical block addresses (LBAs), of a logical unit (LUN) accessible by a host to durable extent keys maintained by an extent store layer of the storage I/O stack. In an embodiment, the volume layer organizes the volume metadata as a mapping data structure, i.e., a dense tree metadata structure, which represents successive points in time to enable efficient access to the metadata.

    Abstract translation: 这里描述的实施例涉及由在集群的一个或多个节点上执行的存储输入/输出（I / O）栈的卷层管理的元数据的组织。 由卷层管理的元数据（即卷元数据）被示意性地体现为从主机可访问的逻辑单元（LUN）的地址（即，逻辑块地址（LBA））到可由扩展区维护的持久范围密钥的映射 存储I / O堆栈的存储层。 在一个实施例中，卷层将卷元数据组织为映射数据结构，即密集树元数据结构，其表示连续的时间点以实现对元数据的有效访问。

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

    公开(公告)号：US10365838B2

    公开(公告)日：2019-07-30

    申请号：US15820004

    申请日：2017-11-21

    Applicant: NetApp, Inc.

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

    IPC: G06F3/06 ,  H04L29/08

    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.

    N-way merge technique for updating volume metadata in a storage I/O stack
    9.
    发明授权
    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.

    TECHNIQUE FOR PRESERVING EFFICIENCY FOR REPLICATION BETWEEN CLUSTERS OF A NETWORK
    10.
    发明申请
    TECHNIQUE FOR PRESERVING EFFICIENCY FOR REPLICATION BETWEEN CLUSTERS OF A NETWORK 审中-公开
    保护网络群集之间复制效率的技术

    公开(公告)号：US20170032013A1

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

    申请号：US14876460

    申请日：2015-10-06

    Applicant: NetApp, Inc.

    Inventor： Ling Zheng ,  Michael L. Federwisch ,  Blake H. Lewis

    IPC: G06F17/30

    Abstract: A technique preserves efficiency for replication of data between a source node of a source cluster (“source”) and a destination node of a destination cluster (“destination”) of a clustered network. Replication in the clustered network may be effected by leveraging global in-line deduplication at the source to identify and avoid copying duplicate data from the source to the destination. To ensure that the copy of the data on the destination is synchronized with the data received at the source, the source creates a snapshot of the data for use as a baseline copy at the destination. Thereafter, new data received at the source that differs from the baseline snapshot are transmitted and copied to the destination. In addition, the source and destination nodes negotiate to establish a mapping of name-to-data when transferring data (i.e., an extent) between the clusters. Illustratively, the name is an extent key for the extent, such that the negotiated mapping established by the source and destination is based on the extent key associated with the extent.

    Abstract translation: 一种技术保留了源集群（“源”）的源节点与群集网络的目标集群（“目标”）的目标节点之间的数据复制的效率。 集群网络中的复制可以通过利用源上的全局在线重复数据消除来识别和避免将来自源的重复数据复制到目的地来实现。 为确保目标上的数据副本与源中接收到的数据同步，源将创建数据的快照，以用作目标的基准副本。 此后，源头接收到的与基线快照不同的新数据将被传送并复制到目的地。 另外，源和目的地节点协商在传送数据之间建立名称到数据的映射（即扩展）。 示例性地，该名称是该范围的扩展密钥，使得由源和目的地建立的协商映射基于与扩展相关联的扩展密钥。

Patent Agency Ranking