中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

8 records (took 0.027 seconds)

    DEDUPLICATION IN AN EXTENT-BASED ARCHITECTURE
    1.
    发明申请
    DEDUPLICATION IN AN EXTENT-BASED ARCHITECTURE 审中-公开
    在基于结构的架构中的分类

    公开(公告)号：WO2012177318A1

    公开(公告)日：2012-12-27

    申请号：PCT/US2012/034788

    申请日：2012-04-24

    Applicant: NETAPP, INC. ,  PERIYAGARAM, Subramaniam ,  YADAV, Sandeep ,  LEWIS, Blake ,  FAITH, Rickard, E. ,  PRAKASH, Ashish ,  KESAVAN, Ram ,  SUBRAMANIAN, Ananthan

    Inventor： PERIYAGARAM, Subramaniam ,  YADAV, Sandeep ,  LEWIS, Blake ,  FAITH, Rickard, E. ,  PRAKASH, Ashish ,  KESAVAN, Ram ,  SUBRAMANIAN, Ananthan

    IPC: G06F3/06 ,  G06F17/30

    CPC classification number: G06F17/30156 ,  G06F3/0608 ,  G06F3/0641

    Abstract: A request is received to remove duplicate data. A log data container associated with a storage volume in a storage server is accessed. The log data container includes a plurality of entries. Each entry is identified by an extent identifier in a data structures stored in a volume associated with the storage server. For each entry in the log data container, a determination is made if the entry matches another entry in the log data container. If the entry matches another entry in the log data container, a determination is made of a donor extent and a recipient extent. If an external reference count associated with the recipient extent equals a first predetermined value, block sharing is performed for the donor extent and the recipient extent. A determination is made if the reference count of the donor extent equals a second predetermined value. If the reference count of the donor extent equals the second predetermined value, the donor extent is freed.

    Abstract translation: 收到请求以删除重复的数据。 访问与存储服务器中的存储卷相关联的日志数据容器。 日志数据容器包括多个条目。 每个条目由存储在与存储服务器相关联的卷中的数据结构中的盘区标识符标识。 对于日志数据容器中的每个条目，确定条目是否匹配日志数据容器中的另一个条目。 如果条目与日志数据容器中的另一个条目匹配，则确定捐赠者范围和受众范围。 如果与接收者范围相关联的外部参考计数等于第一预定值，则对捐赠者范围和接受者范围执行块共享。 如果供体范围的参考计数等于第二预定值，则确定。 如果供体范围的参考计数等于第二预定值，则供体范围被释放。

    PERSISTENT MEMORY ARCHITECTURE
    2.
    发明申请
    PERSISTENT MEMORY ARCHITECTURE 审中-公开

    公开(公告)号：WO2021216491A1

    公开(公告)日：2021-10-28

    申请号：PCT/US2021/028070

    申请日：2021-04-20

    Applicant: NETAPP, INC.

    Inventor： SUBRAMANIAN, Ananthan ,  KESAVAN, Ram ,  CURTIS-MAURY, Matthew, Fontaine ,  SMITH, Mark

    IPC: G06F3/06

    Abstract: Techniques are provided for implementing a persistent memory storage tier to manage persistent memory of a node. The persistent memory is managed by the persistent memory storage tier at a higher level within a storage operating system storage stack than a level at which a storage file system of the node is managed. The persistent memory storage tier intercepts an operation targeting the storage file system. The persistent memory storage tier retargets the operation from targeting the storage file system to targeting the persistent memory. The operation is transmitted to the persistent memory.

    SYSTEMS, METHODS, AND COMPUTER PROGRAM PRODUCTS IMPLEMENTING HYBRID FILE STRUCTURES FOR DATA STORAGE
    3.
    发明申请
    SYSTEMS, METHODS, AND COMPUTER PROGRAM PRODUCTS IMPLEMENTING HYBRID FILE STRUCTURES FOR DATA STORAGE 审中-公开
    系统，方法和计算机程序产品实现数据存储的混合文件结构

    公开(公告)号：WO2015026662A1

    公开(公告)日：2015-02-26

    申请号：PCT/US2014/051304

    申请日：2014-08-15

    Applicant: NETAPP, INC.

    Inventor： GUPTA, Mohit ,  PERIYAGARAM, Subramaniam ,  FANG, Vania ,  ENGLISH, Robert ,  KESAVAN, Ram

    IPC: G06F3/06

    CPC classification number: G06F3/0685 ,  G06F3/061 ,  G06F3/0619 ,  G06F3/0643 ,  G06F3/065 ,  G06F3/067

    Abstract: Systems, methods, and computer program products implementing hybrid file structures for data storage are provided. One embodiment of a method performed in a computer-based storage system includes writing a file as data blocks in an array of storage devices. The method includes associating the data blocks with metadata related to at least one location in the array of storage devices for later access to the data blocks. The file is represented as a hierarchical data structure having a plurality of nodes. A first portion of nodes has a first span type, and a second portion of nodes has a second span type. The data structure includes a buftree. The first span type includes a fixed-span type. The second span type includes a variable-span type.

    Abstract translation: 提供了实现用于数据存储的混合文件结构的系统，方法和计算机程序产品。 在基于计算机的存储系统中执行的方法的一个实施例包括将文件作为数据块写入存储设备的阵列中。 该方法包括将数据块与存储设备阵列中的至少一个位置相关的元数据相关联，以便稍后访问数据块。 该文件被表示为具有多个节点的分层数据结构。 节点的第一部分具有第一跨度类型，节点的第二部分具有第二跨度类型。 数据结构包括一个buftree。 第一种跨度类型包括固定跨度类型。 第二种跨度类型包括可变跨度类型。

    SYSTEM AND METHOD FOR BALANCING BLOCK ALLOCATION ON DATA STORAGE DEVICES
    6.
    发明申请
    SYSTEM AND METHOD FOR BALANCING BLOCK ALLOCATION ON DATA STORAGE DEVICES 审中-公开
    用于平衡数据存储设备上的块分配的系统和方法

    公开(公告)号：WO2013096720A1

    公开(公告)日：2013-06-27

    申请号：PCT/US2012/071136

    申请日：2012-12-21

    Applicant: NETAPP, INC.

    Inventor： KESAVAN, Ram ,  BHATTACHARJEE, Mrinal, K. ,  GOSWAMI, Sudhanshu

    IPC: G06F9/26

    CPC classification number: G06F3/0605 ,  G06F3/0656 ,  G06F3/067 ,  G06F3/0689

    Abstract: A modular block allocator includes a front end module and a back end module communicating with each another via an application programming interface (API). The front end module receives cleaner messages requesting dirty buffers associated with the cleaner messages be cleaned. The back end module provides low and high level data structures which are formed by examining bitmaps associated with data storage devices. A stripe set data structure mapping to the low level data structures are formed. The front end module cleans the dirty buffers by allocating data blocks in the high level data structures to the dirty buffers. The low level data structures are used to map the allocated data blocks to the stripe set and when the stripe set is full it is sent to the data storage devices.

    Abstract translation: 模块化块分配器包括经由应用编程接口（API）彼此通信的前端模块和后端模块。 前端模块接收更清洁的消息，请求与要清理的清洁消息相关联的脏缓冲区。 后端模块提供通过检查与数据存储设备相关联的位图而形成的低级和高级数据结构。 形成映射到低级数据结构的条带集数据结构。 前端模块通过将高级数据结构中的数据块分配给脏缓冲区来清除脏缓冲区。 低级数据结构用于将分配的数据块映射到条带集，并且当条带集满时，将其发送到数据存储设备。

    ALLOCATION OF ABSENT DATA WITHIN FILE SYSTEMS
    7.
    发明申请
    ALLOCATION OF ABSENT DATA WITHIN FILE SYSTEMS 审中-公开
    在文件系统中分配无数据

    公开(公告)号：WO2013043494A1

    公开(公告)日：2013-03-28

    申请号：PCT/US2012/055456

    申请日：2012-09-14

    Applicant: NETAPP, INC. ,  CURLEY, Jonathan ,  JERNIGAN, Richard ,  KESAVAN, Ram

    Inventor： CURLEY, Jonathan ,  JERNIGAN, Richard ,  KESAVAN, Ram

    IPC: G06F17/30

    CPC classification number: G06F17/30215 ,  G06F17/30088

    Abstract: Systems and methods which provide an absent allocation technique with respect to absent data of a data structure for which data migration in a time-displaced data migration operation has not completed are disclosed. Through use of absent allocated data block states of an absent allocation technique of embodiments, dependency between source and destination data stores may be broken. An absent allocated data block state of embodiments stored within the data structure provides a suggestive indication that data of a data block of a data structure is absent from the data structure. A corresponding absent allocated data block state of embodiments stored external to the data structure provides a determinative indication that the data of the data block of the data structure is absent from the data structure. The absent data block determinative indictor of embodiments is updated as data continues to be migrated.

    Abstract translation: 公开了关于时间偏移数据迁移操作中的数据迁移尚未完成的数据结构的缺失数据提供缺席分配技术的系统和方法。 通过使用缺少分配的数据块状态的实施例的缺少分配技术，源和目的地数据存储之间的依赖可能被破坏。 数据结构中存储的实施例的缺少分配的数据块状态提供了数据结构中不存在数据结构的数据块的数据的暗示性指示。 存储在数据结构外部的实施例的对应的未分配数据块状态提供了数据结构中数据结构的数据块的数据不存在的确定指示。 当数据继续迁移时，更新实施例的不存在的数据块确定指示符。

    DEDUPLICATION IN AN EXTENT-BASED ARCHITECTURE
    8.
    发明公开
    DEDUPLICATION IN AN EXTENT-BASED ARCHITECTURE 审中-公开
    重复数据删除的作用域体系结构

    公开(公告)号：EP2724225A1

    公开(公告)日：2014-04-30

    申请号：EP12721631.5

    申请日：2012-04-24

    Applicant: NetApp, Inc.

    Inventor： PERIYAGARAM, Subramaniam ,  YADAV, Sandeep ,  LEWIS, Blake ,  FAITH, Rickard, E. ,  PRAKASH, Ashish ,  KESAVAN, Ram ,  SUBRAMANIAN, Ananthan

    IPC: G06F3/06 ,  G06F17/30

    CPC classification number: G06F17/30156 ,  G06F3/0608 ,  G06F3/0641

    Abstract: A request is received to remove duplicate data. A log data container associated with a storage volume in a storage server is accessed. The log data container includes a plurality of entries. Each entry is identified by an extent identifier in a data structures stored in a volume associated with the storage server. For each entry in the log data container, a determination is made if the entry matches another entry in the log data container. If the entry matches another entry in the log data container, a determination is made of a donor extent and a recipient extent. If an external reference count associated with the recipient extent equals a first predetermined value, block sharing is performed for the donor extent and the recipient extent. A determination is made if the reference count of the donor extent equals a second predetermined value. If the reference count of the donor extent equals the second predetermined value, the donor extent is freed.

Patent Agency Ranking