公开(公告)号：US11928230B2

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

申请号：US18105616

申请日：2023-02-03

Applicant: Pure Storage, Inc.

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

IPC: G06F21/62 ,  G06F3/06 ,  G06F11/00 ,  H04L9/40 ,  H04L67/1097

CPC classification number: G06F21/6218 ,  G06F11/00 ,  G06F21/6254 ,  G06F21/6272 ,  G06F21/6281 ,  H04L63/0823 ,  H04L63/104 ,  H04L63/12 ,  H04L63/20 ,  H04L67/1097 ,  G06F3/067 ,  G06F2221/2141 ,  H04L63/101

Abstract: A method for execution by a computing device to adjust efficiency of storing data in a storage network includes processing a data segment based on a storage approach to produce a processed data segment, the storage approach being based on an estimated overwrite frequency for the data segment. The method continues by 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 storing the set of encoded data slices in the memory of the storage network.

公开(公告)号：US11681582B2

公开(公告)日：2023-06-20

申请号：US17653152

申请日：2022-03-02

Applicant: Pure Storage, Inc.

Inventor： Zachary J. Mark ,  Ilya Volvovski ,  Greg R. Dhuse

IPC: G11C29/00 ,  G06F11/10 ,  H03M13/29 ,  G06F3/06 ,  G06F16/84 ,  G06F16/951 ,  G06F16/22 ,  G06F16/27 ,  G06F16/23 ,  H03M13/37 ,  H03M13/15

CPC classification number: G06F11/1076 ,  G06F3/064 ,  G06F3/067 ,  G06F3/0619 ,  G06F11/1092 ,  G06F16/2237 ,  G06F16/2336 ,  G06F16/278 ,  G06F16/86 ,  G06F16/951 ,  H03M13/2906 ,  H03M13/3761 ,  G06F2211/1028 ,  H03M13/1515

Abstract: A storage unit operates by: receiving a write slice request, wherein the write slice request includes a plurality of encoded data slices and wherein the write slice request corresponds to a range; determining whether a write lock conflict exists based on the range; issuing an unfavorable write slice response when the write lock conflict is determined to exist; and when the write lock conflict is determined to not exist: initiating local storage of the plurality of encoded data slices; and issuing a favorable write slice response.

公开(公告)号：US11586755B1

公开(公告)日：2023-02-21

申请号：US17247417

申请日：2020-12-10

Applicant: Pure Storage, Inc.

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

IPC: G06F21/62 ,  G06F11/00 ,  H04L9/40 ,  H04L67/1097 ,  G06F3/06

Abstract: A method for execution by a computing device to adjust data storage efficiency of data in a storage network includes determining an estimated overwrite frequency for a data segment for storage in memory of the storage network. The method continues by determining a storage approach for the data segment based on the estimated overwrite frequency. The method continues by processing the data segment based on the storage approach to produce a processed data segment. The method continues by 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 storing the set of encoded data slices in the memory of the storage network.

公开(公告)号：US20220360541A1

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

申请号：US17814022

申请日：2022-07-21

Applicant: Pure Storage, Inc.

Inventor： Wesley B. Leggette ,  Jason K. Resch ,  Manish Motwani ,  Ilya Volvovski

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

Abstract: Methods and apparatus for proxying data access requests in a storage network are disclosed. In various embodiments, a computing device associated with a first storage location of the storage network performs a method that includes receiving a portion of data that is in the process of being replicated from a second storage location of the storage network. The computing device facilitates storage of the portion of data in the first storage location of the storage network. In response to receiving a read request for the portion of data during the data replication process, the computing device determines whether the portion of data is available from memory of the first storage location. In response to determining that the portion of data is available from memory of the first storage location, the computing device issues a read response that includes the portion of data.

公开(公告)号：US20220327022A1

公开(公告)日：2022-10-13

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

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.

公开(公告)号：US20220188191A1

公开(公告)日：2022-06-16

申请号：US17653152

申请日：2022-03-02

Applicant: Pure Storage, Inc.

Inventor： Zachary J. Mark ,  Ilya Volvovski ,  Greg R. Dhuse

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

Abstract: A storage unit operates by: receiving a write slice request, wherein the write slice request includes a plurality of encoded data slices and wherein the write slice request corresponds to a range; determining whether a write lock conflict exists based on the range; issuing an unfavorable write slice response when the write lock conflict is determined to exist; and when the write lock conflict is determined to not exist: initiating local storage of the plurality of encoded data slices; and issuing a favorable write slice response.

公开(公告)号：US11327689B1

公开(公告)日：2022-05-10

申请号：US17099916

申请日：2020-11-17

Applicant: Pure Storage, Inc.

Inventor： Bruno Hennig Cabral ,  Joseph M. Kaczmarek ,  Ravi V. Khadiwala ,  Ilya Volvovski

IPC: G06F11/00 ,  G06F3/06 ,  G06F11/10 ,  G06F11/14 ,  H04L101/604 ,  H04L67/1097 ,  H03M13/11 ,  H03M13/37 ,  H03M13/15 ,  G06F9/48 ,  G06F9/50 ,  G06F12/0866 ,  G06F12/0891 ,  G06F15/173 ,  H03M13/00 ,  H04L29/06 ,  H04L61/45

Abstract: A computing device includes an interface configured to interface and communicate with a dispersed storage network (DSN), a memory that stores operational instructions, and a processing module operably coupled to the interface and memory such that the processing module, when operable within the computing device based on the operational instructions, is configured to perform various operations. A computing device receives a data access request for an encoded data slice (EDS) associated with a data object. The computing device compares a slice name of the data access request with slice names stored within RAM. When the data access request slice name compares unfavorably with those stored slice names, the computing device transmits an empty data access response that includes no EDS to the other computing device without needing to access a hard disk drive (HDD) that stores EDSs. Alternatively, the computing device transmits a data access response that includes the EDS.

公开(公告)号：US20210382628A1

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

申请号：US17408872

申请日：2021-08-23

Applicant: Pure Storage, Inc.

Inventor： Ahmad Alnafoosi ,  Andrew D. Baptist ,  Greg R. Dhuse ,  Jason K. Resch ,  Ilya Volvovski

IPC: G06F3/06 ,  H04L12/911 ,  H04L29/08 ,  G06F21/64 ,  H04L12/26 ,  G06F9/50 ,  G06F11/10

Abstract: A method for execution in a storage network begins by generating a set of query requests for each data segment of a plurality of data segments that includes a corresponding set of slice identifiers of a plurality of sets of slice identifiers, where each slice identifier of the corresponding set of slice identifiers includes a pillar index based on a vault affiliated with the plurality of data segments. The method continues by transmitting the set of query requests to a set of storage units affiliated with the storage network, receiving a plurality of sets of query responses from the storage units, obtaining a data identifier for slice location identification and generating a storage record that includes the data identifier and an identity of the set of storage units. The method then continues by facilitating migration of at least some encoded data slices associated with the plurality of sets of slice identifiers when the storage record compares unfavorably to a storage record requirement.

公开(公告)号：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.

公开(公告)号：US10860424B1

公开(公告)日：2020-12-08

申请号：US16924708

申请日：2020-07-09

Applicant: Pure Storage, Inc.

Inventor： Greg Dhuse ,  Andrew Baptist ,  Zachary J. Mark ,  Jason K. Resch ,  Ilya Volvovski

IPC: G06F11/00 ,  G06F11/10 ,  H04L29/08 ,  G06F11/20 ,  H04L29/14

Abstract: A method for execution by one or more processing modules of a storage network (SN) begins with the one or more processing modules scanning a storage node of the SN at a predetermined interval to determine whether an erasure encoded data slice (EEDS) of a set of erasure encoded data slices (EEDSs) is corrupt, where the set of erasure encoded data slices (EEDSs) is generated from object data using an erasure error encoding dispersal function. The method continues with the one or more processing modules determining that an EEDS is corrupt and in response, rebuilding the EEDS in place in the storage node.