中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

62 records (took 0.028 seconds)

    Recovering missing data in a storage network via locally decodable redundancy data
    55.
    发明授权
    Recovering missing data in a storage network via locally decodable redundancy data 有权

    公开(公告)号：US11625300B2

    公开(公告)日：2023-04-11

    申请号：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 ,  G06F11/07 ,  G06F3/06 ,  H04L67/62 ,  H04L47/72 ,  G06F16/00 ,  H04L67/1097 ,  H04L47/28 ,  G06F9/50

    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.

    Selecting Routing Paths for Sending Encoded Data Slices
    56.
    发明申请
    Selecting Routing Paths for Sending Encoded Data Slices 有权

    公开(公告)号：US20230072456A1

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

    申请号：US18054992

    申请日：2022-11-14

    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

    Abstract: A method includes dispersed storage error encoding a data object to produce a set of encoded data slices. The method further includes obtaining routing path performance information for a plurality of routing paths from the computing device to a set of storage units. The method further includes selecting a first routing path for sending a first subset of the set of encoded data slices, where the first routing path has a performance level greater than a first performance threshold. The method further includes selecting a second routing path for sending a second subset of the set of encoded data slices, where the second routing path has a performance level less than or equal to the first performance threshold. The method further includes sending the first and second subsets of encoded data slices to the set of storage units via the first and second routing paths for storage therein.

    Tiered Storage of Data in a Storage Network
    57.
    发明申请
    Tiered Storage of Data in a Storage Network 有权

    公开(公告)号：US20230027787A1

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

    申请号：US17937365

    申请日：2022-09-30

    Applicant: Pure Storage, Inc.

    Inventor： S. Christopher Gladwin ,  Timothy W. Markison ,  Greg R. Dhuse ,  Thomas F. Shirley, JR. ,  Wesley B. Leggette ,  Jason K. Resch ,  Gary W. Grube

    IPC: G06F11/10 ,  G06F21/00 ,  G06F3/06 ,  G06F21/62 ,  G06F12/14 ,  H03M13/29

    Abstract: Apparatus for tiered storage of data in a storage network. In an example of operation, a computing device receives a data object for storage and forwards the data object for storage in a first plurality of memory devices of a first memory type. The computing device determines a system level storage efficiency for the data object based, at least in part, on a data attribute associated with the data object. The computing device further selects, based at least in part on the system level storage efficiency preference, a second plurality of memory devices comprised of a second memory type. The computing device determines error encoding parameters based on the second plurality of memory devices, retrieves the data object from the first plurality of memory devices, and encodes the data object with the error encoding parameters to generate a plurality of encoded data slices for storage in the second plurality of memory devices.

    Encoding Data Based on Targeted Storage Unit Information
    58.
    发明申请
    Encoding Data Based on Targeted Storage Unit Information 有权

    公开(公告)号：US20220350537A1

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

    申请号：US17812279

    申请日：2022-07-13

    Applicant: Pure Storage, Inc.

    Inventor： Gary W. Grube ,  Timothy W. Markison

    IPC: G06F3/06

    Abstract: A method includes transmitting a solicitation message to target storage units of a plurality of storage units of a storage network, where the solicitation message solicits the target storage units to store encoded data slices of a first data segment of data, and where the message is not sent to other storage units of the plurality of storage units. The method further includes receiving favorable responses from at least some of target storage units, and determining an error coding function based on an amount of the favorable responses and data storage requirements for the first data segment. The method further includes encoding the first data segment in accordance with the error coding function to produce a plurality of encoded data slices. The method further includes outputting the plurality of encoded data slices to storage units of the at least some of the target storage units for storage therein.

    Utilizing locally decodable redundancy data in a vast storage network
    59.
    发明授权
    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.

Patent Agency Ranking