中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

7 records (took 0.013 seconds)

    Synchronous object placement for information lifecycle management
    1.
    发明授权
    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.

    Synchronous object placement for information lifecycle management
    2.
    发明授权
    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
    4.
    发明申请
    SYNCHRONOUS OBJECT PLACEMENT FOR INFORMATION LIFECYCLE MANAGEMENT 有权

    公开(公告)号：US20210141759A1

    公开(公告)日：2021-05-13

    申请号：US16677565

    申请日：2019-11-07

    Applicant: NetApp, Inc.

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

    IPC: G06F16/11 ,  G06F16/14 ,  G06F16/182 ,  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.

    Any-Local-Quorum Consistency For Distributed Databases Replicated Across Multiple Sites
    6.
    发明申请
    Any-Local-Quorum Consistency For Distributed Databases Replicated Across Multiple Sites 有权

    公开(公告)号：US20250124016A1

    公开(公告)日：2025-04-17

    申请号：US18488795

    申请日：2023-10-17

    Applicant: NetApp, Inc.

    Inventor： Blake Edwards ,  William Zhang ,  Lawrence Yu ,  David Ou ,  Song Guen Yoon

    IPC: G06F16/23 ,  G06F16/27

    Abstract: A storage application is disclosed herein that employs a method for managing read and write requests associated with a database distributed across multiple replicas in multiple data centers. The storage application may be implemented on one or more computing devices in the context of a data center, cloud environment, or the like. The method includes the storage application receiving a client request to perform an operation with respect to an object at an any-local-quorum consistency level. In response to client request, the storage application iteratively generates and submits coordinator requests to the multiple data centers at a local-quorum consistency level, until one of the multiple data centers successfully replies to one of the coordinator requests with a result. The storage application then replies to the client request based on the result provided by the one of the multiple data centers.

    Any-Local-Quorum Consistency For Distributed Databases Replicated Across Multiple Sites
    7.
    发明申请
    Any-Local-Quorum Consistency For Distributed Databases Replicated Across Multiple Sites 有权

    公开(公告)号：US20250124015A1

    公开(公告)日：2025-04-17

    申请号：US18488545

    申请日：2023-10-17

    Applicant: NetApp, Inc.

    Inventor： Blake Edwards ,  William Zhang ,  Lawrence Yu ,  David Ou ,  Song Guen Yoon

    IPC: G06F16/23 ,  G06F16/27

    Abstract: A storage application is disclosed herein that employs a method for managing read and write requests associated with a database distributed across multiple replicas in multiple data centers. The storage application may be implemented on one or more computing devices in the context of a data center, cloud environment, or the like. The method includes the storage application receiving a client request to perform an operation with respect to an object at an any-local-quorum consistency level. In response to client request, the storage application iteratively generates and submits coordinator requests to the multiple data centers at a local-quorum consistency level, until one of the multiple data centers successfully replies to one of the coordinator requests with a result. The storage application then replies to the client request based on the result provided by the one of the multiple data centers.

Patent Agency Ranking