公开(公告)号：WO2015051059A1

公开(公告)日：2015-04-09

申请号：PCT/US2014/058728

申请日：2014-10-02

Applicant: NETAPP, INC.

Inventor： KIMMEL, Jeffrey S. ,  LEWIS, Blake H.

IPC: G06F3/06 ,  G06F17/30

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）根据所述散列值计算的散列表索引，以从所选择的哈希表的多个条目中选择具有标识存储器的集群范围标识符的标识符的条目 位置的程度。

公开(公告)号：WO2016081166A1

公开(公告)日：2016-05-26

申请号：PCT/US2015/057532

申请日：2015-10-27

Applicant: NETAPP, INC.

Inventor： D'SA, Janice ,  ZHENG, Ling ,  LEWIS, Blake H.

IPC: G06F3/06

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 N(e.g., 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.

Abstract translation: N路合并技术根据在集群的一个或多个节点上执行的存储输入/输出（I / O）栈的卷层管理的N路合并操作来有效地更新元数据。 元数据体现为从主机可访问的逻辑单元（LUN）的逻辑块地址（LBA）到持久扩展密钥的映射，并且被组织为多级密集树。 这些映射被组织成使得较高级别的密集树包含比下一个较低级别更近的映射，即紧接在下面的级别。 N路合并操作是通过在单次迭代中合并N（例如，三个）级别的映射内容来更新密集树的卷元数据映射的有效（即优化的）方式，而不是合并内容 在第一次迭代双向合并操作中具有第二级别的内容的第一级，然后在操作的第二次迭代中将第一次迭代的结果与第三级的内容合并。

公开(公告)号：WO2015105666A1

公开(公告)日：2015-07-16

申请号：PCT/US2014/071484

申请日：2014-12-19

Applicant: NETAPP, INC.

Inventor： SUNDARAM, Rajesh ,  DANIEL, Stephen ,  KIMMEL, Jeffrey S. ,  LEWIS, Blake H.

IPC: G06F3/06

CPC classification number: G06F17/30138 ,  G06F3/0604 ,  G06F3/0608 ,  G06F3/0616 ,  G06F3/064 ,  G06F3/0643 ,  G06F3/0644 ,  G06F3/0647 ,  G06F3/0659 ,  G06F3/0679 ,  G06F3/0685 ,  G06F3/0688 ,  G06F12/0246 ,  G06F17/30185 ,  G06F17/30218 ,  G06F2003/0697 ,  G06F2212/2022 ,  G06F2212/7208

Abstract: In one embodiment, a flash-optimized, log-structured layer of a file system of a storage input/output (I/O) stack executes on one or more nodes of a cluster. The log-structured layer of the file system provides sequential storage of data and metadata on solid state drives (SSDs) to reduce write amplification, while leveraging variable compression and variable length data features of the storage I/O stack. The data may be organized as an arbitrary number of variable-length extents of one or more host-visible logical units (LUNs). The metadata may include mappings from host-visible logical block address ranges of a LUN to extent keys, as well as mappings of the extent keys to SSD storage locations of the extents. The storage location of an extent on SSD is effectively "virtualized" by its mapped extent key such that relocation of the extent on SSD does not require update to volume layer metadata.

Abstract translation: 在一个实施例中，存储输入/输出（I / O）堆栈的文件系统的闪存优化的日志结构化层在集群的一个或多个节点上执行。 文件系统的日志结构化层在固态驱动器（SSD）上提供数据和元数据的顺序存储，以减少写入放大，同时利用存储I / O堆栈的可变压缩和可变长度数据特征。 数据可以被组织为一个或多个主机可见逻辑单元（LUN）的任意数量的可变长度盘区。 元数据可以包括从LUN到扩展密钥的主机可视逻辑块地址范围的映射，以及扩展密钥到扩展区的SSD存储位置的映射。 SSD上的盘区的存储位置被其映射的盘区密钥有效地“虚拟化”，使得SSD上盘区的重新定位不需要更新到卷层元数据。

公开(公告)号：WO2015105665A1

公开(公告)日：2015-07-16

申请号：PCT/US2014/071465

申请日：2014-12-19

Applicant: NETAPP, INC.

Inventor： SUNDARAM, Rajesh ,  KIMMEL, Jeffrey S. ,  LEWIS, Blake H.

IPC: G06F3/06

CPC classification number: G06F3/0641 ,  G06F3/0604 ,  G06F3/0608 ,  G06F3/0643 ,  G06F3/067 ,  G06F3/0688 ,  G06F2003/0697

Abstract: In one embodiment, a layered file system of a storage input/output (I/O) stack executes on one or more nodes of a cluster. The layered file system includes a flash-optimized, log-structured layer configured to provide sequential storage of data and metadata (i.e., a log-structured layout) on solid state drives (SSDs) of storage arrays in the cluster to reduce write amplification, while leveraging a data de-duplication feature of the storage I/O stack. An extent store layer of the file system performs and maintains mappings of the extent keys to SSD storage locations, while a volume layer of the file system performs and maintains mappings of the LUN offset ranges to the extent keys. Separation of the mapping functions between the volume and extent store layers enables different volumes with different offset ranges to reference a same extent key (and thus a same extent).

Abstract translation: 在一个实施例中，存储输入/输出（I / O）堆栈的分层文件系统在集群的一个或多个节点上执行。 分层文件系统包括闪存优化的日志结构化层，其被配置为在集群中的存储阵列的固态驱动器（SSD）上提供对数据和元数据的顺序存储（即，日志结构化布局），以减少写入放大， 同时利用存储I / O堆栈的重复数据删除功能。 文件系统的扩展存储层执行并维护扩展密钥到SSD存储位置的映射，而文件系统的卷层执行并维护LUN偏移范围到扩展密钥的映射。 卷和卷存储层之间的映射函数的分离使得具有不同偏移范围的不同卷可以引用相同的扩展密钥（并因此相同的扩展）。

公开(公告)号：WO2015038741A1

公开(公告)日：2015-03-19

申请号：PCT/US2014/055138

申请日：2014-09-11

Applicant: NETAPP, INC.

Inventor： ZHENG, Ling ,  LEWIS, Blake H. ,  PATEL, Kayuri H.

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）的偏移到与一个或多个存储设备上的范围的存储位置相关联的扩展密钥的映射的卷元数据。 卷元数据被保持为表示连续时间点的密集树元数据结构。 密集树元数据结构具有多个层次，其中密集树元数据结构的顶层表示较新的卷元数据更改，密集树元数据结构的下降层表示较旧的卷元数据更改。 节点通过从密级树元数据结构中的顶层到下行级别进行搜索来访问对卷元数据的最新版本的更改。

公开(公告)号：EP3036616A1

公开(公告)日：2016-06-29

申请号：EP14781721.7

申请日：2014-09-11

Applicant: NetApp, Inc.

Inventor： ZHENG, Ling ,  LEWIS, Blake H. ,  PATEL, Kayuri H.

IPC: G06F3/06

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）的偏移映射体积元数据。 卷元数据被保持作为表示时间连续点的致密树元数据结构。 致密树元数据结构有多个级别，worin致密树元数据结构的顶层darstellt较新的体积元数据的变化和降序致密树元数据结构的电平表示的年龄较大的体积元数据的变化。 节点通过从顶层到在茂密的树元数据结构的下降水平搜索访问最新版本更改卷的元数据。

公开(公告)号：EP3036616B1

公开(公告)日：2020-05-27

申请号：EP14781721.7

申请日：2014-09-11

Applicant: NetApp, Inc.

Inventor： ZHENG, Ling ,  LEWIS, Blake H. ,  PATEL, Kayuri H.

IPC: G06F3/06

公开(公告)号：EP3221782A1

公开(公告)日：2017-09-27

申请号：EP15791166.0

申请日：2015-10-27

Applicant: NetApp, Inc.

Inventor： D'SA, Janice ,  ZHENG, Ling ,  LEWIS, Blake H.

IPC: G06F3/06

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.

Abstract translation: 三向合并技术根据在集群的一个或多个节点上执行的存储输入/输出（I / O）堆栈的卷层管理的三向合并操作来有效地更新元数据。 元数据体现为从主机可访问的逻辑单元（LUN）的逻辑块地址（LBA）到持久扩展密钥的映射，并被组织为多级密集树。 这些映射被组织成使得较高级别的密集树包含比下一个较低级别（即紧接在下面的级别）更近的映射。 三向合并操作是通过在单次迭代中合并所有三个级别的映射内容来更新密集树的卷元数据映射的高效（即优化）方式，而不是将第一级别的内容与 在双向合并操作的第一次迭代中第二级的内容，然后在操作的第二次迭代中将第一次迭代的结果与第三级的内容合并。

公开(公告)号：EP3036617A1

公开(公告)日：2016-06-29

申请号：EP14796316.9

申请日：2014-10-02

Applicant: NetApp, Inc.

Inventor： KIMMEL, Jeffrey S. ,  LEWIS, Blake H.

IPC: G06F3/06 ,  G06F17/30

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.