-
公开(公告)号：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范围重叠。 为此，该技术可以包括被配置为计算每个级别的重叠空间并且然后聚合合并操作中涉及的所有级别的重叠空间的算法，以得到量化在范围存储中被捕获的逻辑存储空间的结果的算法。
-
公开(公告)号：US20170097771A1
公开(公告)日：2017-04-06
申请号：US14872793
申请日：2015-10-01
Applicant: NetApp, Inc.
Inventor： Srinath Krishnamachari , Anshul Pundir , Sriranjani Babu
IPC: G06F3/06
CPC classification number: G06F3/0604 , G06F3/0631 , G06F3/0688 , G06F11/1076 , G06F11/1471 , G06F11/1474 , G06F11/3476 , G06F2201/805 , G06F2201/85
Abstract: A layout of a transaction log enables efficient logging of metadata into entries of the log, as well as efficient reclamation and recovery of the log entries by a volume layer of a storage input/output (I/O) stack executing on one or more nodes of a cluster. The transaction log is illustratively a two stage, append-only logging structure, wherein the first level is non-volatile random access memory (NVRAM) embodied as a NV log and the second stage is disk, e.g., solid state drive (SSD). The layout of the logging structure facilitates steady-state logging of metadata managed by the volume layer and crash recovery. Steady-state logging of metadata into the log entries occurs while the storage I/O stack of a node actively processes I/O requests, while crash recovery of the log entries occurs after an unexpected shutdown of the node.
-
公开(公告)号：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范围重叠。 为此，该技术可以包括被配置为计算每个级别的重叠空间并且然后聚合合并操作中涉及的所有级别的重叠空间的算法，以得到量化在范围存储中被捕获的逻辑存储空间的结果的算法。
-
Patent Agency Ranking
公开(公告)号：US09952765B2
公开(公告)日：2018-04-24
申请号：US14876572
申请日：2015-10-06
Applicant: NetApp, Inc.
Inventor： Srinath Krishnamachari , Anshul Pundir , Sriranjani Babu
CPC classification number: G06F3/0604 , G06F3/0631 , G06F3/0688 , G06F11/1076 , G06F11/1471 , G06F11/1474 , G06F2201/805 , G06F2201/85
Abstract: A layout of a transaction log enables efficient logging of metadata into entries of the log, as well as efficient reclamation and recovery of the log entries by a volume layer of a storage input/output (I/O) stack executing on one or more nodes of a cluster. The transaction log is illustratively a two stage, append-only logging structure, wherein the first level is non-volatile random access memory (NVRAM) embodied as a NVlog and the second stage is disk, e.g., solid state drive (SSD). During crash recovery, the log entries are examined for consistency and scanned to identify those entries that have completed and those that are active, which require replay. The log entries are walked from oldest to newest (using sequence numbers) searching for the highest sequence number. Partially complete log entries (e.g., log entries in-progress when a crash occurs) may be discarded for failing a checksum (e.g., a CRC error). Old value/new value logs may be used to implement roll-forward or roll-back semantics to replay the log entries and fix any on-disk data structures, first from NVRAM and then from on-disk logs.
-
5.发明申请公开(公告)号：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范围重叠。 为此，该技术可以包括被配置为计算每个级别的重叠空间并且然后聚合合并操作中涉及的所有级别的重叠空间的算法，以得到量化在范围存储中被捕获的逻辑存储空间的结果的算法。
-
公开(公告)号：US09846539B2
公开(公告)日：2017-12-19
申请号：US15004101
申请日：2016-01-22
Applicant: NetApp, Inc.
Inventor： Sriranjani Babu , Mandar Naik , Srinath Krishnamachari , Dhaval Patel
CPC classification number: G06F3/0608 , G06F3/0641 , G06F3/0655 , G06F3/0665 , G06F3/0685 , G06F3/0688 , G06F11/1407 , G06F11/1435
Abstract: A technique recovers from a low space condition associated with storage space reserved in an extent store to accommodate write requests received from a host and associated metadata managed by a layered file system of a storage input/output (I/O) stack executing on one or more nodes of a cluster. The write requests, including user data, are persistently recorded on non-volatile random access memory (NVRAM) prior to returning an acknowledgement to the host by a persistence layer of the storage I/O stack. Volume metadata managed by a volume layer of the layered file system is embodied as mappings from logical block addresses (LBAs) of a logical unit (LUN) accessible by the host to extent keys maintained by an extent store layer of the layered file system. Extent store metadata managed by the extent store layer is embodied as mappings from the extent keys to the storage locations of the extents on storage devices of storage arrays coupled to the nodes of the cluster. The space recovery technique accounts for storage space consumed in the extent store by user operations, i.e., write operations for the user data stored on the NVRAM at the persistence layer as well as the associated volume and extent store metadata, to ensure that the user data and associated metadata can be safely and reliably persisted in the extent store even during a low space condition.
-
公开(公告)号：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.
-
公开(公告)号：US20170097873A1
公开(公告)日：2017-04-06
申请号：US14876572
申请日：2015-10-06
Applicant: NetApp, Inc.
Inventor： Srinath Krishnamachari , Anshul Pundir , Sriranjani Babu
IPC: G06F11/14
CPC classification number: G06F3/0604 , G06F3/0631 , G06F3/0688 , G06F11/1076 , G06F11/1471 , G06F11/1474 , G06F2201/805 , G06F2201/85
Abstract: A layout of a transaction log enables efficient logging of metadata into entries of the log, as well as efficient reclamation and recovery of the log entries by a volume layer of a storage input/output (I/O) stack executing on one or more nodes of a cluster. The transaction log is illustratively a two stage, append-only logging structure, wherein the first level is non-volatile random access memory (NVRAM) embodied as a NVlog and the second stage is disk, e.g., solid state drive (SSD). During crash recovery, the log entries are examined for consistency and scanned to identify those entries that have completed and those that are active, which require replay. The log entries are walked from oldest to newest (using sequence numbers) searching for the highest sequence number. Partially complete log entries (e.g., log entries in-progress when a crash occurs) may be discarded for failing a checksum (e.g., a CRC error). Old value/new value logs may be used to implement roll-forward or roll-back semantics to replay the log entries and fix any on-disk data structures, first from NVRAM and then from on-disk logs.
-
-
-
-
-
-
-
Search Results
8
records
(took 0.015 seconds)
