中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

16 records (took 0.015 seconds)

    Utilizing locally decodable redundancy data in a vast storage network
    11.
    发明授权
    Utilizing locally decodable redundancy data in a vast storage network 有权

    公开(公告)号：US11487620B1

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

    申请号：US17850145

    申请日：2022-06-27

    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 ,  G06F16/00 ,  H04L67/1097 ,  G06F11/07 ,  H04L67/62 ,  H04L47/72 ,  G06F9/50 ,  H04L47/28

    Abstract: A network storage system operates by: sending, to at least one storage unit of a 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 codable 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 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 from the number of the set of slices that is required to decode the data segment and that was not received from the at least one storage unit in response to the at least one read request; generating 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 includes a plurality of local redundancy slices generated from a second subset of the set of encoded data slices that includes the at least one missing encoded data slice; and recovering the data segment based on the at least one rebuilt encoded data slice and the first subset of encoded data slices.

    Recovering Missing Data in a Storage Network via Locally Decodable Redundancy Data
    13.
    发明申请
    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.

    Adjusting data storage efficiency of data in a storage network
    15.
    发明授权
    Adjusting data storage efficiency of data in a storage network 有权

    公开(公告)号：US10891390B1

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

    申请号：US16883902

    申请日：2020-05-26

    Applicant: Pure Storage, Inc.

    Inventor： Ilya Volvovski ,  Wesley B. Leggette ,  Michael C. Storm ,  Jason K. Resch

    IPC: G06F21/62 ,  H04L29/06 ,  H04L29/08 ,  G06F11/00 ,  G06F3/06

    Abstract: A method for execution by a computing device to adjust data storage efficiency of data in a storage network begins by obtaining a data segment for storage in memory of the storage network. The method continues by obtaining access level information regarding the data segment, where the access level information includes an estimated retrieval frequency level for the data segment. The method continues by determining a storage approach for the data segment based on the access level information and processing the data segment based on the storage approach to produce a processed data segment. The method continues by dispersed storage error encoding the processed data segment to produce a set of encoded data slices, where a decode threshold number of encoded data slices is needed to recover the processed data segment. The method continues by sending the set of encoded data slices to the memory for storage therein.

Patent Agency Ranking