IDiyas

For the Inventor, By the Inventor

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.

Patent No.:

US 10855759 B1

PDFFull Text
Date of Patent:
Dec. 01, 2020

Filed:

Jan. 03, 2017

Utilizing a hierarchical index in a dispersed storage network

Applicant:

International Business Machines Corporation, Armonk, NY (US);

Inventors:

Greg R. Dhuse, Chicago, IL (US);

Adam M. Gray, Chicago, IL (US);

Scott M. Horan, Clarendon Hills, IL (US);

Ravi V. Khadiwala, Bartlett, IL (US);

Tyler K. Reid, Schaumburg, IL (US);

Jason K. Resch, Chicago, IL (US);

Daniel J. Scholl, Chicago, IL (US);

Ilya Volvovski, Chicago, IL (US);

Assignee:

PURE STORAGE, INC., Mountain View, CA (US);

Attorneys:

Garlick & Markison

Timothy W. Markison

Bruce E. Stuckman

Primary Examiner:

Hung T Vy

Int. Cl.
CPC ...
G06F 16/22 (2019.01); G06F 16/21 (2019.01); H04L 29/08 (2006.01); G06F 16/23 (2019.01); G06F 3/06 (2006.01); H03M 13/37 (2006.01); G06F 11/10 (2006.01); G06F 12/0813 (2016.01); G06F 12/0837 (2016.01); H03M 13/15 (2006.01); H04H 60/27 (2008.01); G06N 3/00 (2006.01); G06F 12/0871 (2016.01); G06F 12/122 (2016.01); G06F 12/128 (2016.01); G06F 9/50 (2006.01); G06F 12/12 (2016.01);
U.S. Cl.
CPC ...
H04L 67/1095 (2013.01); G06F 3/0604 (2013.01); G06F 3/064 (2013.01); G06F 3/067 (2013.01); G06F 3/0611 (2013.01); G06F 3/0619 (2013.01); G06F 3/0632 (2013.01); G06F 3/0647 (2013.01); G06F 3/0659 (2013.01); G06F 9/5083 (2013.01); G06F 11/1076 (2013.01); G06F 11/1092 (2013.01); G06F 12/0813 (2013.01); G06F 12/0837 (2013.01); G06F 12/0871 (2013.01); G06F 12/122 (2013.01); G06F 12/128 (2013.01); G06F 16/214 (2019.01); G06F 16/2246 (2019.01); G06F 16/2379 (2019.01); G06N 3/002 (2013.01); H03M 13/1515 (2013.01); H03M 13/3761 (2013.01); H04H 60/27 (2013.01); H04L 67/1097 (2013.01); H04L 67/26 (2013.01); H04L 67/2842 (2013.01); G06F 12/12 (2013.01); G06F 2212/604 (2013.01);
Abstract

A method for execution by a dispersed storage and task (DST) processing unit includes generating contention level data by evaluating an update contention level in response to determining to update an entry of a node of a dispersed hierarchical index. The update of the node is executed when the contention level data indicates that the update contention level is favorable. An index update request is generated for transmission to an index update unit via a network when the contention level data indicates that the update contention level is unfavorable.

Find Patent Forward Citations

Loading…