公开(公告)号：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（例如，三个）级别的映射内容来更新密集树的卷元数据映射的有效（即优化的）方式，而不是合并内容 在第一次迭代双向合并操作中具有第二级别的内容的第一级，然后在操作的第二次迭代中将第一次迭代的结果与第三级的内容合并。

公开(公告)号：WO2016040236A1

公开(公告)日：2016-03-17

申请号：PCT/US2015/048810

申请日：2015-09-08

Applicant: NETAPP, INC.

Inventor： D'SA, Janice ,  PUNDIR, Anshul ,  KRISHNAMACHARI, Srinath ,  ZHENG, Ling

IPC: G06F11/14

CPC classification number: G06F17/30156 ,  G06F11/1471 ,  G06F17/30327

Abstract: A low-overhead merge technique enables restart of a merge operation with minimal logging of state information relating to progress of the merge operation by a volume layer of a storage input/output (I/O) stack executing on one or more nodes of a cluster. The technique enables restart of the merge operation by ensuring that metadata, i.e., metadata pages, generated during the merge operation is not subject to de-duplication by providing a unique value in each metadata page that distinguishes the page, i.e., renders the page distinct or "unique", from other metadata pages in an extent store. In addition, the technique ensures that a reference count on each metadata page is a value denoting a lack of de-duplication. To that end, the extent store layer is configured to not increment the reference count for a metadata page if, during the merge operation, the page is identical (and thus subject to deduplication) to an existing metadata page in the extent store.

Abstract translation: 低开销合并技术使得能够通过在集群的一个或多个节点上执行的存储输入/输出（I / O）堆栈的卷层的最小记录关于合并操作的进展的状态信息的记录来重新启动合并操作。 。 该技术通过确保在合并操作期间生成的元数据页面不受重复数据删除的影响，从而通过在每个元数据页面中提供唯一的值来区分页面，即，使页面不同 或“唯一”，从范围存储中的其他元数据页面。 此外，该技术确保每个元数据页面上的引用计数是表示缺少重复数据删除的值。 为此，如果在合并操作期间页面与扩展存储区中的现有元数据页面相同（并因此进行重复数据删除），则扩展区存储层被配置为不递增元数据页面的引用计数。

公开(公告)号：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）到持久扩展密钥的映射，并被组织为多级密集树。 这些映射被组织成使得较高级别的密集树包含比下一个较低级别（即紧接在下面的级别）更近的映射。 三向合并操作是通过在单次迭代中合并所有三个级别的映射内容来更新密集树的卷元数据映射的高效（即优化）方式，而不是将第一级别的内容与 在双向合并操作的第一次迭代中第二级的内容，然后在操作的第二次迭代中将第一次迭代的结果与第三级的内容合并。

公开(公告)号：EP3191957B1

公开(公告)日：2018-07-18

申请号：EP15771801.6

申请日：2015-09-08

Applicant: NetApp, Inc.

Inventor： D'SA, Janice ,  PUNDIR, Anshul ,  KRISHNAMACHARI, Srinath ,  ZHENG, Ling

IPC: G06F17/30 ,  G06F11/14

CPC classification number: G06F17/30156 ,  G06F11/1471 ,  G06F17/30327

Abstract: A low-overhead merge technique enables restart of a merge operation with minimal logging of state information relating to progress of the merge operation by a volume layer of a storage input/output (I/O) stack executing on one or more nodes of a cluster. The technique enables restart of the merge operation by ensuring that metadata, i.e., metadata pages, generated during the merge operation is not subject to de-duplication by providing a unique value in each metadata page that distinguishes the page, i.e., renders the page distinct or “unique”, from other metadata pages in an extent store. In addition, the technique ensures that a reference count on each metadata page is a value denoting a lack of de-duplication. To that end, the extent store layer is configured to not increment the reference count for a metadata page if, during the merge operation, the page is identical (and thus subject to deduplication) to an existing metadata page in the extent store.

公开(公告)号：EP3191957A1

公开(公告)日：2017-07-19

申请号：EP15771801.6

申请日：2015-09-08

Applicant: NetApp, Inc.

Inventor： D'SA, Janice ,  PUNDIR, Anshul ,  KRISHNAMACHARI, Srinath ,  ZHENG, Ling

IPC: G06F11/14

CPC classification number: G06F17/30156 ,  G06F11/1471 ,  G06F17/30327

Abstract: A low-overhead merge technique enables restart of a merge operation with minimal logging of state information relating to progress of the merge operation by a volume layer of a storage input/output (I/O) stack executing on one or more nodes of a cluster. The technique enables restart of the merge operation by ensuring that metadata, i.e., metadata pages, generated during the merge operation is not subject to de-duplication by providing a unique value in each metadata page that distinguishes the page, i.e., renders the page distinct or “unique”, from other metadata pages in an extent store. In addition, the technique ensures that a reference count on each metadata page is a value denoting a lack of de-duplication. To that end, the extent store layer is configured to not increment the reference count for a metadata page if, during the merge operation, the page is identical (and thus subject to deduplication) to an existing metadata page in the extent store.

Abstract translation: 低开销合并技术通过在群集的一个或多个节点上执行的存储输入/输出（I / O）堆栈的卷层，以最小的日志记录与合并操作的进度有关的状态信息来启用合并操作的重启 。 该技术通过确保在合并操作期间生成的元数据（即，元数据页面）不通过在区分该页面的每个元数据页面中提供唯一值而进行重复删除来重启合并操作，即，使得页面不同 或“唯一”，从扩展存储中的其他元数据页面。 此外，该技术确保每个元数据页面上的引用计数是表示缺少重复数据删除的值。 为此，如果在合并操作期间页面与扩展存储区中的现有元数据页面相同（并因此受到重复数据删除），则扩展存储层被配置为不增加元数据页面的引用计数。