中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

84 records (took 0.021 seconds)

    Managing Memory Devices in a Storage Network
    75.
    发明公开
    Managing Memory Devices in a Storage Network 审中-公开

    公开(公告)号：US20230280911A1

    公开(公告)日：2023-09-07

    申请号：US18314257

    申请日：2023-05-09

    Applicant: Pure Storage, Inc.

    Inventor： Gary W. Grube ,  Jason K. Resch ,  Timothy W. Markison ,  Ilya Volvovski ,  Manish Motwani

    IPC: G06F3/06 ,  G06F12/02

    CPC classification number: G06F3/0619 ,  G06F3/0679 ,  G06F3/0647 ,  G06F3/067 ,  G06F12/0223 ,  G06F11/1076

    Abstract: A method for managing memory in a storage network begins by monitoring a service life indicator for a plurality of solid-state memory devices in the storage network and determining whether a memory device of the plurality of solid-state memory devices is approaching an end-of-life event, where end-of-life event is based on a predetermined service life. When the memory device is approaching an end-of-life event the method continues by determining whether to migrate one or more encoded data slices from the memory device to an alternative memory device and based on a decision to migrate the one or more encoded data slices, selecting a migration scheme from a plurality of migration schemes for migrating the one or more encoded data slices. Finally, the method continues by facilitating migrating the one or more encoded data slices according to the selected migration scheme.

    Redirecting a Data Access Request in a Storage Network
    78.
    发明申请
    Redirecting a Data Access Request in a Storage Network 有权

    公开(公告)号：US20230026842A1

    公开(公告)日：2023-01-26

    申请号：US17937380

    申请日：2022-09-30

    Applicant: Pure Storage, Inc.

    Inventor： Asimuddin Kazi ,  Andrew D. Baptist ,  Wesley B. Leggette ,  Manish Motwani ,  Ilya Volvovski

    IPC: G06F3/06

    Abstract: Methods and apparatus for redirecting data access requests in a storage network are disclosed. In an embodiment, a computing device associated with the storage network performs a method that includes identifying a (second) storage pool of the storage network to replace a first storage pool of the storage network. The method includes issuing a migration message to at least one of the first storage pool or the second storage pool. The migration message initiates a replication of data from the first storage pool to the second storage pool. The method further includes receiving a write data request for the first storage pool prior to completion of the replication of the data, and forwarding the write data request to the second storage pool for further processing.

    Recovering Missing Data in a Storage Network via Locally Decodable Redundancy Data
    79.
    发明申请
    Recovering Missing Data in a Storage Network via Locally Decodable Redundancy Data 有权

    公开(公告)号：US20230009883A1

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

    申请号：US17933563

    申请日：2022-09-20

    Applicant: Pure Storage, Inc.

    Inventor： Ilya Volvovski ,  Bruno H. Cabral ,  Manish Motwani ,  Thomas D. Cocagne ,  Timothy W. Markison ,  Gary W. Grube ,  Wesley B. Leggette ,  Jason K. Resch ,  Michael C. Storm ,  Greg R. Dhuse ,  Yogesh R. Vedpathak ,  Ravi V. Khadiwala

    IPC: G06F11/10 ,  G06F16/00 ,  G06F3/06 ,  G06F11/07 ,  H04L67/1097 ,  H04L47/72 ,  H04L67/62

    Abstract: A processing system of a storage network operates by: sending, to at least one storage unit of the storage network, at least one read request corresponding to at least a read threshold number of a set of encoded data slices to be retrieved, wherein the set of encoded data slices correspond to a data segment, wherein the data segment is coded in accordance with dispersed error coding parameters that include a write threshold number and the read threshold number, wherein the write threshold number is a number of encoded data slices in the set of encoded data slices and wherein the read threshold number is a number of the set of slices that is required to decode the data segment; receiving, via the at least one processing circuit and from the at least one storage unit, a first subset of encoded data slices of the set of encoded data slices, wherein the first subset of encoded data slices is missing at least one missing encoded data slice that was not received from the at least one storage unit in response to the at least one read request and wherein the number of encoded data slices in the first subset of the encoded data slices is less than the read threshold number; generating, via the at least one processing circuit, at least one rebuilt encoded data slice corresponding to the at least one missing encoded data slice utilizing locally decodable redundancy data, wherein the locally decodable redundancy data generated from a second subset of the set of encoded data slices that includes the at least one missing encoded data slice; and recovering, via the at least one processing circuit, the data segment based on the at least one rebuilt encoded data slice and the first subset of encoded data slices.

    Using a Dispersed Index in a Storage Network
    80.
    发明申请
    Using a Dispersed Index in a Storage Network 有权

    公开(公告)号：US20220327103A1

    公开(公告)日：2022-10-13

    申请号：US17809796

    申请日：2022-06-29

    Applicant: Pure Storage, Inc.

    Inventor： Greg R. Dhuse ,  Ilya Volvovski ,  Adam M. Gray ,  Andrew D. Baptist

    IPC: G06F16/22 ,  G06F11/10

    Abstract: A method begins with a processing module of a distributed storage network (DSN), receiving a request to access a data object stored in the DSN and identifying a first data descriptor associated with the data object, identifying a second data descriptor associated with the data object, identifying a first data index key and a first index structure for the first data descriptor and identifying a second data index key and a second index structure for the second data descriptor. The method continues with the processing module accessing the first index structure for the first data descriptor , based on the first and second data index keys, to retrieve a first and second set of data identifiers, respectively and based on one or more data identifiers being common to the first set of data identifiers and the second set of data identifiers, creating a superset of data identifiers.

Patent Agency Ranking