-
21.发明申请DENSE TREE VOLUME METADATA UPDATE LOGGING AND CHECKPOINTING 审中-公开DENSE TREE VOLUME METADATA UPDATE LOGGING和CHECKPOINTING公开(公告)号：US20160048333A1
公开(公告)日：2016-02-18
申请号：US14927607
申请日：2015-10-30
Applicant: NetApp, Inc.
Inventor： Ling Zheng , Blake H. Lewis
IPC: G06F3/06
CPC classification number: G06F3/061 , G06F3/0604 , G06F3/0644 , G06F3/0646 , G06F3/0685 , G06F3/0688 , G06F17/30327
Abstract: The embodiments described herein are directed to efficient merging 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 organized as a multi-level dense tree metadata structure, wherein each level of the dense tree metadata structure (dense tree) includes volume metadata entries for storing the volume metadata. The volume metadata entries of an upper level of the dense tree metadata structure are merged with the volume metadata entries of a next lower level of the dense tree metadata structure when the upper level is full. The volume metadata entries of the merged levels are organized as metadata pages and stored as one or more files on the SSDs.
Abstract translation: 这里描述的实施例涉及由在集群的一个或多个节点上执行的存储输入/输出（I / O）堆栈的卷层管理的元数据的有效合并。 由卷层管理的元数据，即卷元数据被说明性地组织为多级密集树元数据结构，其中密集树元数据结构（密集树）的每个级别包括用于存储卷元数据的卷元数据条目。 密集树元数据结构的较高级别的卷元数据条目与较高级别已满的密集树元数据结构的下一级较低级别的卷元数据条目合并。 合并级别的卷元数据条目被组织为元数据页面，并作为一个或多个文件存储在SSD上。
-
公开(公告)号：US09152684B2
公开(公告)日：2015-10-06
申请号：US14078146
申请日：2013-11-12
Applicant: NetApp, Inc.
Inventor： Ling Zheng , Blake H. Lewis , Kayuri H. Patel
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）堆栈。 卷元数据被组织为一个或多个密集树元数据结构，其具有驻留在一个或多个存储设备上的存储器中的最高级别和较低级别。 密集树元数据结构包括与父卷相关联的第一密集树元数据结构和与父卷的副本相关联的第二密集树元数据结构。 第一密集树元数据结构的顶层可以被复制到第二密集树元数据结构。 第一密集树元数据结构的较低级别最初与第二密集树元数据结构共享。 共享的较低级别最终可能会因父体卷从父卷的副本分歧而被拆分。
-
公开(公告)号：US09037544B1
公开(公告)日：2015-05-19
申请号：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）栈的卷层创建和管理存储对象的快照和/或克隆。 说明性地，快照和克隆可以表示为独立卷，并且被体现为父卷的相应的只读副本（快照）和读写副本（克隆）。 卷元数据被示例性地组织为一个或多个多级密集树元数据结构，其中密集树元数据结构（密集树）的每个级别包括用于存储元数据的卷元数据条目。 每个快照/克隆可以从父卷（父密集树）的密集树导出。 父密度树的部分可能与快照/克隆共享。
-
公开(公告)号：US08996797B1
公开(公告)日：2015-03-31
申请号：US14161097
申请日：2014-01-22
Applicant: NetApp, Inc.
Inventor： Ling Zheng , Blake H. Lewis
CPC classification number: G06F3/061 , G06F3/0604 , G06F3/0644 , G06F3/0646 , G06F3/0685 , G06F3/0688 , G06F17/30327
Abstract: The embodiments described herein are directed to efficient logging and checkpointing 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 organized as a multi-level dense tree metadata structure, wherein each level of the dense tree metadata structure (dense tree) includes volume metadata entries for storing the volume metadata. Each volume metadata entry may be a descriptor that embodies one of a plurality of types, including a data entry and an index entry, and a hole (i.e., absence of data) entry.
Abstract translation: 这里描述的实施例涉及由在集群的一个或多个节点上执行的存储输入/输出（I / O）栈的卷层管理的元数据的有效记录和检查点。 由卷层管理的元数据，即卷元数据被说明性地组织为多级密集树元数据结构，其中密集树元数据结构（密集树）的每个级别包括用于存储卷元数据的卷元数据条目。 每个卷元数据条目可以是体现多个类型中的一个类型的描述符，包括数据条目和索引条目，以及空格（即，不存在数据）条目。
-
公开(公告)号：US08996535B1
公开(公告)日：2015-03-31
申请号：US14160048
申请日：2014-01-21
Applicant: NetApp, Inc.
Inventor： Jeffrey S. Kimmel , Blake H. Lewis
CPC classification number: G06F17/3033 , G06F3/0608 , G06F3/0641 , G06F3/067 , G06F17/30097 , G06F17/30949
Abstract: In one embodiment, an extent hashing technique is used to efficiently distribute data and associated metadata substantially evenly among nodes of a cluster. The data may be write data associated with a write request issued by a host and received at a node of the cluster. The write data may be organized into one or more extents. A hash function may be applied to the extent to generate a result which may be truncated or trimmed to generate a hash value. A hash space of the hash value may be divided into a plurality of buckets representative of the write data, i.e., the extents, and the associated metadata, i.e., extent metadata. A number of buckets may be assigned to each extent store instance of the nodes to distribute ownership of the buckets, along with their extents and extent metadata, across all of the extent store instances of the nodes.
Abstract translation: 在一个实施例中，使用扩展散列技术来有效地在簇的节点之间均匀地分布数据和相关联的元数据。 数据可以是与由主机发出并在集群的节点处接收的写入请求相关联的写入数据。 写入数据可以被组织成一个或多个范围。 可以将哈希函数应用于生成可能被截断或修剪以生成哈希值的结果的程度。 哈希值的散列空间可以被划分为代表写入数据的多个存储桶，即扩展区以及相关联的元数据，即扩展元数据。 可以将多个桶分配给节点的每个盘区存储实例，以在节点的所有范围存储实例之间分配桶的所有权以及它们的盘区和盘区元数据。
-
Patent Agency Ranking
公开(公告)号：US20150081966A1
公开(公告)日：2015-03-19
申请号：US14027994
申请日：2013-09-16
Applicant: NetApp, Inc.
Inventor： Ling Zheng , Blake H. Lewis , Kayuri H. Patel
IPC: G06F3/06
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: In one embodiment, a node coupled to one or more storage devices executes a storage input/output (I/O) stack having a volume layer. The volume layer manages volume metadata embodied as mappings from offsets of a logical unit (LUN) to extent keys associated with storage locations for extents on the one or more storage devices. Volume metadata is maintained as a dense tree metadata structure representing successive points in time. The dense tree metadata structure has multiple levels, wherein a top level of the dense tree metadata structure represents newer volume metadata changes and descending levels of the dense tree metadata structure represent older volume metadata changes. The node accesses a latest version of changes to the volume metadata by searching from the top level to the descending levels in the dense tree metadata structure.
Abstract translation: 在一个实施例中，耦合到一个或多个存储设备的节点执行具有体积层的存储输入/输出（I / O）堆栈。 卷层管理体现为从逻辑单元（LUN）的偏移到与一个或多个存储设备上的范围的存储位置相关联的扩展密钥的映射的卷元数据。 卷元数据被保持为表示连续时间点的密集树元数据结构。 密集树元数据结构具有多个层次，其中密集树元数据结构的顶层表示较新的卷元数据更改，密集树元数据结构的下降层表示较旧的卷元数据更改。 节点通过从密级树元数据结构中的顶层到下行级别进行搜索来访问对卷元数据的最新版本的更改。
-
公开(公告)号：US10565230B2
公开(公告)日：2020-02-18
申请号：US14876460
申请日：2015-10-06
Applicant: NetApp, Inc.
Inventor： Ling Zheng , Michael L. Federwisch , Blake H. Lewis
IPC: G06F16/27 , G06F16/11 , G06F16/28 , G06F16/2457
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.
-
公开(公告)号：US10268410B2
公开(公告)日：2019-04-23
申请号：US14518088
申请日：2014-10-20
Applicant: NetApp, Inc.
Inventor： Jayalakshmi Pattabiraman , Nikhil Mattankot , Deekshith Belchapada , Blake H. Lewis , Subramaniam Periyagaram , Satya Suresh Chouta Naga Veera , Rohit Singh , Rajesh Khandelwal , James Robert Morefield
Abstract: A first plurality of block identifiers is sorted based, at least in part, on a measure of spatial locality. A second plurality of block identifiers is sorted based, at least in part, on the measure of spatial locality. At least the first plurality of block identifiers and the second plurality of block identifiers are incrementally merged into a third plurality of block identifiers based, at least in part, on the measure of spatial locality. A block of data corresponding to metadata associated with a plurality of block identifiers of the third plurality of block identifiers is updated.
-
公开(公告)号：US09563654B2
公开(公告)日：2017-02-07
申请号：US14978290
申请日：2015-12-22
Applicant: NetApp, Inc.
Inventor： Ling Zheng , Blake H. Lewis , Kayuri H. Patel
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堆栈的存储层。 在一个实施例中，卷层将卷元数据组织为映射数据结构，即密集树元数据结构，其表示连续的时间点以实现对元数据的有效访问。
-
公开(公告)号：US09405783B2
公开(公告)日：2016-08-02
申请号：US14044624
申请日：2013-10-02
Applicant: NetApp, Inc.
Inventor： Jeffrey S. Kimmel , Blake H. Lewis
CPC classification number: G06F17/3033 , G06F3/0608 , G06F3/0641 , G06F3/067 , G06F17/30097 , G06F17/30949
Abstract: In one embodiment, a technique is provided for distributing data and associated metadata within a distributed storage architecture. A set of hash tables that embody mappings of cluster-wide identifiers associated with storage locations are stored for write data of write requests organized into extents. A hash value is generated from a hash function applied to each extent. The hash value is overloaded and used for multiple purposes within the distributed storage architecture, including (i) a remainder computation on the hash value to select a bucket of a plurality of buckets representative of the extents, (ii) a hash table selector of the hash value to select a hash table from the set of hash tables, and (iii) a hash table index computed from the hash value to select an entry from a plurality of entries of the selected hash table having a cluster-wide identifier identifying a storage location for the extent.
Abstract translation: 在一个实施例中，提供了用于在分布式存储架构内分发数据和相关元数据的技术。 存储与存储位置相关联的集群范围标识符的映射的一组哈希表，用于组织到扩展区中的写入请求的写入数据。 从应用于每个区段的散列函数生成哈希值。 散列值被重载并用于分布式存储体系结构中的多个目的，包括（i）散列值的余数计算，以选择代表范围的多个存储桶的桶，（ii）哈希表选择器 散列值以从所述散列表集合中选择散列表，以及（iii）根据所述散列值计算的散列表索引，以从所选择的哈希表的多个条目中选择具有标识存储器的集群范围标识符的标识符 位置的程度。
-
-
-
-
-
-
-
-
-
Search Results
45
records
(took 0.02 seconds)
