GLOBAL IN-LINE EXTENT-BASED DEDUPLICATION
    41.
    发明申请
    GLOBAL IN-LINE EXTENT-BASED DEDUPLICATION 审中-公开
    全球在线基于广泛的配套

    公开(公告)号:US20150193169A1

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

    申请号:US14160216

    申请日:2014-01-21

    Applicant: NetApp, Inc.

    Abstract: In one embodiment, a layered file system of a storage input/output (I/O) stack executes on one or more nodes of a cluster. The layered file system includes a flash-optimized, log-structured layer configured to provide sequential storage of data and metadata (i.e., a log-structured layout) on solid state drives (SSDs) of storage arrays in the cluster to reduce write amplification, while leveraging a data de-duplication feature of the storage I/O stack. An extent store layer of the file system performs and maintains mappings of the extent keys to SSD storage locations, while a volume layer of the file system performs and maintains mappings of the LUN offset ranges to the extent keys. Separation of the mapping functions between the volume and extent store layers enables different volumes with different offset ranges to reference a same extent key (and thus a same extent).

    Abstract translation: 在一个实施例中,存储输入/输出(I / O)堆栈的分层文件系统在集群的一个或多个节点上执行。 分层文件系统包括闪存优化的日志结构化层,其被配置为在集群中的存储阵列的固态驱动器(SSD)上提供对数据和元数据的顺序存储(即,日志结构化布局),以减少写入放大, 同时利用存储I / O堆栈的重复数据删除功能。 文件系统的扩展存储层执行并维护扩展密钥到SSD存储位置的映射,而文件系统的卷层执行并维护LUN偏移范围到扩展密钥的映射。 卷和卷存储层之间的映射函数的分离使得具有不同偏移范围的不同卷可以引用相同的扩展密钥(并因此相同的扩展)。

    DENSE TREE VOLUME METADATA UPDATE LOGGING AND CHECKPOINTING
    42.
    发明申请
    DENSE TREE VOLUME METADATA UPDATE LOGGING AND CHECKPOINTING 有权
    DENSE TREE VOLUME METADATA UPDATE LOGGING和CHECKPOINTING

    公开(公告)号:US20150142817A1

    公开(公告)日:2015-05-21

    申请号:US14084137

    申请日:2013-11-19

    Applicant: NetApp, Inc.

    Abstract: In one embodiment, a node of a cluster executing a storage input/output (I/O) stack having a volume layer, stores a multi-level dense tree metadata structure. Each level of the dense tree metadata structure includes volume metadata entries for storing volume metadata. One or more non-volatile logs (NVLogs) are updated. The one or more NVLogs including a volume layer log configured to record changes to the volume metadata, wherein volume metadata entries inserted into a top-level of the dense tree metadata structure are recorded in the volume layer log. The node writes volume metadata entries from the volume layer log to one or more storage devices to be stored as extents.

    Abstract translation: 在一个实施例中,执行具有卷层的存储输入/输出(I / O)堆栈的集群的节点存储多级密集树元数据结构。 密集树元数据结构的每一级包括用于存储卷元数据的卷元数据条目。 一个或多个非易失性日志(NVLogs)被更新。 一个或多个NVLog,包括配置为记录卷元数据的更改的卷层日志,其中插入到密集树元数据结构的顶层的卷元数据条目被记录在卷层日志中。 节点将卷元数据条目从卷层日志写入一个或多个存储设备以作为扩展区存储。

    EXTENT HASHING TECHNIQUE FOR DISTRIBUTED STORAGE ARCHITECTURE
    43.
    发明申请
    EXTENT HASHING TECHNIQUE FOR DISTRIBUTED STORAGE ARCHITECTURE 有权
    用于分布式存储架构的大规模清洗技术

    公开(公告)号:US20150095347A1

    公开(公告)日:2015-04-02

    申请号:US14160048

    申请日:2014-01-21

    Applicant: NetApp, Inc.

    Abstract: In one embodiment, an extent hashing technique is used to efficiently distribute data and associated metadata substantially evenly among nodes of a cluster. The data may be write data associated with a write request issued by a host and received at a node of the cluster. The write data may be organized into one or more extents. A hash function may be applied to the extent to generate a result which may be truncated or trimmed to generate a hash value. A hash space of the hash value may be divided into a plurality of buckets representative of the write data, i.e., the extents, and the associated metadata, i.e., extent metadata. A number of buckets may be assigned to each extent store instance of the nodes to distribute ownership of the buckets, along with their extents and extent metadata, across all of the extent store instances of the nodes.

    Abstract translation: 在一个实施例中,使用扩展散列技术来有效地在簇的节点之间均匀地分布数据和相关联的元数据。 数据可以是与由主机发出并在集群的节点处接收的写入请求相关联的写入数据。 写入数据可以被组织成一个或多个范围。 可以将哈希函数应用于生成可能被截断或修剪以生成哈希值的结果的程度。 哈希值的散列空间可以被划分为代表写入数据的多个存储桶,即扩展区以及相关联的元数据,即扩展元数据。 可以将多个桶分配给节点的每个盘区存储实例,以在节点的所有范围存储实例之间分配桶的所有权以及它们的盘区和盘区元数据。

    EXTENT HASHING TECHNIQUE FOR DISTRIBUTED STORAGE ARCHITECTURE
    44.
    发明申请
    EXTENT HASHING TECHNIQUE FOR DISTRIBUTED STORAGE ARCHITECTURE 有权
    用于分布式存储架构的大规模清洗技术

    公开(公告)号:US20150095346A1

    公开(公告)日:2015-04-02

    申请号:US14044624

    申请日:2013-10-02

    Applicant: NetApp, Inc.

    Abstract: In one embodiment, a technique is provided for distributing data and associated metadata within a distributed storage architecture. A set of hash tables that embody mappings of cluster-wide identifiers associated with storage locations are stored for write data of write requests organized into extents. A hash value is generated from a hash function applied to each extent. The hash value is overloaded and used for multiple purposes within the distributed storage architecture, including (i) a remainder computation on the hash value to select a bucket of a plurality of buckets representative of the extents, (ii) a hash table selector of the hash value to select a hash table from the set of hash tables, and (iii) a hash table index computed from the hash value to select an entry from a plurality of entries of the selected hash table having a cluster-wide identifier identifying a storage location for the extent.

    Abstract translation: 在一个实施例中,提供了用于在分布式存储架构内分发数据和相关元数据的技术。 存储与存储位置相关联的集群范围标识符的映射的一组哈希表,用于组织到扩展区中的写入请求的写入数据。 从应用于每个区段的散列函数生成哈希值。 散列值被重载并用于分布式存储体系结构中的多个目的,包括(i)散列值的余数计算,以选择代表范围的多个存储桶的桶,(ii)哈希表选择器 散列值以从所述散列表集合中选择散列表,以及(iii)根据所述散列值计算的散列表索引,以从所述选定的散列表的多个条目中选择具有标识存储器的集群范围标识符的条目 位置的程度。

    Extension of write anywhere file system layout
    45.
    发明授权
    Extension of write anywhere file system layout 有权
    扩展写任意文件系统布局

    公开(公告)号:US08990539B2

    公开(公告)日:2015-03-24

    申请号:US14077812

    申请日:2013-11-12

    Applicant: NetApp, Inc.

    CPC classification number: G06F3/0689 G06F3/0619 G06F3/0665 G06F17/30233

    Abstract: A file system layout apportions an underlying physical volume into one or more virtual volumes (vvols) of a storage system. The underlying physical volume is an aggregate comprising one or more groups of disks, such as RAID groups, of the storage system. The aggregate has its own physical volume block number (pvbn) space and maintains metadata, such as block allocation structures, within that pvbn space. Each vvol has its own virtual volume block number (vvbn) space and maintains metadata, such as block allocation structures, within that vvbn space. Notably, the block allocation structures of a vvol are sized to the vvol, and not to the underlying aggregate, to thereby allow operations that manage data served by the storage system (e.g., snapshot operations) to efficiently work over the vvols. The file system layout extends the file system layout of a conventional write anywhere file layout system implementation, yet maintains performance properties of the conventional implementation.

    Abstract translation: 文件系统布局将底层物理卷分配到存储系统的一个或多个虚拟卷(vvols)中。 底层物理卷是包含存储系统的一组或多组磁盘(如RAID组)的聚合。 聚合具有自己的物理卷块数(pvbn)空间,并在该pvbn空间内维护诸如块分配结构的元数据。 每个vvol具有自己的虚拟卷块号(vvbn)空间,并在该vvbn空间内维护诸如块分配结构的元数据。 值得注意的是,vvol的块分配结构的大小适合于vvol,而不是基础聚合,从而允许管理由存储系统服务的数据(例如,快照操作)的操作有效地在vvols上工作。 文件系统布局扩展了常规写入任何文件布局系统实现的文件系统布局,但是保持了传统实现的性能特性。

Patent Agency Ranking