The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Date of Patent:
Jul. 18, 2023

Filed:

Nov. 30, 2021
Applicant:

Pure Storage, Inc., Mountain View, CA (US);

Inventor:

Ilir Iljazi, Chicago, IL (US);

Assignee:

Pure Storage, Inc., Mountain View, CA (US);

Attorneys:
Primary Examiner:
Int. Cl.
CPC ...
G06F 11/00 (2006.01); G06F 11/07 (2006.01); G06F 30/20 (2020.01); G06F 3/06 (2006.01); G06F 11/10 (2006.01); G06F 11/14 (2006.01); G06F 11/20 (2006.01); G06F 11/30 (2006.01); G06F 11/32 (2006.01); G06F 13/40 (2006.01); G06F 13/42 (2006.01); G06N 3/04 (2023.01); G06N 3/084 (2023.01); G06N 3/10 (2006.01); G06Q 10/20 (2023.01); H03M 13/15 (2006.01); H03M 13/29 (2006.01); H03M 13/37 (2006.01); H03M 13/00 (2006.01); H04L 9/08 (2006.01); H04L 9/14 (2006.01); H04L 9/32 (2006.01); H04L 9/40 (2022.01); G06Q 10/0631 (2023.01);
U.S. Cl.
CPC ...
G06F 11/0781 (2013.01); G06F 3/064 (2013.01); G06F 3/0604 (2013.01); G06F 3/0605 (2013.01); G06F 3/0619 (2013.01); G06F 3/0623 (2013.01); G06F 3/0629 (2013.01); G06F 3/0644 (2013.01); G06F 3/0653 (2013.01); G06F 3/0659 (2013.01); G06F 11/0709 (2013.01); G06F 11/079 (2013.01); G06F 11/0727 (2013.01); G06F 11/0751 (2013.01); G06F 11/0793 (2013.01); G06F 11/1076 (2013.01); G06F 11/1451 (2013.01); G06F 11/2094 (2013.01); G06F 11/3034 (2013.01); G06F 11/3051 (2013.01); G06F 11/3055 (2013.01); G06F 11/327 (2013.01); G06F 13/4022 (2013.01); G06F 13/4282 (2013.01); G06F 30/20 (2020.01); G06N 3/04 (2013.01); G06N 3/084 (2013.01); G06N 3/10 (2013.01); G06Q 10/06316 (2013.01); G06Q 10/063116 (2013.01); G06Q 10/20 (2013.01); H03M 13/1515 (2013.01); H03M 13/2909 (2013.01); H03M 13/3761 (2013.01); H03M 13/616 (2013.01); H04L 9/0869 (2013.01); H04L 9/0894 (2013.01); H04L 9/14 (2013.01); H04L 9/3242 (2013.01); H04L 63/0428 (2013.01); H04L 63/061 (2013.01); H04L 63/101 (2013.01); G06F 3/067 (2013.01); G06F 2201/84 (2013.01);
Abstract

A method for execution by a storage network begins by issuing a decode threshold number of read requests for a set of encoded data slices to a plurality of storage units of a set of storage units and continues by determining whether less than a decode threshold number of read requests has been received in a time window. The method continues by identifying one or more encoded data slices encoded data slices associated with read requests of the decode threshold number of read requests that have not been received and for an encoded data slice of the one or more encoded data slices, issuing a priority read request to a storage unit storing a copy of the encoded data slice. The method then continues by receiving a response from the storage unit storing the copy of the encoded data, where the storage unit storing the copy of the encoded data slice is adapted to delay one or more maintenance tasks in response to the priority read request.


Find Patent Forward Citations

Loading…