知搜-全球专利检索

  1. Login
  2. Sign Up

Search Results

290 records (took 0.047 seconds)

    Storage network for rebuilding encoded data slices and processing system for use therewith
    2.
    发明授权
    Storage network for rebuilding encoded data slices and processing system for use therewith 有权

    公开(公告)号：US12222959B2

    公开(公告)日：2025-02-11

    申请号：US18348498

    申请日：2023-07-07

    Applicant: Pure Storage, Inc.

    Inventor： Asimuddin Kazi ,  Jason K. Resch

    IPC: G06F16/27 ,  G06F3/06 ,  G06F11/10 ,  G06F16/178 ,  H04L67/00 ,  H04L67/1097

    Abstract: A storage network operates by: encoding, via a dispersed error encoding, at least one data object as a write threshold number of encoded data slices; storing the write threshold number of the encoded data slices in a set of storage units of the storage network; determining when, due to a failure, less than a pillar width number of the encoded data slices are retrievable from the set of storage units: retrieving a decode threshold number of the encoded data slices from others of the set of storage units; decoding the decode threshold number of the encoded data slices to reproduce the at least one data object; restoring availability of the pillar width number of the encoded data slices of the common revision by: rebuilding at least a subset of encoded data slices of the set of encoded data slices, based on an encoding of the at least one data object; and storing the at least a subset of encoded data slices in the storage network.

    Managing copy revisions in a distributed storage system
    4.
    发明授权
    Managing copy revisions in a distributed storage system 有权

    公开(公告)号：US12164378B2

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

    申请号：US18153518

    申请日：2023-01-12

    Applicant: Pure Storage, Inc.

    Inventor： Ravi V. Khadiwala ,  Yogesh R. Vedpathak ,  Jason K. Resch ,  Asimuddin Kazi

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

    Abstract: A method for execution by one or more processing modules of a storage network begins by receiving an access request for a set of encoded data slices, where the data object is segmented into a plurality of data segments, a data segment of which is dispersed error encoded in accordance with dispersed error encoding parameters to produce the set of encoded data slices. The method continues by determining whether a revision for one or more encoded data slices in a first storage module is a most recent revision level for the one or more encoded data slices and when the one or more encoded data slices is a most recent revision level, determining whether the revision level for the one or more encoded data slices in a second storage module is the most recent revision level. When the one or more encoded data slices in the second storage module is not the most recent revision level the method continues by facilitating a read request to the first storage module for the one or more encoded data slices and synchronizing the one or more encoded data slices in the second storage module with the one or more encoded data slices in the first storage module.

    Storage pool tiering in a storage network
    5.
    发明授权
    Storage pool tiering in a storage network 有权

    公开(公告)号：US12141459B2

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

    申请号：US17661804

    申请日：2022-05-03

    Applicant: Pure Storage, Inc.

    Inventor： Jason K. Resch ,  Wesley B. Leggette

    IPC: G06F12/00 ,  G06F3/06

    Abstract: Methods and apparatus for storage pool tiering in a storage network. In an embodiment, a method includes receiving data for storage and storing the data in a first pool of storage units, the first pool of storage units associated with a first storage tier having a first access latency performance level. The method further includes initializing a frequency of access indicator corresponding to the stored data and determining, based at least in part on the frequency of access indicator, to move the stored data to a second pool of storage units associated with a second storage tier having a second access latency performance level, wherein the second access latency performance level corresponds to higher average access latency than the first access latency performance level. In response to determining to move the stored data to the second pool of storage units, the method further includes retrieving the data from the first pool of storage units and facilitating storage of the data in the second pool of storage units.

    Storing a data object as data regions in a storage network
    6.
    发明授权
    Storing a data object as data regions in a storage network 有权

    公开(公告)号：US12132783B2

    公开(公告)日：2024-10-29

    申请号：US17819386

    申请日：2022-08-12

    Applicant: Pure Storage, Inc.

    Inventor： Wesley B. Leggette ,  Jason K. Resch ,  Yogesh R. Vedpathak ,  Sebastien Vas ,  Eric G. Smith ,  Adam M. Gray

    IPC: H04L67/1097 ,  G06F3/06 ,  G06F11/10

    CPC classification number: H04L67/1097 ,  G06F3/064 ,  G06F11/1076 ,  G06F11/1092 ,  G06F3/0604 ,  G06F3/0619 ,  G06F3/065 ,  G06F3/067 ,  G06F2211/1028

    Abstract: A method for execution by a computing device of a storage network begins by receiving a write request for a data object, determining a plurality of data regions for the data object, determining storage identification information for each data region of the plurality of data regions and generating a storage table for the data object that includes information sufficient to identify each data region of the plurality of data regions. For a first data region of the plurality of data regions the method continues by dividing the first data region into a plurality of data segments, and dispersed error encoding the plurality of data segments to produce a plurality of sets of encoded data slices. The method then continues by sending a write request for each encoded data slice of each set of encoded data slices of the plurality of sets of encoded data slices to the storage network, and when at least a write threshold number of write responses is received for each of the plurality of sets of encoded data slices the method ends by updating the storage table to indicate that the first data region is available for retrieval.

    Identifying Multiple Resources of a Storage Network for Data Retrieval
    8.
    发明公开
    Identifying Multiple Resources of a Storage Network for Data Retrieval 审中-公开

    公开(公告)号：US20240314087A1

    公开(公告)日：2024-09-19

    申请号：US18668356

    申请日：2024-05-20

    Applicant: Pure Storage, Inc.

    Inventor： Jason K. Resch ,  Greg R. Dhuse ,  Manish Motwani ,  Andrew D. Baptist ,  Wesley B. Leggette

    IPC: H04L47/70 ,  G06F3/06 ,  H04L67/1097

    CPC classification number: H04L47/70 ,  G06F3/0616 ,  G06F3/0623 ,  G06F3/0647 ,  G06F3/067 ,  G06F3/0685 ,  H04L67/1097

    Abstract: Methods and apparatus for identifying multiple resources of a storage network for data retrieval are disclosed. In various embodiments, a determination is made to retrieve an encoded data slice from the storage network. Based on configuration information for the storage network, one or more configurations are identified, including a current configuration. For the identified configurations, ranked scoring information relating to the encoded data slice is determined for a plurality of resources associated with the identified configurations. Based on the ranked scoring information, a resource is selected for each of the identified configurations. In addition, a retrieval likelihood level for the data slice is determined for each of the selected resources. Based on the likelihood levels for the selected resources, one or more of the selected resources are identified for encoded data slice retrieval and read slice requests are issued to the one or more selected resources.

Patent Agency Ranking