-
公开(公告)号:US20230214303A1
公开(公告)日:2023-07-06
申请号:US18182236
申请日:2023-03-10
Applicant: Pure Storage, Inc.
Inventor: Adam M. Gray , Greg R. Dhuse , Andrew D. Baptist , Ravi V. Khadiwala , Wesley B. Leggette , Scott M. Horan , Franco V. Borich , Bart R. Cilfone , Daniel J. Scholl
CPC classification number: G06F11/1469 , G06F11/1464 , G06F3/067 , G06F3/064 , G06F3/0619 , G06F11/1612 , G06F11/1092 , G06F16/11 , H04L63/00 , G06F11/1474 , H04L67/1097 , G06F2201/82 , G06F2201/805 , G06F2211/1028 , G06F2201/81 , H04L63/0428
Abstract: A method for execution by a distributed storage network begins by receiving a request to transfer a copy of a set of encoded data slices from at least some associated virtual storage vaults to a destination virtual storage vault and continues by determining whether the destination storage unit supports a source virtual storage vault of the at least some source virtual storage vaults. When the destination storage unit supports the source virtual storage vault the method continues by determining a sub-set of encoded data slices of the set of encoded data slices for transfer and finally, by facilitating sending the sub-set of encoded data slices to the destination storage unit.
-
公开(公告)号: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.
-
公开(公告)号:US20220327103A1
公开(公告)日:2022-10-13
申请号:US17809796
申请日:2022-06-29
Applicant: Pure Storage, Inc.
Inventor: Greg R. Dhuse , Ilya Volvovski , Adam M. Gray , Andrew D. Baptist
Abstract: A method begins with a processing module of a distributed storage network (DSN), receiving a request to access a data object stored in the DSN and identifying a first data descriptor associated with the data object, identifying a second data descriptor associated with the data object, identifying a first data index key and a first index structure for the first data descriptor and identifying a second data index key and a second index structure for the second data descriptor. The method continues with the processing module accessing the first index structure for the first data descriptor , based on the first and second data index keys, to retrieve a first and second set of data identifiers, respectively and based on one or more data identifiers being common to the first set of data identifiers and the second set of data identifiers, creating a superset of data identifiers.
-
公开(公告)号:US11281532B1
公开(公告)日:2022-03-22
申请号:US16535732
申请日:2019-08-08
Applicant: Pure Storage, Inc.
Inventor: Adam M. Gray , Greg R. Dhuse , Andrew D. Baptist , Ravi V. Khadiwala , Wesley B. Leggette , Scott M. Horan , Franco V. Borich , Bart R. Cilfone , Daniel J. Scholl
IPC: G06F12/00 , G06F11/10 , H04L67/1097 , H04L12/46 , G06F16/10 , G06F11/20 , G06F3/06 , G06F13/00 , G06F13/28
Abstract: A method begins with a processing module obtaining a data object from a user and identifying a plurality of virtual storage vaults (VSVs) for storage of the data object. The method continues with the processing module determining dispersal error encoding parameters associated with a first virtual storage vault and error encoding the data object in accordance with those dispersal error encoding parameters to produce a corresponding plurality of sets of encoded data slices (EDSs), issuing write slice requests for the EDSs and receiving EDS information from at least some of the plurality of VSVs. When the EDS information indicates that a threshold number of VSVs have successfully stored the plurality of sets of encoded data slices within a synchronization timeframe, the method continues with the processing module issuing a favorable response to the user, or when a threshold number of VSVs have not successfully stored the plurality of sets of encoded data slices initiating a retry process.
-
公开(公告)号:US11204836B1
公开(公告)日:2021-12-21
申请号:US16542946
申请日:2019-08-16
Applicant: Pure Storage, Inc.
Inventor: Jason K. Resch , Adam M. Gray
Abstract: A method for execution by a distributed storage (DS) unit of a dispersed storage network (DSN), includes receiving a set of write slice requests that includes a set of slice names that are not utilized to store encoded data slices (EDSs), where each write slice request from the set of slice names that are not utilized to store encoded data slices includes a trap slice. The method continues with an access slice request that includes a requested slice name being received from a second DSN client, and then continues by determining whether the requested slice name corresponds to a trap slice stored by the DS unit. When the requested slice name corresponds to a trap slice, an action is determined for the access slice request based on an anomaly processing scheme.
-
公开(公告)号:US20240338352A9
公开(公告)日:2024-10-10
申请号:US17809796
申请日:2022-06-29
Applicant: Pure Storage, Inc.
Inventor: Greg R. Dhuse , Ilya Volvovski , Adam M. Gray , Andrew D. Baptist
CPC classification number: G06F16/2272 , G06F11/1096 , G06F16/22 , G06F16/221 , G06F16/2219 , G06F16/2237 , G06F11/1092
Abstract: A method begins with a processing module of a distributed storage network (DSN), receiving a request to access a data object stored in the DSN and identifying a first data descriptor associated with the data object, identifying a second data descriptor associated with the data object, identifying a first data index key and a first index structure for the first data descriptor and identifying a second data index key and a second index structure for the second data descriptor. The method continues with the processing module accessing the first index structure for the first data descriptor , based on the first and second data index keys, to retrieve a first and second set of data identifiers, respectively and based on one or more data identifiers being common to the first set of data identifiers and the second set of data identifiers, creating a superset of data identifiers.
-
公开(公告)号:US11321172B1
公开(公告)日:2022-05-03
申请号:US16840196
申请日:2020-04-03
Applicant: Pure Storage, Inc.
Inventor: Adam M. Gray , Greg R. Dhuse , Andrew D. Baptist , Ravi V. Khadiwala , Wesley B. Leggette , Scott M. Horan , Franco V. Borich , Bart R. Cilfone , Daniel J. Scholl
Abstract: A method includes identifying an existing logical storage vault having existing dispersed storage coding properties for vault transformation, where a first set of storage units support the existing logical storage vault, and a data object of first data objects stored within the first set of storage units is stored as a first plurality of sets of encoded data slices in accordance with the existing dispersed storage coding properties. The method includes identifying a new logical storage vault having new dispersed storage coding properties, wherein storage units support the new logical storage vault. The method includes transforming the first data objects from being in accordance with the existing dispersed storage coding properties to being in accordance with the new dispersed storage coding properties to produce transformed first data objects. The method includes storing the transformed first data objects in the new logical storage vault supported by the storage units.
-
公开(公告)号:US20240427672A1
公开(公告)日:2024-12-26
申请号:US18830020
申请日:2024-09-10
Applicant: Pure Storage, Inc.
Inventor: Adam M. Gray , Greg R. Dhuse , Andrew D. Baptist , Ravi V. Khadiwala , Wesley B. Leggette , Scott M. Horan , Franco V. Borich , Bart R. Cilfone , Daniel J. Scholl , Jason K. Resch
Abstract: A method for execution on a storage network begins with receipt of a data object for storage by a plurality of users and continues with a storage network processing unit determining whether the data object is associated with a replica storage node of a plurality of replica storage nodes associated with the storage network. When the data object is associated with a replica storage node, the method continues by facilitating storing the data object in each replica storage node of the plurality of replica storage nodes and receiving a plurality of access responses from at least some replica storage nodes of the plurality of replica storage nodes. The method then continues by determining whether an access response threshold number of access responses have been received and finally, in response to a determination that an access response threshold number of access responses have been received, transmitting an acknowledgement to the plurality of users.
-
公开(公告)号:US12093143B2
公开(公告)日:2024-09-17
申请号:US18182236
申请日:2023-03-10
Applicant: Pure Storage, Inc.
Inventor: Adam M. Gray , Greg R. Dhuse , Andrew D. Baptist , Ravi V. Khadiwala , Wesley B. Leggette , Scott M. Horan , Franco V. Borich , Bart R. Cilfone , Daniel J. Scholl
CPC classification number: G06F11/1469 , G06F3/0619 , G06F3/064 , G06F3/067 , G06F11/1092 , G06F11/1464 , G06F11/1474 , G06F11/1612 , G06F16/11 , H04L63/00 , H04L67/1097 , G06F2201/805 , G06F2201/81 , G06F2201/82 , G06F2211/1028 , H04L63/0428
Abstract: A method for execution by a distributed storage network begins by receiving a request to transfer a copy of a set of encoded data slices from at least some associated virtual storage vaults to a destination virtual storage vault and continues by determining whether the destination storage unit supports a source virtual storage vault of the at least some source virtual storage vaults. When the destination storage unit supports the source virtual storage vault the method continues by determining a sub-set of encoded data slices of the set of encoded data slices for transfer and finally, by facilitating sending the sub-set of encoded data slices to the destination storage unit.
-
公开(公告)号:US20220394091A1
公开(公告)日:2022-12-08
申请号: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 , G06F11/10 , G06F3/06
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.
-
-
-
-
-
-
-
-
-