中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

16 records (took 0.013 seconds)

    Synchronous object placement for information lifecycle management
    1.
    发明授权
    Synchronous object placement for information lifecycle management 有权

    公开(公告)号：US11531642B2

    公开(公告)日：2022-12-20

    申请号：US16677565

    申请日：2019-11-07

    Applicant: NetApp, Inc.

    Inventor： Robin Mahony ,  Oliver Seiler ,  Blake Edwards ,  Vladimir Avram ,  Gregory Kent ,  Chong Zhao

    IPC: G06F7/00 ,  G06F16/11 ,  G06F16/182 ,  G06F16/14 ,  G06F16/178 ,  G06F9/54

    Abstract: A distributed storage system may synchronously apply an Information Lifecycle Management (ILM) policy to objects at ingest. In one embodiment of synchronous ILM, three options are available for a user: balanced, strict, and dual commit. Dual commit refers to the behavior where one will always create two replicated copies in the same site and then apply ILM asynchronously. Strict refers to the behavior where the storage system attempts to apply the ILM policy synchronously on ingest, and if the storage system cannot the ingest of the object will fail. This ensures that the storage system can guarantee that ILM has been applied to recently ingested objects. Balanced refers to the behavior where the storage system attempts to apply ILM synchronously, but if the storage system cannot the storage system may fall-back to dual-commit.

    Synchronous object placement for information lifecycle management
    5.
    发明授权
    Synchronous object placement for information lifecycle management 有权

    公开(公告)号：US12259848B2

    公开(公告)日：2025-03-25

    申请号：US18064512

    申请日：2022-12-12

    Applicant: NetApp, Inc.

    Inventor： Robin Mahony ,  Oliver Seiler ,  Blake Edwards ,  Vladimir Avram ,  Gregory Kent ,  Chong Zhao

    IPC: G06F16/10 ,  G06F9/54 ,  G06F16/11 ,  G06F16/14 ,  G06F16/178 ,  G06F16/182

    Abstract: A distributed storage system may synchronously apply an Information Lifecycle Management (ILM) policy to objects at ingest. In one embodiment of synchronous ILM, three options are available for a user: balanced, strict, and dual commit. Dual commit refers to the behavior where one will always create two replicated copies in the same site and then apply ILM asynchronously. Strict refers to the behavior where the storage system attempts to apply the ILM policy synchronously on ingest, and if the storage system cannot the ingest of the object will fail. This ensures that the storage system can guarantee that ILM has been applied to recently ingested objects. Balanced refers to the behavior where the storage system attempts to apply ILM synchronously, but if the storage system cannot the storage system may fall-back to dual-commit.

    METHODS FOR POLICY-BASED HIERARCHICAL DATA PROTECTION AND DEVICES THEREOF
    7.
    发明申请
    METHODS FOR POLICY-BASED HIERARCHICAL DATA PROTECTION AND DEVICES THEREOF 有权
    基于策略的分层数据保护方法及其设备

    公开(公告)号：US20160246676A1

    公开(公告)日：2016-08-25

    申请号：US14627769

    申请日：2015-02-20

    Applicant: NETAPP, INC.

    Inventor： Ajay Bakre ,  Vishnu Vardhan ,  Alvin Lam ,  Emalayan Vairavanathan ,  Viswanath Chandrasekara Bharathi ,  Vladimir Avram ,  Dheeraj Sangamakar ,  Oliver Seiler ,  Carmen Lum

    IPC: G06F11/10 ,  G06F3/06

    CPC classification number: G06F3/0649 ,  G06F3/0616 ,  G06F3/0619 ,  G06F3/064 ,  G06F3/065 ,  G06F3/067 ,  G06F3/0689 ,  G06F11/1076 ,  G06F11/1092

    Abstract: A method, non-transitory computer readable medium, and storage management computing device that obtains an information lifecycle management (ILM) policy. A data protection scheme to be applied at a storage node computing device level is determined and a plurality of storage node computing devices are identified based on an application of the ILM policy to metadata received from one of the storage node computing devices and associated with an object ingested by the one of the storage node computing devices. The one of the storage node computing devices is instructed to generate one or more copies of the object or fragments of the object according to the data protection scheme and to distribute the object copies or one of the object fragments to one or more other of the storage node computing devices to be stored by at least the one or more other storage node computing devices on one or more disk storage devices.

    Abstract translation: 一种获取信息生命周期管理（ILM）策略的方法，非暂时性计算机可读介质和存储管理计算设备。 确定要在存储节点计算设备级应用的数据保护方案，并且基于从存储节点计算设备之一接收的元数据和与对象相关联的元数据，基于ILM策略的应用来识别多个存储节点计算设备 由存储节点计算设备之一摄取。 指示存储节点计算装置中的一个根据数据保护方案生成对象或对象的片段的一个或多个副本，并将对象副本或一个对象片段分发到存储器中的一个或多个其他存储 节点计算设备由至少一个或多个其他存储节点计算设备存储在一个或多个磁盘存储设备上。

    METHODS FOR DISTRIBUTING ERASURE-CODED FRAGMENTS IN A GEO-DISTRIBUTED STORAGE SYSTEM AND DEVICES THEREOF
    8.
    发明申请
    METHODS FOR DISTRIBUTING ERASURE-CODED FRAGMENTS IN A GEO-DISTRIBUTED STORAGE SYSTEM AND DEVICES THEREOF 有权
    分布式分布式存储系统中的擦除编码区块的方法及其设备

    公开(公告)号：US20160232055A1

    公开(公告)日：2016-08-11

    申请号：US14614856

    申请日：2015-02-05

    Applicant: NetApp, Inc

    Inventor： Emalayan Vairavanathan ,  Dheeraj Sangamkar ,  Ajay Bakre ,  Vladimir Avram ,  Viswanath C

    IPC: G06F11/10 ,  H04L29/08 ,  H03M13/15

    CPC classification number: G06F11/1076 ,  G06F3/06 ,  G06F11/00 ,  H03M13/154 ,  H03M13/353 ,  H03M13/373 ,  H03M13/3761 ,  H04L67/108 ,  H04L67/1097 ,  H04L67/18

    Abstract: A method, non-transitory computer readable medium, and storage management computing device that assists with distributing erasure coded fragments in geo-distributed storage nodes includes receiving an object and a storage reliability requirement from a client computing device. Erasure coding is performed on the received object using an erasure coding scheme. An erasure coding group from a plurality of erasure coding groups present in a plurality of geographically distributed storage nodes is determined based on the received storage reliability requirement and the erasure coding scheme. The erasure coded object is distributed to the determined erasure coding group from the plurality of erasure coding groups in the plurality of geographically distributed storage nodes.

    Abstract translation: 有助于在地理分布式存储节点中分配擦除编码片段的方法，非暂时性计算机可读介质和存储管理计算设备包括从客户端计算设备接收对象和存储可靠性要求。 使用擦除编码方案对接收到的对象执行擦除编码。 基于接收的存储可靠性要求和擦除编码方案，确定存在于多个地理分布式存储节点中的多个擦除编码组的擦除编码组。 擦除编码对象从多个地理分布式存储节点中的多个擦除编码组分配给确定的擦除编码组。

    METHODS FOR PROVIDING A STAGING AREA FOR OBJECTS PRIOR TO ERASURE CODING AND DEVICES THEREOF
    9.
    发明申请
    METHODS FOR PROVIDING A STAGING AREA FOR OBJECTS PRIOR TO ERASURE CODING AND DEVICES THEREOF 审中-公开
    用于在进行编码之前提供对象的分类区域的方法及其设备

    公开(公告)号：US20160219120A1

    公开(公告)日：2016-07-28

    申请号：US14603411

    申请日：2015-01-23

    Applicant: NetApp, Inc.

    Inventor： Emalayan Vairavanathan ,  Dheeraj Sangamkar ,  Ajay Bakre ,  Vladimir Avram ,  Viswanath C

    IPC: H04L29/08 ,  H04L29/06

    CPC classification number: H04L67/2842 ,  G06F11/1076 ,  H04L67/1097 ,  H04L67/42

    Abstract: A method, non-transitory computer readable medium, and device that provides staging area for an object prior to erasure coding includes receiving an object from a client computing device to ingest to a plurality of storage servers. The received object is cached in one or more memory locations. A notification is provided to the client computing device indicating successful receipt of the object. The received object is distributed across the plurality of storage servers upon providing the notification to the client computing device.

    Abstract translation: 在擦除编码之前为对象提供暂存区域的方法，非暂时计算机可读介质和设备包括从客户端计算设备接收对象以摄取到多个存储服务器。 接收的对象被缓存在一个或多个内存位置。 向客户端计算设备提供指示对象的成功接收的通知。 当向客户端计算设备提供通知时，所接收的对象在多个存储服务器之间分布。

Patent Agency Ranking