中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

309 records (took 0.022 seconds)

    Retrieval of Data Objects with a Common Trait in a Storage Network
    101.
    发明申请
    Retrieval of Data Objects with a Common Trait in a Storage Network 有权

    公开(公告)号：US20210357290A1

    公开(公告)日：2021-11-18

    申请号：US17443915

    申请日：2021-07-28

    Applicant: Pure Storage, Inc.

    Inventor： Jason K. Resch ,  Greg Dhuse ,  Andrew Baptist

    IPC: G06F11/10 ,  H03M13/29 ,  G06F3/06 ,  G06F16/22 ,  G06F16/951 ,  G06F16/84

    Abstract: A method includes identifying an independent data object of a plurality of independent data objects for retrieval from dispersed storage network (DSN) memory. The method further includes determining a mapping of the plurality of independent data objects into a data matrix, wherein the mapping is in accordance with the dispersed storage error encoding function. The method further includes identifying, based on the mapping, an encoded data slice of the set of encoded data slices corresponding to the independent data object. The method further includes sending a retrieval request to a storage unit of the DSN memory regarding the encoded data slice. When the encoded data slice is received, the method further includes decoding the encoding data slice in accordance with the dispersed storage error encoding function and the mapping to reproduce the independent data object.

    Partial task messaging in a distributed storage system
    104.
    发明授权
    Partial task messaging in a distributed storage system 有权

    公开(公告)号：US10944712B1

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

    申请号：US16861559

    申请日：2020-04-29

    Applicant: Pure Storage, Inc.

    Inventor： Wesley B. Leggette ,  Andrew D. Baptist ,  Greg R. Dhuse ,  Jason K. Resch ,  Ilya Volvovski ,  Manish Motwani ,  S. Christopher Gladwin ,  Gary W. Grube ,  Thomas F. Shirley, Jr.

    IPC: H04L12/58 ,  G06F9/50 ,  G06F9/48

    Abstract: A method for processing partial tasks in a distributed storage network (DSN) includes receiving a partial task request message for a DS execution unit, where the partial task request message includes corresponding partial tasks. The method continues by processing each partial task request message in accordance with the processing parameters to produce task request slice groupings, generating slices, such that each message is directed at a corresponding DS execution unit, and the sending the slice groupings and the task request slice groupings to the selected DS execution units for storage therein. The method continues by retrieving at least a decode threshold number of task response slices of one or more task response slice groupings from the DS execution units, decoding the task response slices, retrieving at least a decode threshold number of partial result slices, and decoding the partial results slices and processing the partial results to produce a result.

    Cloning failing memory devices in a dispersed storage network
    105.
    发明授权
    Cloning failing memory devices in a dispersed storage network 有权

    公开(公告)号：US10922198B1

    公开(公告)日：2021-02-16

    申请号：US16530155

    申请日：2019-08-02

    Applicant: Pure Storage, Inc.

    Inventor： Ilir Iljazi ,  Jason K. Resch

    IPC: G06F11/16 ,  G06F3/06 ,  G06F11/10 ,  G06F11/20

    Abstract: A method for execution by a dispersed storage and task (DST) execution unit identifying a failing memory device based on memory device diagnostic data. A cloning task is executed by designating memory of a replacement memory device to store encoded slices stored in the failing memory device, where the cloning task is executed over a cloning duration time period. A write request is received via a network at a receiving time during the cloning duration time period that includes a new encoded slice, and the new encoded slice is assigned to a temporary memory device for storage based on an identifier of the new encoded. The new encoded slice is transferred from the temporary memory device to the replacement memory device in response to an elapsing of the cloning duration time period corresponding to completion of the execution of the cloning task.

    Re-Encoding Data in an Expanded Storage Pool
    108.
    发明申请
    Re-Encoding Data in an Expanded Storage Pool 有权

    公开(公告)号：US20250165174A1

    公开(公告)日：2025-05-22

    申请号：US19018408

    申请日：2025-01-13

    Applicant: Pure Storage, Inc.

    Inventor： Ethan S. Wozniak ,  Andrew D. Baptist ,  Greg R. Dhuse ,  Ilya Volvovski ,  Jason K. Resch ,  Ravi V. Khadiwala ,  Wesley B. Leggette

    IPC: G06F3/06

    Abstract: A processing system is operable to encode data to produce a first set of data slices based on a value of a width parameter. The data is stored based on maintaining storage of the first set of data slices across a set of storage units of a storage pool. Storage of the first set of data slices is maintained in the set of storage units of the storage pool after addition of an additional set of storage units added to the storage pool. The value of the width parameter is increased to an increased value to produce an updated width parameter. The data is re-encoded in accordance with the updated width parameter to produce a second set of data slices. The data is re-stored based on maintaining storage of the second set of data slices across the expanded set of storage units of the storage pool.

    Storage Network Having Metadata Storage Trees
    109.
    发明申请
    Storage Network Having Metadata Storage Trees 有权

    公开(公告)号：US20250147684A1

    公开(公告)日：2025-05-08

    申请号：US19013498

    申请日：2025-01-08

    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.

    Dynamically Routing Subsets Of Encoded Data Slices
    110.
    发明申请
    Dynamically Routing Subsets Of Encoded Data Slices 有权

    公开(公告)号：US20250110831A1

    公开(公告)日：2025-04-03

    申请号：US18980187

    申请日：2024-12-13

    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 computing device of a storage network, the computing device including memory, an interface, and at least one processing module operably coupled to the memory and the interface, where the at least one processing module is operable to error encode a data segment in accordance with error encoding parameters to produce a set of encoded data slices. The at least one processing module also sends via the interface, a first subset of encoded data slices of the set of encoded data slices via a first routing path of a plurality of routing paths to a set of storage units, where the first routing path has a performance level greater than a first performance threshold, and sends, via the interface, a second subset of encoded data slices of the set of encoded data slices via a second routing path of the plurality of routing paths to the set of storage units.

Patent Agency Ranking