中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

62 records (took 0.028 seconds)

    Managing Memory Devices in a Storage Network
    45.
    发明公开
    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.

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

    Generating Integrity Information in a Vast Storage System
    48.
    发明申请
    Generating Integrity Information in a Vast Storage System 有权

    公开(公告)号：US20210326205A1

    公开(公告)日：2021-10-21

    申请号：US17362251

    申请日：2021-06-29

    Applicant: Pure Storage, Inc.

    Inventor： Gary W. Grube ,  Timothy W. Markison

    IPC: G06F11/10 ,  G06F3/06

    Abstract: A method includes encoding data via erasure coding to produce a plurality of data slices. The method further includes determining a plurality of identifiers corresponding to the data. The method further includes generating integrity information based on the plurality of identifiers by performing a cyclic redundancy check. The method further includes storing the plurality of data slices, the plurality of identifiers, and the integrity information in a storage system.

    Storing integrity information in a vast storage system
    49.
    发明授权
    Storing integrity information in a vast storage system 有权

    公开(公告)号：US11080138B1

    公开(公告)日：2021-08-03

    申请号：US17023971

    申请日：2020-09-17

    Applicant: Pure Storage, Inc.

    Inventor： Gary W. Grube ,  Timothy W. Markison

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

    Abstract: A method includes dispersed storage error encoding data to produce a plurality of sets of encoded data slices in accordance with dispersed storage error coding parameters. A plurality of identifiers corresponding to the plurality of sets of encoded data slices are determined, and integrity information is determined for the plurality of identifiers. The plurality of sets of encoded data slices, the plurality of identifiers, and the integrity information are sent to a distributed storage network memory for storage therein.

    Predicting usable memory
    50.
    发明授权
    Predicting usable memory 有权

    公开(公告)号：US11073993B1

    公开(公告)日：2021-07-27

    申请号：US16885602

    申请日：2020-05-28

    Applicant: Pure Storage, Inc.

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

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

    Abstract: A method begins by a processing module determining a priority access level of an encoded data slice stored on a memory device. The method continues by determining a memory status for the memory device, wherein the memory status includes a plurality of discrete usability levels with a highest usability level representing a maximum amount of usable memory, a second usability level representing a lower usability level than the highest usability level and a lowest usability level representing an unusable level when the usable memory is below a threshold. The method continues with the processing module determining whether to migrate the encoded data slice from the memory device based on the priority access level and the memory status. The method continues with the processing module identifying another memory device. The method continues with the processing module facilitating migration of the encoded data slice to another memory device.

Patent Agency Ranking