System and method for indexing user data on storage systems
    501.
    发明授权
    System and method for indexing user data on storage systems 有权
    在存储系统上索引用户数据的系统和方法

    公开(公告)号:US08868495B2

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

    申请号:US11847925

    申请日:2007-08-30

    CPC classification number: G06F17/30091 G06F17/301

    Abstract: A system and method for indexing user data on storage systems is provided. A client of the storage system executes a novel client side agent that is configured to detect changes to data stored by the client on the storage system. In response to detecting that data has been modified, the agent examines modified data containers and parses the modified data to identify new and/or modified index terms or the creation/deletion of data containers. Once the data has been parsed by the agent to identify new/modified index terms, the parsed data is transmitted from the agent to a management module executing on a management server. The management module receives the parsed data and updates a search database using the received parsed data.

    Abstract translation: 提供了一种用于在存储系统上索引用户数据的系统和方法。 存储系统的客户端执行新颖的客户端代理,该客户端代理被配置为检测客户端在存储系统上存储的数据的变化。 响应于检测到数据被修改,代理检查修改的数据容器并解析修改的数据以识别新的和/或修改的索引项或数据容器的创建/删除。 一旦数据被代理解析以​​识别新的/修改的索引项,则解析的数据从代理发送到在管理服务器上执行的管理模块。 管理模块接收解析的数据,并使用接收到的解析数据更新搜索数据库。

    TECHNIQUE FOR RAPIDLY CONVERTING BETWEEN STORAGE REPRESENTATIONS IN A VIRTUALIZED COMPUTING ENVIRONMENT
    502.
    发明申请
    TECHNIQUE FOR RAPIDLY CONVERTING BETWEEN STORAGE REPRESENTATIONS IN A VIRTUALIZED COMPUTING ENVIRONMENT 有权
    在虚拟化计算环境中快速转换存储表示的技术

    公开(公告)号:US20140281217A1

    公开(公告)日:2014-09-18

    申请号:US13796010

    申请日:2013-03-12

    Applicant: NETAPP, INC.

    Abstract: Embodiments described herein provide a storage conversion technique for rapidly converting between storage representations served by a storage system and presented to a host computer of a virtualized computing environment. The storage representations may include physical storage represented by a sequential set of blocks on disks of the storage system that are presented to the host computer in the form of a logical unit number (LUN) and virtual storage represented by a virtual storage device of the storage system that is presented to a hypervisor of the virtualized computing environment in the form of a virtual disk file. Illustratively, the LUN and virtual disk file may be storage objects (e.g., files) having different (file) types and formats in a volume of the storage system; yet each storage object may be organized as a buffer tree having indirect blocks that contain pointers configured to reference data blocks used to store data.

    Abstract translation: 本文描述的实施例提供了一种用于在由存储系统服务并呈现给虚拟化计算环境的主计算机的存储表示之间快速转换的存储转换技术。 存储表示可以包括以由逻辑单元号(LUN)的形式呈现给主计算机的由存储系统的磁盘上的顺序的块组合表示的物理存储器和由存储器的虚拟存储设备表示的虚拟存储 系统以虚拟磁盘文件的形式呈现给虚拟化计算环境的管理程序。 说明性地,LUN和虚拟磁盘文件可以是在存储系统的卷中具有不同(文件)类型和格式的存储对象(例如,文件) 但是每个存储对象可以被组织为具有间接块的缓冲器树,该间接块包含被配置为引用用于存储数据的数据块的指针。

    Application-controlled network packet classification
    503.
    发明授权
    Application-controlled network packet classification 有权
    应用控制的网络分组分类

    公开(公告)号:US08838817B1

    公开(公告)日:2014-09-16

    申请号:US11936141

    申请日:2007-11-07

    Applicant: Anumita Biswas

    Inventor: Anumita Biswas

    CPC classification number: H04L49/90 H04L45/38 H04L47/22 H04L47/2475 H04L47/32

    Abstract: Embodiments of the present invention provide a system, method, and computer program product that enables applications transferring data packets over a network to a multi-processing system to choose how the data packets are going to be processed by, e.g., allowing the applications to pre-assign connections to a particular network thread and migrate a connection from one network thread to another network thread without putting the connection into an inconsistent state.

    Abstract translation: 本发明的实施例提供了一种系统,方法和计算机程序产品,其使应用程序能够通过网络将数据分组传送到多处理系统,以选择如何通过例如允许应用程序预处理数据分组 - 连接到特定网络线程,并将连接从一个网络线程迁移到另一个网络线程,而不会使连接处于不一致状态。

    Clustered RAID data organization
    505.
    发明授权
    Clustered RAID data organization 有权
    集群RAID数据组织

    公开(公告)号:US08832363B1

    公开(公告)日:2014-09-09

    申请号:US14162047

    申请日:2014-01-23

    Applicant: NetApp, Inc.

    Abstract: In one embodiment, a clustered storage system is configured to reduce parity overhead of Redundant Array of Independent Disks (RAID) groups, as well as to facilitate distribution and servicing of the storage containers among storage systems (nodes) of the cluster. The storage containers may be stored on one or more storage arrays of storage devices, such as solid state drives (SSDs), connected to the nodes of the cluster. The RAID groups may be formed from slices (i.e., portions) of storage spaces of the SSDs instead of the entire storage spaces of the SSDs. That is, each RAID group may be formed “horizontally” across a set of SSDs as slices (i.e., one slice of storage space from each SSD in the set). Accordingly, a plurality of RAID groups may co-exist (i.e., be stacked) on the same set of SSDs.

    Abstract translation: 在一个实施例中,集群存储系统被配置为减少独立磁盘冗余阵列(RAID)组的奇偶校验开销,并且便于在集群的存储系统(节点)之间的存储容器的分发和服务。 存储容器可以存储在连接到集群的节点的存储设备(例如固态驱动器(SSD))的一个或多个存储阵列上。 RAID组可以由SSD的存储空间的片(即,部分)而不是SSD的整个存储空间形成。 也就是说,每个RAID组可以作为切片(即,集合中的每个SSD的一个存储空间片)横跨一组SSD“水平地”形成。 因此,多个RAID组可以共存(即堆叠)在同一组SSD上。

    Identifying snapshot membership for blocks based on snapid
    506.
    发明授权
    Identifying snapshot membership for blocks based on snapid 有权
    基于snapid识别块的快照成员资格

    公开(公告)号:US08832026B1

    公开(公告)日:2014-09-09

    申请号:US12912081

    申请日:2010-10-26

    CPC classification number: G06F17/30088

    Abstract: An on-disk structure of a file system has the capability to efficiently manage and organize data containers, such as snapshots, stored on a storage system. A multi-bit, monotonically increasing, snapshot identifier (“snapid”) is provided that represents a snapshot and that increases every time a snapshot is generated for a volume of the storage system. The snapid facilitates organization of snapshot metadata within, e.g., a data structure used to organize metadata associated with snapshot data. In the illustrative embodiment, the data structure is a balanced tree structure configured to index the copy-out snapshot data blocks. The snapid is also used to determine which blocks belong to which snapshots. To that end, every block that is used in a snapshot has an associated “valid-to” snapid denoting the newest snapshot for which the block is valid. The oldest snapshot for which the block is valid is one greater than the valid-to field of the next older block at the same file block number.

    Abstract translation: 文件系统的磁盘结构具有有效地管理和组织存储在存储系统上的数据容器(例如快照)的能力。 提供了一种多位,单调递增的快照标识符(“snapid”),代表快照,并且每当为存储系统的卷生成快照时,都会增加快照。 snapid有助于在例如用于组织与快照数据相关联的元数据的数据结构之内组织快照元数据。 在说明性实施例中,数据结构是被配置为对拷贝快照数据块进行索引的平衡树结构。 snapid也用于确定哪些块属于哪个快照。 为此,快照中使用的每个块都具有相关联的“有效到”捕获,表示该块有效的最新快照。 该块有效的最早的快照比相同文件块号的下一个较旧块的有效字段大一个。

    SYSTEM AND METHOD FOR A SCALABLE CRASH-CONSISTENT SNAPSHOT OPERATION
    508.
    发明申请
    SYSTEM AND METHOD FOR A SCALABLE CRASH-CONSISTENT SNAPSHOT OPERATION 有权
    用于可分级碰撞快速运行的系统和方法

    公开(公告)号:US20140244952A1

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

    申请号:US13778703

    申请日:2013-02-27

    Applicant: NetApp, Inc.

    CPC classification number: G06F11/1448 G06F11/1466 G06F2201/82 G06F2201/84

    Abstract: Described herein is a system and method for a scalable crash-consistent snapshot operation. Write requests may be received from an application and a snapshot creation request may further be received. Write requests received before the snapshot creation request may be associated with pre-snapshot tags and write requests received after the snapshot creation request may be associated with post-snapshot tags. Furthermore, in response to the snapshot creation request, logical interfaces may begin to be switched from a pre-snapshot configuration to a post-snapshot configuration. The snapshot may then be created based on the pre-snapshot write requests and the post-snapshot write requests may be suspended until the logical interfaces have switched configuration.

    Abstract translation: 这里描述了用于可升级的崩溃一致的快照操作的系统和方法。 可以从应用程序接收写入请求,并且还可以接收快照创建请求。 在快照创建请求之前收到的写请求可能与快照前标签相关联,并且快照创建请求之后接收到的写入请求可能与快照后标签相关联。 此外,响应于快照创建请求,逻辑接口可以开始从快照前配置切换到快照后配置。 然后可以基于快照前写入请求来创建快照,并且可以暂停快照后写入请求,直到逻辑接口已经切换配置。

    Non-disruptive realignment of virtual data
    509.
    发明授权
    Non-disruptive realignment of virtual data 有权
    虚拟数据的非破坏性重新排列

    公开(公告)号:US08819383B1

    公开(公告)日:2014-08-26

    申请号:US13399213

    申请日:2012-02-17

    Abstract: One or more techniques and/or systems are provided for non-disruptively addressing misalignment between a virtual data format and an underlying data format. Virtual data, such as a guest operating system of a virtual machine, may be stored within a virtual structure, such as a virtual machine disk, according to a virtual data format. The virtual structure may be stored within a storage device according to a storage data format. If misalignment is detected, then a new data container may be created within the storage device. A shim, sized according to a misalignment offset, may be inserted into the new data container in order to align the new data container with the storage device. Virtual data may be migrated from the virtual structure to the new data container to achieve alignment. During the migration, the virtual data may remain available from the virtual structure (e.g., a virtual machine may still execute).

    Abstract translation: 提供一个或多个技术和/或系统用于非破坏性地解决虚拟数据格式和底层数据格式之间的不对准。 可以根据虚拟数据格式将诸如虚拟机的客户操作系统的虚拟数据存储在诸如虚拟机磁盘的虚拟结构内。 虚拟结构可以根据存储数据格式存储在存储设备内。 如果检测到未对准,则可能在存储设备内创建新的数据容器。 可以将新的数据容器与存储装置对准,将尺寸根据不对准偏移量调整的垫片插入到新的数据容器中。 虚拟数据可以从虚拟结构迁移到新的数据容器以实现对齐。 在迁移期间,虚拟数据可以从虚拟结构保持可用(例如,虚拟机仍然可以执行)。

    SYSTEM AND METHOD FOR VOLUME BLOCK NUMBER TO DISK BLOCK NUMBER MAPPING
    510.
    发明申请
    SYSTEM AND METHOD FOR VOLUME BLOCK NUMBER TO DISK BLOCK NUMBER MAPPING 审中-公开
    用于批量块编号的系统和方法用于盘块编号映射

    公开(公告)号:US20140237211A1

    公开(公告)日:2014-08-21

    申请号:US14264881

    申请日:2014-04-29

    Applicant: NetApp, Inc.

    Inventor: Atul Goel

    Abstract: The present invention provides a system and method for virtual block numbers (VBNs) to disk block number (DBN) mapping that may be utilized for both single and/or multiple parity based redundancy systems. Following parity redistribution, new VBNs are assigned to disk blocks in the newly added disk and disk blocks previously occupied by parity may be moved to the new disk.

    Abstract translation: 本发明提供了可用于单个和/或多个基于奇偶校验的冗余系统的用于虚拟块号(VBN)到磁盘块号(DBN)映射的系统和方法。 在奇偶校验再分配之后,新增的VBN被分配给新添加的磁盘中的磁盘块,先前由奇偶校验占用的磁盘块可能被移动到新磁盘。

Patent Agency Ranking