Global in-line extent-based deduplication
    13.
    发明授权
    Global in-line extent-based deduplication 有权
    全球在线范围重复数据删除

    公开(公告)号:US09529546B2

    公开(公告)日:2016-12-27

    申请号:US14150689

    申请日:2014-01-08

    Applicant: NetApp, Inc.

    Abstract: In one embodiment, a layered file system includes a volume layer and an extent store layer configured to provide sequential log-structured layout of data and metadata on solid state drives (SSDs) of one or more storage arrays. The data is organized as variable-length extents of one or more logical units (LUNs). The metadata includes volume metadata mappings from offset ranges of a LUN to extent keys and extent metadata mappings of the extent keys to storage locations of the extents on the SSDs. The extent store layer maintaining the extent metadata mappings determines whether an extent is stored on a storage array, and, in response to determination that the extent is stored on the storage array, returns an extent key for the stored extent to the volume layer to enable global inline de-duplication that obviates writing a duplicate copy of the extent on the storage array.

    Abstract translation: 在一个实施例中,分层文件系统包括卷层和盘区存储层,其被配置为在一个或多个存储阵列的固态驱动器(SSD)上提供数据和元数据的顺序日志结构布局。 数据被组织为一个或多个逻辑单元(LUN)的可变长度范围。 元数据包括从LUN的偏移范围到扩展密钥的卷元数据映射以及扩展密钥到SSD上的扩展区的存储位置的扩展元数据映射。 维护盘区元数据映射的盘区存储层确定盘区是否存储在存储阵列上,并且响应于确定盘区存储在存储阵列上,将存储的盘区的盘区密钥返回到卷层以启用 全局内联重复数据删除,从而避免在存储阵列上写入扩展区的重复副本。

    TECHNIQUE FOR REDUCING METADATA STORED IN A MEMORY OF A NODE
    14.
    发明申请
    TECHNIQUE FOR REDUCING METADATA STORED IN A MEMORY OF A NODE 有权
    用于减少存储在节点存储器中的元数据的技术

    公开(公告)号:US20160357743A1

    公开(公告)日:2016-12-08

    申请号:US14728482

    申请日:2015-06-02

    Applicant: NetApp, Inc.

    Abstract: A technique reduces an amount of metadata stored in a memory of a node in a cluster. An extent store layer of a storage input/output (I/O) stack executing on the node stores key-value pairs in a plurality of data structures, e.g., cuckoo hash tables, resident in the memory. The cuckoo hash table embodies metadata that describes an extent and, as such, may be organized to associate a location on disk with a value that identifies the location on disk. The value may be embodied as a locator that includes a reference count used to support deduplication functionality of the extent store layer with respect to the extent. The reference count is divided into two portions: a delta count portion stored in memory for each slot of the hash table and an overflow count portion stored on disk in a header of each extent. One bit of the delta count portion is reserved as an overflow bit that indicates whether the in-memory reference count has overflowed. Another bit of the delta count portion is reserved as a sign bit that indicates whether the value of the remaining delta count portion, which stores the “delta” of the reference count, is positive or negative. Overflow updates to the overflow count portion on disk are postponed until all of the bits of the delta count portion are consumed as negative/positive transitions.

    Abstract translation: 一种技术减少了存储在群集中的节点的存储器中的元数据量。 在节点上执行的存储输入/输出(I / O)堆栈的盘区存储层将密钥值对存储在驻留在存储器中的多个数据结构(例如,布谷鸟哈希表)中。 杜鹃哈希表体现了描述范围的元数据,因此可以被组织以将磁盘上的位置与标识磁盘上的位置的值相关联。 该值可以体现为定位器,其包括用于相对于该范围支持扩展存储层的重复数据删除功能的引用计数。 引用计数被分为两部分:存储在哈希表的每个时隙的存储器中的增量计数部分和存储在每个盘区的标题中的盘上的溢出计数部分。 增量计数部分的一位被保留为指示内存中引用计数是否溢出的溢出位。 增量计数部分的另一位被保留为符号位,其指示存储引用计数的“delta”的剩余增量计数部分的值是正还是负。 推迟到磁盘溢出计数部分的溢出更新,直到增量计数部分的所有位被消耗为负/正转移。

    GRANULAR SYNC/SEMI-SYNC ARCHITECTURE
    15.
    发明申请
    GRANULAR SYNC/SEMI-SYNC ARCHITECTURE 有权
    GRANULAR SYNC / SEMI SYNC ARCHITECTURE

    公开(公告)号:US20160065670A1

    公开(公告)日:2016-03-03

    申请号:US14473621

    申请日:2014-08-29

    Applicant: NetApp, Inc.

    Abstract: Data consistency and availability can be provided at the granularity of logical storage objects in storage solutions that use storage virtualization in clustered storage environments. To ensure consistency of data across different storage elements, synchronization is performed across the different storage elements. Changes to data are synchronized across storage elements in different clusters by propagating the changes from a primary logical storage object to a secondary logical storage object. To satisfy the strictest RPOs while maintaining performance, change requests are intercepted prior to being sent to a filesystem that hosts the primary logical storage object and propagated to a different managing storage element associated with the secondary logical storage object.

    Abstract translation: 可以在集群存储环境中使用存储虚拟化的存储解决方案中的逻辑存储对象的粒度提供数据一致性和可用性。 为了确保不同存储元件之间的数据的一致性,跨不同存储元件执行同步。 通过将更改从主逻辑存储对象传播到辅助逻辑存储对象,对数据的更改在不同群集中的存储元素之间进行同步。 为了在维护性能的同时满足最严格的RPO,在发送到托管主逻辑存储对象的文件系统之前,更改请求将被拦截,并传播到与辅助逻辑存储对象关联的其他管理存储元素。

    SET-ASSOCIATIVE HASH TABLE ORGANIZATION FOR EFFICIENT STORAGE AND RETRIEVAL OF DATA IN A STORAGE SYSTEM
    16.
    发明申请
    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.

    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)请求。 示例性地,实施例针对杜鹃散列,并且特别地涉及可以修改和应用杜鹃散列以构造文件系统元数据排列的方式。 在一个实施例中,文件系统元数据装置可以说明性地包括哈希冲突技术,该冲突技术采用哈希冲突计算来确定在冲突的情况下的唯一的候选扩展密钥(具有候选散列表索引),即哈希表 索引与与插槽中找到的密钥匹配的散列表的时隙冲突。

    DISTRIBUTING CAPACITY SLICES ACROSS STORAGE SYSTEM NODES
    17.
    发明申请
    DISTRIBUTING CAPACITY SLICES ACROSS STORAGE SYSTEM NODES 有权
    分布式存储系统编号的分配容量

    公开(公告)号:US20150355863A1

    公开(公告)日:2015-12-10

    申请号:US14695608

    申请日:2015-04-24

    Applicant: NetApp, Inc.

    Abstract: Various systems and methods are described for configuring a data storage system. In one embodiment, a plurality of actual capacities of a plurality of storage devices of the data storage system are identified and divided into a plurality of capacity slices. The plurality of capacity slices are combined into a plurality of chunks of capacity slices, each having a combination of characteristics of the underlying physical storage devices. The chunks of capacity slices are then mapped to a plurality of logical storage devices. A group of the plurality of logical storage devices is then organized into a redundant array of logical storage devices.

    Abstract translation: 描述了用于配置数据存储系统的各种系统和方法。 在一个实施例中,数据存储系统的多个存储设备的多个实际容量被识别并分成多个容量片。 多个容量片被组合成多个容量片段,每个片段具有底层物理存储设备的特征的组合。 然后将容量片的块块映射到多个逻辑存储设备。 然后将一组多个逻辑存储设备组织成逻辑存储设备的冗余阵列。

    DATA STORAGE WITHIN HYBRID STORAGE AGGREGATE
    18.
    发明申请
    DATA STORAGE WITHIN HYBRID STORAGE AGGREGATE 有权
    混合储存中的数据存储

    公开(公告)号:US20150227465A1

    公开(公告)日:2015-08-13

    申请号:US14695667

    申请日:2015-04-24

    Applicant: NetApp Inc.

    Abstract: Among other things, one or more techniques and/or systems are provided for storing data within a hybrid storage aggregate comprising a lower-latency storage tier and a higher-latency storage tier. In particular, frequently accessed data, randomly accessed data, and/or short lived data may be stored (e.g., read caching and/or write caching) within the lower-latency storage tier. Infrequently accessed data and/or sequentially accessed data may be stored within the higher-latency storage tier. Because the hybrid storage aggregate may comprise a single logical container derived from the higher-latency storage tier and the lower-latency storage tier, additional storage and/or file system functionality may be implemented across the storage tiers. For example, deduplication functionality, caching functionality, backup/restore functionality, and/or other functionality may be provided through a single file system (or other type of arrangement) and/or a cache map implemented within the hybrid storage aggregate.

    Abstract translation: 除其他之外,提供一个或多个技术和/或系统用于在包括较低延迟存储层和较高延迟存储层的混合存储聚合中存储数据。 特别地,经常访问的数据,随机访问的数据和/或短寿命数据可以在较低延迟存储层内被存储(例如,读取高速缓存和/或写入高速缓存)。 不经常访问的数据和/或顺序访问的数据可以存储在更高延迟的存储层中。 因为混合存储聚合可以包括从较高延迟存储层和较低延迟存储层导出的单个逻辑容器,所以可以跨存储层实现附加的存储和/或文件系统功能。 例如,重复数据删除功能,缓存功能,备份/恢复功能和/或其他功能可以通过单个文件系统(或其他类型的安排)和/或在混合存储聚合中实现的缓存映射来提供。

    CLUSTERED RAID DATA ORGANIZATION
    19.
    发明申请
    CLUSTERED RAID DATA ORGANIZATION 有权
    集群RAID数据组织

    公开(公告)号:US20150205663A1

    公开(公告)日:2015-07-23

    申请号:US14157828

    申请日:2014-01-17

    Applicant: NetApp, Inc.

    Abstract: In one embodiment, a node of a cluster having a plurality of nodes, executes a storage input/output (I/O) stack having a redundant array of independent disks (RAID) layer. The RAID layer organizes solid state drives (SSDs) within one or more storage arrays as a plurality of RAID groups associated with one or more extent stores. The RAID groups are formed from slices of storage spaces of the SSDs instead of entire storage spaces of the SSDs. This provides for RAID groups to co-exist on a same set of the SSDs.

    Abstract translation: 在一个实施例中,具有多个节点的集群的节点执行具有独立磁盘冗余阵列(RAID)层的存储输入/输出(I / O)堆栈。 RAID层将一个或多个存储阵列中的固态驱动器(SSD)组织为与一个或多个扩展存储区相关联的多个RAID组。 RAID组由SSD的存储空间片而不是SSD的整个存储空间形成。 这提供了RAID组在同一组SSD上共存。

    Set-associative hash table organization for efficient storage and retrieval of data in a storage system
    20.
    发明授权
    Set-associative hash table organization for efficient storage and retrieval of data in a storage system 有权
    集合关联哈希表组织,用于存储系统中的数据的高效存储和检索

    公开(公告)号:US08874842B1

    公开(公告)日:2014-10-28

    申请号:US14160133

    申请日:2014-01-21

    Applicant: NetApp, Inc.

    Abstract: In one embodiment, use of hashing in a file system metadata arrangement reduces an amount of metadata stored in a memory of a node in a cluster and reduces the amount of metadata needed to process an input/output (I/O) request at the node. Illustratively, cuckoo hashing may be modified and applied to construct the file system metadata arrangement. The file system metadata arrangement may be illustratively configured as a key-value extent store embodied as a data structure, e.g., a cuckoo hash table, wherein a value, such as a hash table index, may be configured as an index and applied to the cuckoo hash table to obtain a key, such as an extent key, configured to reference a location of an extent on one or more storage devices, such as solid state drives.

    Abstract translation: 在一个实施例中,在文件系统元数据布置中使用散列减少了存储在群集中的节点的存储器中的元数据量,并且减少了处理在节点处的输入/输出(I / O)请求所需的元数据量 。 说明性地,可以修改并应用杜鹃散列来构建文件系统元数据排列。 文件系统元数据布置可以被示意性地配置为体现为数据结构的键值区段存储,例如布鲁克哈希表,其中诸如哈希表索引的值可以被配置为索引并应用于 布鲁克哈希表以获得诸如扩展密钥的密钥,其被配置为引用一个或多个存储设备(例如固态驱动器)上的盘区的位置。

Patent Agency Ranking