-
1.发明申请公开(公告)号：US20160132396A1
公开(公告)日：2016-05-12
申请号：US15001401
申请日：2016-01-20
Applicant: NetApp, Inc.
Inventor： Jeffrey S. Kimmel , T. Byron Rakitzis
CPC classification number: G06F11/1407 , G06F11/1417 , G06F11/1438 , G06F11/1464 , G06F11/1471 , G06F12/0246 , G06F16/128 , G06F16/2228 , G06F16/2255 , G06F2201/80 , G06F2201/84
Abstract: In one embodiment, an extent store layer of a storage input/output (I/O) stack executing on one or more nodes of a cluster manages efficient logging and checkpointing of metadata. The metadata managed by the extent store layer, i.e., the extent store metadata, resides in a memory (in-core) of each node and is illustratively organized as a key-value extent store embodied as one or more data structures, e.g., a set of hash tables. Changes to the set of hash tables are recorded as a continuous stream of changes to SSD embodied as an extent store layer log. A separate log stream structure (e.g., an in-core buffer) may be associated respectively with each hash table such that changed (i.e., dirtied) slots of the hash table are recorded as entries in the log stream structure. The hash tables are written to SSD using a fuzzy checkpointing technique.
Abstract translation: 在一个实施例中，在集群的一个或多个节点上执行的存储输入/输出（I / O）堆栈的盘区存储层管理元数据的有效日志记录和检查点。 由盘区存储层管理的元数据，即盘区存储元数据，驻留在每个节点的存储器（内核）中，并且被说明性地组织为体现为一个或多个数据结构的键值范围存储，例如， 一组哈希表。 对这组哈希表的更改记录为作为扩展存储层日志实现的SSD的连续变化流。 单独的日志流结构（例如，核内缓冲器）可以分别与每个散列表相关联，使得散列表的改变（即，脏的）时隙被记录在日志流结构中作为条目。 使用模糊检查点技术将哈希表写入SSD。
-
公开(公告)号：US20160274973A1
公开(公告)日：2016-09-22
申请号：US15166600
申请日：2016-05-27
Applicant: NetApp, Inc.
Inventor： Rajesh Sundaram , Bharat Baddepudi , Jeffrey S. Kimmel , T. Byron Rakitzis
CPC classification number: G06F11/1084 , G06F3/0619 , G06F3/065 , G06F3/0653 , G06F3/0688 , G06F3/0689 , G06F11/1008 , G06F11/1068 , G06F11/1076 , G06F11/108 , G06F11/1092 , G06F11/1096 , G06F17/30218 , G06F2211/1057 , G11C29/52
Abstract: Embodiments described herein are directed to a file system driven RAID rebuild technique. A layered file system may organize storage of data as segments spanning one or more sets of storage devices, such as solid state drives (SSDs), of a storage array, wherein each set of SSDs may form a RAID group configured to provide data redundancy for a segment. The file system may then drive (i.e., initiate) rebuild of a RAID configuration of the SSDs on a segment-by-segment basis in response to cleaning of the segment (i.e., segment cleaning). Each segment may include one or more RAID stripes that provide a level of data redundancy (e.g., single parity RAID 5 or double parity RAID 6) as well as RAID organization (i.e., distribution of data and parity) for the segment. Notably, the level of data redundancy and RAID organization may differ among the segments of the array.
Abstract translation: 本文描述的实施例涉及文件系统驱动的RAID重建技术。 分层文件系统可以将数据的存储组织为跨越存储阵列的一组或多组存储设备（例如固态驱动器（SSD））的段，其中每组SSD可以形成RAID组，其被配置为提供数据冗余 一段 然后文件系统可以响应于段的清除（即，段清除）逐个段地驱动（即，启动）重建SSD的RAID配置。 每个段可以包括一个或多个提供数据冗余级别（例如，单个奇偶校验RAID 5或双奇偶校验RAID 6）的RAID条带以及用于该段的RAID组织（即，数据和奇偶校验的分配）。 值得注意的是，数据冗余和RAID组织的级别可能在阵列的各个部分之间不同。
-
3.发明授权Set-associative hash table organization for efficient storage and retrieval of data in a storage system 有权集合关联哈希表组织，用于存储系统中的数据的高效存储和检索公开(公告)号：US09256549B2
公开(公告)日：2016-02-09
申请号：US14158608
申请日：2014-01-17
Applicant: NetApp, Inc.
Inventor： Jeffrey S. Kimmel , T. Byron Rakitzis
CPC classification number: G06F3/061 , G06F3/0608 , G06F3/0611 , G06F3/0638 , G06F3/064 , G06F3/0665 , G06F3/0688 , G06F17/30067 , G06F17/30097 , G06F2003/0692
Abstract: In one embodiment, an extent key reconstruction technique is provided for use with a set of hash tables embodying metadata. The metadata includes an extent key associated with a storage location on storage devices for write data of one or more write requests organized into an extent. Each hash table has a plurality of entries, and each entry includes a plurality of slots. A first field of the extent key is recreated implicitly from an entry in a first address space portion of a hash table. A second field of the extent key is stored in the slot. A third field of the extent key is stored in the slot. A fourth field of the extent key is recreated implicitly from the hash table of the set of hash tables.
Abstract translation: 在一个实施例中，提供了扩展密钥重建技术，用于与体现元数据的一组哈希表一起使用。 元数据包括与存储设备上的存储位置相关联的扩展密钥，用于组织成一个范围的一个或多个写入请求的写入数据。 每个散列表具有多个条目，并且每个条目包括多个时隙。 从哈希表的第一地址空间部分中的条目隐式地重建扩展密钥的第一字段。 扩展密钥的第二个字段存储在插槽中。 扩展密钥的第三个字段存储在插槽中。 扩展密钥的第四个字段是从哈希表集合的散列表中隐式重新创建的。
-
公开(公告)号：US10013311B2
公开(公告)日：2018-07-03
申请号：US15166600
申请日：2016-05-27
Applicant: NetApp, Inc.
Inventor： Rajesh Sundaram , Bharat Baddepudi , Jeffrey S. Kimmel , T. Byron Rakitzis
CPC classification number: G06F11/1084 , G06F3/0619 , G06F3/065 , G06F3/0653 , G06F3/0688 , G06F3/0689 , G06F11/1008 , G06F11/1068 , G06F11/1076 , G06F11/108 , G06F11/1092 , G06F11/1096 , G06F16/1847 , G06F2211/1057 , G11C29/52
Abstract: Embodiments described herein are directed to a file system driven RAID rebuild technique. A layered file system may organize storage of data as segments spanning one or more sets of storage devices, such as solid state drives (SSDs), of a storage array, wherein each set of SSDs may form a RAID group configured to provide data redundancy for a segment. The file system may then drive (i.e., initiate) rebuild of a RAID configuration of the SSDs on a segment-by-segment basis in response to cleaning of the segment (i.e., segment cleaning). Each segment may include one or more RAID stripes that provide a level of data redundancy (e.g., single parity RAID 5 or double parity RAID 6) as well as RAID organization (i.e., distribution of data and parity) for the segment. Notably, the level of data redundancy and RAID organization may differ among the segments of the array.
-
公开(公告)号：US09639278B2
公开(公告)日：2017-05-02
申请号：US14927230
申请日：2015-10-29
Applicant: NetApp, Inc.
Inventor： Jeffrey S. Kimmel , T. Byron Rakitzis
CPC classification number: G06F3/061 , G06F3/0608 , G06F3/0611 , G06F3/0638 , G06F3/064 , G06F3/0665 , G06F3/0688 , G06F17/30067 , G06F17/30097 , G06F2003/0692
Abstract: The embodiments described herein are directed to the use of hashing in a file system metadata arrangement that reduces an amount of metadata stored in a memory of a node in a cluster and that reduces the amount of metadata needed to process an input/output (I/O) request at the node. Illustratively, the embodiments are directed to cuckoo hashing and, in particular, to a manner in which cuckoo hashing may be modified and applied to construct the file system metadata arrangement. In an embodiment, the file system metadata arrangement may be illustratively include a hash collision technique that employs a hash collision computation to determine a unique candidate extent key (having a candidate hash table index) in the event of a collision, i.e., a hash table index collides with a slot of a hash table matching a key found in the slot.
-
Patent Agency Ranking
6.发明申请SET-ASSOCIATIVE HASH TABLE ORGANIZATION FOR EFFICIENT STORAGE AND RETRIEVAL OF DATA IN A STORAGE SYSTEM 审中-公开SET-ASSOCIATIVE HASH TABLE组织，用于存储系统中数据的有效存储和检索公开(公告)号：US20160048332A1
公开(公告)日：2016-02-18
申请号：US14927230
申请日：2015-10-29
Applicant: NetApp, Inc.
Inventor： Jeffrey S. Kimmel , T. Byron Rakitzis
IPC: G06F3/06
CPC classification number: G06F3/061 , G06F3/0608 , G06F3/0611 , G06F3/0638 , G06F3/064 , G06F3/0665 , G06F3/0688 , G06F17/30067 , G06F17/30097 , G06F2003/0692
Abstract: The embodiments described herein are directed to the use of hashing in a file system metadata arrangement that reduces an amount of metadata stored in a memory of a node in a cluster and that reduces the amount of metadata needed to process an input/output (I/O) request at the node. Illustratively, the embodiments are directed to cuckoo hashing and, in particular, to a manner in which cuckoo hashing may be modified and applied to construct the file system metadata arrangement. In an embodiment, the file system metadata arrangement may be illustratively include a hash collision technique that employs a hash collision computation to determine a unique candidate extent key (having a candidate hash table index) in the event of a collision, i.e., a hash table index collides with a slot of a hash table matching a key found in the slot.
Abstract translation: 这里描述的实施例涉及在文件系统元数据排列中使用散列来减少存储在群集中的节点的存储器中的元数据量并减少处理输入/输出所需的元数据量（I / O）请求。 示例性地，实施例针对杜鹃散列，并且特别地涉及可以修改和应用杜鹃散列以构造文件系统元数据排列的方式。 在一个实施例中，文件系统元数据装置可以说明性地包括哈希冲突技术，该冲突技术采用哈希冲突计算来确定在冲突的情况下的唯一的候选扩展密钥（具有候选散列表索引），即哈希表 索引与与插槽中找到的密钥匹配的散列表的时隙冲突。
-
7.发明申请SET-ASSOCIATIVE HASH TABLE ORGANIZATION FOR EFFICIENT STORAGE AND RETRIEVAL OF DATA IN A STORAGE SYSTEM 有权SET-ASSOCIATIVE HASH TABLE组织，用于存储系统中数据的有效存储和检索公开(公告)号：US20150205727A1
公开(公告)日：2015-07-23
申请号：US14158608
申请日：2014-01-17
Applicant: NetApp, Inc.
Inventor： Jeffrey S. Kimmel , T. Byron Rakitzis
CPC classification number: G06F3/061 , G06F3/0608 , G06F3/0611 , G06F3/0638 , G06F3/064 , G06F3/0665 , G06F3/0688 , G06F17/30067 , G06F17/30097 , G06F2003/0692
Abstract: In one embodiment, an extent key reconstruction technique is provided for use with a set of hash tables embodying metadata. The metadata includes an extent key associated with a storage location on storage devices for write data of one or more write requests organized into an extent. Each hash table has a plurality of entries, and each entry includes a plurality of slots. A first field of the extent key is recreated implicitly from an entry in a first address space portion of a hash table. A second field of the extent key is stored in the slot. A third field of the extent key is stored in the slot. A fourth field of the extent key is recreated implicitly from the hash table of the set of hash tables.
Abstract translation: 在一个实施例中，提供了扩展密钥重建技术，用于与体现元数据的一组哈希表一起使用。 元数据包括与存储设备上的存储位置相关联的扩展密钥，用于组织成一个范围的一个或多个写入请求的写入数据。 每个散列表具有多个条目，并且每个条目包括多个时隙。 从哈希表的第一地址空间部分中的条目隐式地重建扩展密钥的第一字段。 扩展密钥的第二个字段存储在插槽中。 扩展密钥的第三个字段存储在插槽中。 扩展密钥的第四个字段是从哈希表集合的散列表中隐式重新创建的。
-
8.发明申请公开(公告)号：US20150205680A1
公开(公告)日：2015-07-23
申请号：US14158689
申请日：2014-01-17
Applicant: NetApp, Inc.
Inventor： Jeffrey S. Kimmel , T. Byron Rakitzis
CPC classification number: G06F11/1407 , G06F11/1417 , G06F11/1438 , G06F11/1464 , G06F11/1471 , G06F12/0246 , G06F17/30088 , G06F17/30321 , G06F17/3033 , G06F2201/80 , G06F2201/84
Abstract: In one embodiment, a cluster uses an extent store layer and a set of hash tables having a plurality of slots embodying extent metadata that describe write data of one or more write requests organized into one or more extents. One or more non-volatile logs (NVLogs) are maintained in the cluster. The one or more NVLogs include an extent store layer log maintained by the extent store layer. The extent store layer log records changes to the set of hash tables as a plurality of log stream structures, where each log stream structure is associated with a hash table. One or more storage devices of the cluster are organized as a plurality of log streams, where each log stream is associated with a corresponding log stream structure of the extent store layer log.
Abstract translation: 在一个实施例中，集群使用扩展存储层和具有多个时隙的散列表集合，该多个时隙体现了描述组织成一个或多个扩展区的一个或多个写入请求的写入数据的扩展元数据。 集群中维护一个或多个非易失性日志（NVLogs）。 一个或多个NVLogs包括由扩展存储层维护的扩展存储层日志。 扩展存储层日志将更改作为多个日志流结构记录到哈希表集合，其中每个日志流结构与散列表相关联。 集群的一个或多个存储设备被组织为多个日志流，其中每个日志流与扩展存储层日志的对应日志流结构相关联。
-
公开(公告)号：US08880787B1
公开(公告)日：2014-11-04
申请号：US14160259
申请日：2014-01-21
Applicant: NetApp, Inc.
Inventor： Jeffrey S. Kimmel , T. Byron Rakitzis
CPC classification number: G06F11/1407 , G06F11/1417 , G06F11/1438 , G06F11/1464 , G06F11/1471 , G06F12/0246 , G06F17/30088 , G06F17/30321 , G06F17/3033 , G06F2201/80 , G06F2201/84
Abstract: In one embodiment, an extent store layer of a storage input/output (I/O) stack executing on one or more nodes of a cluster manages efficient logging and checkpointing of metadata. The metadata managed by the extent store layer, i.e., the extent store metadata, resides in a memory (in-core) of each node and is illustratively organized as a key-value extent store embodied as one or more data structures, e.g., a set of hash tables. Changes to the set of hash tables are recorded as a continuous stream of changes to SSD embodied as an extent store layer log. A separate log stream structure (e.g., an in-core buffer) may be associated respectively with each hash table such that changed (i.e., dirtied) slots of the hash table are recorded as entries in the log stream structure. The hash tables are written to SSD using a fuzzy checkpointing technique.
Abstract translation: 在一个实施例中，在集群的一个或多个节点上执行的存储输入/输出（I / O）堆栈的盘区存储层管理元数据的有效日志记录和检查点。 由盘区存储层管理的元数据，即盘区存储元数据，驻留在每个节点的存储器（内核）中，并且被说明性地组织为体现为一个或多个数据结构的键值范围存储，例如， 一组哈希表。 对这组哈希表的更改记录为作为扩展存储层日志实现的SSD的连续变化流。 单独的日志流结构（例如，内核缓冲器）可以分别与每个散列表相关联，使得哈希表的改变（即，脏的）时隙被记录在日志流结构中作为条目。 使用模糊检查点技术将哈希表写入SSD。
-
公开(公告)号：US09454434B2
公开(公告)日：2016-09-27
申请号：US14158448
申请日：2014-01-17
Applicant: NetApp, Inc.
Inventor： Rajesh Sundaram , Bharat Baddepudi , Jeffrey S. Kimmel , T. Byron Rakitzis
CPC classification number: G06F11/1084 , G06F3/0619 , G06F3/065 , G06F3/0653 , G06F3/0688 , G06F3/0689 , G06F11/1008 , G06F11/1068 , G06F11/1076 , G06F11/108 , G06F11/1092 , G06F11/1096 , G06F17/30218 , G06F2211/1057 , G11C29/52
Abstract: In one embodiment, one or more storage arrays of solid state drives (SSDs) that include a plurality of segments are organized as one or more redundant array of independent disks (RAID) groups, where the RAID groups provides data redundancy for the segments. A node executing a layered file system of a storage input/output (I/O) stack performs segment cleaning to clean the segments. It further initiates rebuild of a RAID configuration of the SSDs on a segment-by-segment basis in response to the segment cleaning. In such a configuration, each segment includes one or more RAID stripes that provide a level of data redundancy as well as RAID organization for the segment.
Abstract translation: 在一个实施例中，包括多个段的固态驱动器（SSD）的一个或多个存储阵列被组织为独立磁盘（RAID）组的一个或多个冗余阵列，其中RAID组为段提供数据冗余。 执行存储输入/输出（I / O）堆栈的分层文件系统的节点执行段清理来清理段。 它还响应于段清理，逐段启动重新构建SSD的RAID配置。 在这样的配置中，每个段包括一个或多个RAID条带，其提供数据冗余级别以及该段的RAID组织。
-
-
-
-
-
-
-
-
-
Search Results
14
records
(took 0.025 seconds)
