-
公开(公告)号：US09836355B2
公开(公告)日：2017-12-05
申请号：US15272971
申请日：2016-09-22
Applicant: NetApp, Inc.
Inventor： Anshul Pundir , Janice D'Sa , Srinath Krishnamachari , Ling Zheng
CPC classification number: G06F11/1438 , G06F3/0619 , G06F3/064 , G06F3/067 , G06F3/0679 , G06F7/32 , G06F11/1088 , G06F11/1451 , G06F11/1471 , G06F11/2069 , G06F17/30327 , G06F2201/80 , G06F2201/805 , G06F2201/82 , G06F2201/84 , G06F2211/104
Abstract: Embodiments herein are directed to efficient crash recovery of persistent metadata managed by a volume layer of a storage input/output (I/O) stack executing on one or more nodes of a cluster. Volume metadata managed by the volume layer is organized as a multi-level dense tree, wherein each level of the dense tree includes volume metadata entries for storing the volume metadata. When a level of the dense tree is full, the volume metadata entries of the level are merged with the next lower level of the dense tree. During a merge operation, two sets of generation IDs may be used in accordance with a double buffer arrangement: a first generation ID for the append buffer that is full (i.e., a merge staging buffer) and a second, incremented generation ID for the append buffer that accepts new volume metadata entries. Upon completion of the merge operation, the lower level (e.g., level 1) to which the merge is directed is assigned the generation ID of the merge staging buffer.
-
公开(公告)号：US09524103B2
公开(公告)日：2016-12-20
申请号：US14482863
申请日：2014-09-10
Applicant: NetApp, Inc.
Inventor： Sriranjani Babu , Janice D'Sa
CPC classification number: G06F12/0253 , G06F3/0608 , G06F3/061 , G06F3/0611 , G06F3/0619 , G06F3/0638 , G06F3/064 , G06F3/0641 , G06F3/0643 , G06F3/0665 , G06F3/0683 , G06F3/0688 , G06F3/0689 , G06F12/10 , G06F17/30327 , G06F2212/1044 , G06F2212/65
Abstract: A technique quantifies logical storage space trapped in an extent store due to overlapping write requests associated with volume metadata managed by the volume layer. 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. When a level of the dense tree is full, the volume metadata entries of the level are merged with a next lower level of the dense tree in accordance with a merge operation. Illustratively, the technique may be invoked during the merge operation to examine the volume metadata entries at each level of the dense tree involved in the merge and determine the LBA range overlap of the entries. To that end, the technique may include an algorithm configured to calculate the overlapping space per level and then aggregate the overlapping space of all levels involved in the merge operation to arrive at a result that quantifies the logical storage space trapped in the extent store.
Abstract translation: 由于与由卷层管理的卷元数据相关联的写入请求重叠，技术可以量化存储在存储区中的逻辑存储空间。 卷元数据被示意性地组织为多级密集树元数据结构，其中密集树元数据结构（密集树）的每个级别包括用于存储卷元数据的卷元数据条目。 当密集树的级别满时，根据合并操作，级别的卷元数据条目与密集树的下一个较低级别合并。 说明性地，可以在合并操作期间调用该技术来检查在合并中涉及的密集树的每个级别的卷元数据条目，并确定条目的LBA范围重叠。 为此，该技术可以包括被配置为计算每个级别的重叠空间并且然后聚合合并操作中涉及的所有级别的重叠空间的算法，以得到量化在范围存储中被捕获的逻辑存储空间的结果的算法。
-
公开(公告)号：US09779018B2
公开(公告)日：2017-10-03
申请号：US15336096
申请日：2016-10-27
Applicant: NetApp, Inc.
Inventor： Sriranjani Babu , Janice D'Sa
CPC classification number: G06F12/0253 , G06F3/0608 , G06F3/061 , G06F3/0611 , G06F3/0619 , G06F3/0638 , G06F3/064 , G06F3/0641 , G06F3/0643 , G06F3/0665 , G06F3/0683 , G06F3/0688 , G06F3/0689 , G06F12/10 , G06F17/30327 , G06F2212/1044 , G06F2212/65
Abstract: A technique quantifies logical storage space trapped in an extent store due to overlapping write requests associated with volume metadata managed by the volume layer. 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. When a level of the dense tree is full, the volume metadata entries of the level are merged with a next lower level of the dense tree in accordance with a merge operation. Illustratively, the technique may be invoked during the merge operation to examine the volume metadata entries at each level of the dense tree involved in the merge and determine the LBA range overlap of the entries. To that end, the technique may include an algorithm configured to calculate the overlapping space per level and then aggregate the overlapping space of all levels involved in the merge operation to arrive at a result that quantifies the logical storage space trapped in the extent store.
-
4.发明申请N-WAY MERGE TECHNIQUE FOR UPDATING VOLUME METADATA IN A STORAGE I/O STACK 有权用于在存储I / O堆栈中更新卷元数据的N-WAY MERGE技术公开(公告)号：US20160139838A1
公开(公告)日：2016-05-19
申请号：US14546214
申请日：2014-11-18
Applicant: NetApp, Inc.
Inventor： Janice D'Sa , Ling Zheng , Blake H. Lewis
IPC: G06F3/06
CPC classification number: G06F3/0619 , G06F3/0607 , G06F3/0626 , G06F3/0644 , G06F3/0665 , G06F3/067 , G06F3/0689 , H04L67/1097
Abstract: A three-way merge technique efficiently updates metadata in accordance with a three-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 three-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）到持久扩展密钥的映射，并且被组织为多级密集树。 这些映射被组织成使得较高级别的密集树包含比下一个较低级别更近的映射，即紧接在下面的级别。 三次合并操作是通过在单次迭代中合并所有三个级别的映射内容来更新密集树的卷元数据映射的有效（即优化的）方法，而不是将第一级的内容与 在双向合并操作的第一迭代中的第二级的内容，然后在操作的第二次迭代中将第一次迭代的结果与第三级的内容合并。
-
公开(公告)号：US10365838B2
公开(公告)日：2019-07-30
申请号：US15820004
申请日：2017-11-21
Applicant: NetApp, Inc.
Inventor： Janice D'Sa , Ling Zheng , Blake H. Lewis
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.
-
Patent Agency Ranking
公开(公告)号：US09836229B2
公开(公告)日：2017-12-05
申请号：US14546214
申请日：2014-11-18
Applicant: NetApp, Inc.
Inventor： Janice D'Sa , Ling Zheng , Blake H. Lewis
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.
-
7.发明申请公开(公告)号：US20160070714A1
公开(公告)日：2016-03-10
申请号：US14483012
申请日：2014-09-10
Applicant: NetApp, Inc.
Inventor： Janice D'Sa , Anshul Pundir , Srinath Krishnamachari , Ling Zheng
IPC: G06F17/30
CPC classification number: G06F16/1748 , G06F11/1471 , G06F16/2246
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）堆栈的卷层进行合并操作的进展的状态信息的最小记录来重新启动合并操作。 。 该技术通过确保在合并操作期间生成的元数据页面不受重复数据删除的影响，从而通过在每个元数据页面中提供唯一的值来区分页面，即，使页面不同 或“唯一”，从范围存储中的其他元数据页面。 此外，该技术确保每个元数据页面上的引用计数是表示缺少重复数据删除的值。 为此，如果在合并操作期间页面与扩展存储区中的现有元数据页面相同（因此遭受重复数据删除），则扩展区存储层被配置为不递增元数据页面的引用计数。
-
公开(公告)号：US20160070480A1
公开(公告)日：2016-03-10
申请号：US14482863
申请日：2014-09-10
Applicant: NetApp, Inc.
Inventor： Sriranjani Babu , Janice D'Sa
IPC: G06F3/06
CPC classification number: G06F12/0253 , G06F3/0608 , G06F3/061 , G06F3/0611 , G06F3/0619 , G06F3/0638 , G06F3/064 , G06F3/0641 , G06F3/0643 , G06F3/0665 , G06F3/0683 , G06F3/0688 , G06F3/0689 , G06F12/10 , G06F17/30327 , G06F2212/1044 , G06F2212/65
Abstract: A technique quantifies logical storage space trapped in an extent store due to overlapping write requests associated with volume metadata managed by the volume layer. 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. When a level of the dense tree is full, the volume metadata entries of the level are merged with a next lower level of the dense tree in accordance with a merge operation. Illustratively, the technique may be invoked during the merge operation to examine the volume metadata entries at each level of the dense tree involved in the merge and determine the LBA range overlap of the entries. To that end, the technique may include an algorithm configured to calculate the overlapping space per level and then aggregate the overlapping space of all levels involved in the merge operation to arrive at a result that quantifies the logical storage space trapped in the extent store.
Abstract translation: 由于与由卷层管理的卷元数据相关联的写入请求重叠，技术可以量化存储在存储区中的逻辑存储空间。 卷元数据被示意性地组织为多级密集树元数据结构，其中密集树元数据结构（密集树）的每个级别包括用于存储卷元数据的卷元数据条目。 当密集树的级别满时，根据合并操作，级别的卷元数据条目与密集树的下一个较低级别合并。 说明性地，可以在合并操作期间调用该技术来检查在合并中涉及的密集树的每个级别的卷元数据条目，并确定条目的LBA范围重叠。 为此，该技术可以包括被配置为计算每个级别的重叠空间并且然后聚合合并操作中涉及的所有级别的重叠空间的算法，以得到量化在范围存储中被捕获的逻辑存储空间的结果的算法。
-
公开(公告)号：US20180095685A1
公开(公告)日：2018-04-05
申请号：US15820004
申请日：2017-11-21
Applicant: NetApp, Inc.
Inventor： Janice D'Sa , Ling Zheng , Blake H. Lewis
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.
-
10.发明申请公开(公告)号：US20170046257A1
公开(公告)日：2017-02-16
申请号：US15336096
申请日：2016-10-27
Applicant: NetApp, Inc.
Inventor： Sriranjani Babu , Janice D'Sa
CPC classification number: G06F12/0253 , G06F3/0608 , G06F3/061 , G06F3/0611 , G06F3/0619 , G06F3/0638 , G06F3/064 , G06F3/0641 , G06F3/0643 , G06F3/0665 , G06F3/0683 , G06F3/0688 , G06F3/0689 , G06F12/10 , G06F17/30327 , G06F2212/1044 , G06F2212/65
Abstract: A technique quantifies logical storage space trapped in an extent store due to overlapping write requests associated with volume metadata managed by the volume layer. 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. When a level of the dense tree is full, the volume metadata entries of the level are merged with a next lower level of the dense tree in accordance with a merge operation. Illustratively, the technique may be invoked during the merge operation to examine the volume metadata entries at each level of the dense tree involved in the merge and determine the LBA range overlap of the entries. To that end, the technique may include an algorithm configured to calculate the overlapping space per level and then aggregate the overlapping space of all levels involved in the merge operation to arrive at a result that quantifies the logical storage space trapped in the extent store.
Abstract translation: 由于与由卷层管理的卷元数据相关联的写入请求重叠，技术可以量化存储在存储区中的逻辑存储空间。 卷元数据被示意性地组织为多级密集树元数据结构，其中密集树元数据结构（密集树）的每个级别包括用于存储卷元数据的卷元数据条目。 当密集树的级别满时，根据合并操作，级别的卷元数据条目与密集树的下一个较低级别合并。 说明性地，可以在合并操作期间调用该技术来检查在合并中涉及的密集树的每个级别的卷元数据条目，并确定条目的LBA范围重叠。 为此，该技术可以包括被配置为计算每个级别的重叠空间并且然后聚合合并操作中涉及的所有级别的重叠空间的算法，以得到量化在范围存储中被捕获的逻辑存储空间的结果的算法。
-
-
-
-
-
-
-
-
-
Search Results
14
records
(took 0.021 seconds)
