中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

25 records (took 0.017 seconds)

    DISTRIBUTED STORAGE SYSTEM EXPANSION MECHANISM
    1.
    发明申请
    DISTRIBUTED STORAGE SYSTEM EXPANSION MECHANISM 有权

    公开(公告)号：US20210181949A1

    公开(公告)日：2021-06-17

    申请号：US17185410

    申请日：2021-02-25

    Applicant: Pure Storage, Inc.

    Inventor： Robert Lee ,  John Martin Hayes ,  Faisaal Sleiman

    IPC: G06F3/06

    Abstract: A method for storage cluster expansion is provided. The method includes distributing user data throughout a storage cluster as directed by each of a plurality of authorities in the storage cluster. Each of the plurality of authorities has a plurality of wards, and each of the plurality of wards has ownership of a range of the user data. The method includes splitting one of the plurality of authorities, as a parent authority, into at least two child authorities and assigning a first subset of the plurality of wards of the parent authority to one of the at least two child authorities, and a second subset of the plurality of wards of the parent authority to another one of the at least two child authorities.

    ERASE DETECTION LOGIC FOR A STORAGE SYSTEM
    5.
    发明申请
    ERASE DETECTION LOGIC FOR A STORAGE SYSTEM 有权

    公开(公告)号：US20210357133A1

    公开(公告)日：2021-11-18

    申请号：US17388982

    申请日：2021-07-29

    Applicant: PURE STORAGE, INC.

    Inventor： John Martin Hayes ,  Hari Kannan ,  Nenad Miladinovic

    IPC: G06F3/06 ,  H04L29/08 ,  G06F11/10

    Abstract: A method for erasure detection in a storage cluster is provided. The method includes establishing a connection, via a network, of a storage unit to one of a plurality of storage nodes of a storage cluster and determining, for at least one page of a storage memory of the storage unit, that the at least one page is erased. The storage unit is one of a plurality of storage units configured to store user data in memory of the storage units in accordance with direction from the plurality of storage nodes. The method includes communicating from the storage unit to the one of the plurality of storage nodes that the at least one page is erased.

    Coexisting Differing Erasure Codes
    6.
    发明申请
    Coexisting Differing Erasure Codes 有权

    公开(公告)号：US20210286673A1

    公开(公告)日：2021-09-16

    申请号：US17327250

    申请日：2021-05-21

    Applicant: PURE STORAGE, INC.

    Inventor： John Martin Hayes ,  John Colgrove ,  Robert Lee ,  Igor Ostrovsky ,  Joshua P. Robinson

    IPC: G06F11/10 ,  G06F11/14

    Abstract: A method for proactively rebuilding user data in a plurality of storage nodes of a storage cluster is provided. The method includes distributing user data and metadata throughout the plurality of storage nodes such that the plurality of storage nodes can read the user data, using erasure coding, despite loss of two of the storage nodes. The method includes determining that one of the storage nodes is unreachable and determining to rebuild the user data for the one of the storage nodes that is unreachable. The method includes reading the user data across a remainder of the plurality of storage nodes, using the erasure coding and writing the user data across the remainder of the plurality of storage nodes, using the erasure coding. A plurality of storage nodes within a single chassis that can proactively rebuild the user data stored within the storage nodes is also provided.

    Coexisting differing erasure codes
    8.
    发明授权
    Coexisting differing erasure codes 有权

    公开(公告)号：US11593203B2

    公开(公告)日：2023-02-28

    申请号：US17327250

    申请日：2021-05-21

    Applicant: PURE STORAGE, INC.

    Inventor： John Martin Hayes ,  John Colgrove ,  Robert Lee ,  Igor Ostrovsky ,  Joshua P. Robinson

    IPC: G06F11/00 ,  G06F11/10 ,  G06F11/14

    Abstract: A method for proactively rebuilding user data in a plurality of storage nodes of a storage cluster is provided. The method includes distributing user data and metadata throughout the plurality of storage nodes such that the plurality of storage nodes can read the user data, using erasure coding, despite loss of two of the storage nodes. The method includes determining that one of the storage nodes is unreachable and determining to rebuild the user data for the one of the storage nodes that is unreachable. The method includes reading the user data across a remainder of the plurality of storage nodes, using the erasure coding and writing the user data across the remainder of the plurality of storage nodes, using the erasure coding. A plurality of storage nodes within a single chassis that can proactively rebuild the user data stored within the storage nodes is also provided.

    EXPANDING DATA STRUCTURES IN A STORAGE SYSTEM
    9.
    发明申请
    EXPANDING DATA STRUCTURES IN A STORAGE SYSTEM 有权

    公开(公告)号：US20220382476A1

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

    申请号：US17877300

    申请日：2022-07-29

    Applicant: Pure Storage, Inc.

    Inventor： Robert Lee ,  John Martin Hayes ,  Faissal Sleiman

    IPC: G06F3/06

    Abstract: A method for storage cluster expansion is provided. The method includes distributing user data throughout a storage cluster as directed by each of a plurality of authorities in the storage cluster. Each of the plurality of authorities has a plurality of wards, and each of the plurality of wards has ownership of a range of the user data. The method includes splitting one of the plurality of authorities, as a parent authority, into at least two child authorities and assigning a first subset of the plurality of wards of the parent authority to one of the at least two child authorities, and a second subset of the plurality of wards of the parent authority to another one of the at least two child authorities.

Patent Agency Ranking