中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

87 records (took 0.018 seconds)

    Accessing metadata storage trees in a storage network
    31.
    发明授权
    Accessing metadata storage trees in a storage network 有权

    公开(公告)号：US12204783B2

    公开(公告)日：2025-01-21

    申请号：US18481395

    申请日：2023-10-05

    Applicant: Pure Storage, Inc.

    Inventor： Renars W. Narubin ,  Jason K. Resch ,  Gary W. Grube

    IPC: G06F3/06 ,  G06F11/14

    Abstract: A method includes error encoding data to produce a plurality of data slices. Metadata is determined for a data slice of the plurality of data slices. The metadata is stored in a metadata storage tree. The data slice is stored in a slice storage location indicated by the metadata. Based on determining to access the data slice, the metadata for the data slice is accessed in the metadata storage tree to determine the slice storage location for the data slice, and the data slice is accessed in the slice storage location based on determining the slice storage location for the data slice via accessing the metadata storage tree.

    Sending encoded data slices via multiple routing paths
    32.
    发明授权
    Sending encoded data slices via multiple routing paths 有权

    公开(公告)号：US12181969B2

    公开(公告)日：2024-12-31

    申请号：US18499319

    申请日：2023-11-01

    Applicant: Pure Storage, Inc.

    Inventor： Gary W. Grube ,  Timothy W. Markison ,  S. Christopher Gladwin ,  Greg R. Dhuse ,  Andrew D. Baptist ,  Ilya Volvovski ,  Jason K. Resch

    IPC: G06F11/10 ,  G06F3/06 ,  G06F11/00

    Abstract: A method for execution by one or more computing devices includes selecting a first routing path from a plurality of routing paths to a set of storage units based on routing path performance information, where the first routing path has a performance level greater than a first performance threshold. The method further includes selecting a second routing path from the plurality of routing paths based on the routing path performance information, where the second routing path has a performance level less than or equal to the first performance threshold. The method further includes sending a first subset of encoded data slices to the set of storage units via the first routing path for storage therein. The method further includes sending a second subset of encoded data slices to the set of storage units via the second routing path for storage therein.

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

    公开(公告)号：US20240411643A1

    公开(公告)日：2024-12-12

    申请号：US18809965

    申请日：2024-08-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 ,  G06F3/06 ,  G06F9/50 ,  G06F11/07 ,  G06F16/00 ,  H04L47/28 ,  H04L47/72 ,  H04L67/1097 ,  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 data, wherein the data 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 encoded data slices that is required to decode the data; receiving, at the at least one processing circuit and from the at least one storage unit, a first subset of the set of encoded data slices, wherein at least one missing encoded data slice was not included in the first subset and wherein a number of encoded data slices in the first subset 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 corresponds to a second subset of the set of encoded data slices that includes the at least one missing encoded data slice and wherein the locally decodable redundancy data is stored locally to the processing circuit; and recovering, via the at least one processing circuit, the data based on the at least one rebuilt encoded data slice and the first subset.

    Parity in a vast storage system using alternate memory
    40.
    发明授权
    Parity in a vast storage system using alternate memory 有权

    公开(公告)号：US11662915B2

    公开(公告)日：2023-05-30

    申请号：US17356838

    申请日：2021-06-24

    Applicant: Pure Storage, Inc.

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

    IPC: G06F3/06 ,  G06F12/02 ,  G06F11/10

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

    Abstract: A method begins by a processing module of a storage network analyzing storage network memory for a level of usability and based on the analyzing, selecting alternative memory available for receipt of encoded data slices stored in current memory, where a data object is segmented into a plurality of data segments and a data segment of the plurality of data segments is dispersed error encoded in accordance with dispersed error encoding parameters to produce a set of encoded data slices. The method continues with the processing module determining whether to move encoded data slices from current memory to alternative memory and based on a determination to move slices, allocating alternative memory. Finally, the processing module moves at least some encoded data slices from a current memory to alternate memory and updates a memory assignment mechanism for the at least some encoded data slices.

Patent Agency Ranking