IP Library Patent Application 16122949
Patent Application
App. No. 16/122,949

USING INDEX STRUCTURE TO GUIDE LOAD BALANCING IN A DISTRIBUTED STORAGE SYSTEM

Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US None
App. No.
16/122,949
Abstract

A method for execution by one or more processing modules of one or more computing devices of a dispersed storage network (DSN), the method begins by determining whether to update naming affiliation information that associates index node index key range assignments of a dispersed hierarchical index to a plurality of data access resources. The method continues, when updating, by identifying a number of available data access resources, determining a branching factor of the dispersed hierarchical index, identifying an index key type associated with the dispersed hierarchical index, partitioning the branching factor based on the number of available data access resources to produce an index node to data access resource mapping, generating updated naming affiliation information based on the index node to data access resource mapping and the index key type and facilitating data access utilizing the updated naming affiliation information.

Claims (46)

1 . A method for execution by one or more processing modules of one or more computing devices of a dispersed storage network (DSN), the method comprises:

determining whether to update naming affiliation information that associates index node index key range assignments of a dispersed hierarchical index to a plurality of data access resources;

when updating, identifying a number of available data access resources;

determining a branching factor of the dispersed hierarchical index;

identifying an index key type associated with the dispersed hierarchical index;

partitioning the branching factor based on the number of available data access resources to produce an index node to data access resource mapping;

generating updated naming affiliation information based on the index node to data access resource mapping and the index key type; and

facilitating data access utilizing the updated naming affiliation information.

2 . The method of claim 1 , wherein the determining whether to update naming affiliation information is based on one or more of: interpreting an update schedule, detecting a branching factor change, detecting a number of available data access resources, or interpreting performance information.

3 . The method of claim 1 , wherein the plurality of data access resources includes a plurality of DS processing units.

4 . The method of claim 1 , wherein the identifying a number of available data access resources includes at least one of: interpreting an error message, initiating a query, receiving a query response, or performing a lookup.

5 . The method of claim 1 , wherein the determining a branching factor of the dispersed hierarchical index includes one or more of: accessing the dispersed hierarchical index and counting a number of index nodes associated with at least one level below a root node level or an estimate calculation based on configured join and split thresholds.

6 . The method of claim 1 further comprises accessing common index information associated with the dispersed hierarchical index to extract the index key type.

7 . The method of claim 1 , wherein the partitioning the branching factor includes dividing the branching factor by the number of available data access resources to produce the index node to data access resource mapping.

8 . The method of claim 1 , wherein the generating updated naming affiliation information includes identifying index key ranges associated with each of the data access resources in accordance with the data access resource mapping and the index key type.

9 . The method of claim 1 , wherein the facilitating data access includes distributing the updated naming affiliation information to accessing devices and to the data access resources.

10 . The method of claim 1 , wherein the facilitating data access includes access devices utilizing the updated naming affiliation information to access the data access resources.

11 . A computing device of a group of computing devices of a dispersed storage network (DSN), the computing device comprises:

an interface;

a local memory; and

a processing module operably coupled to the interface and the local memory, wherein the processing module functions to:

determine whether to update naming affiliation information that associates index node index key range assignments of a dispersed hierarchical index to a plurality of data access resources;

when updating, identify a number of available data access resources;

determine a branching factor of the dispersed hierarchical index;

identify an index key type associated with the dispersed hierarchical index;

partition the branching factor based on the number of available data access resources to produce an index node to data access resource mapping;

generate updated naming affiliation information based on the index node to data access resource mapping and the index key type; and

facilitate data access utilizing the updated naming affiliation information.

12 . The computing device of claim 11 , wherein the determine whether to update naming affiliation information is based on one or more of: interpreting an update schedule, detecting a branching factor change, detecting a number of available data access resources, or interpreting performance information.

13 . The computing device of claim 11 , wherein the plurality of data access resources includes a plurality of DS processing units.

14 . The computing device of claim 11 , wherein the identify a number of available data access resources includes at least one of: interpreting an error message, initiating a query, receiving a query response, or performing a lookup.

15 . The computing device of claim 11 , wherein the determine a branching factor of the dispersed hierarchical index includes one or more of: accessing the dispersed hierarchical index and counting a number of index nodes associated with at least one level below a root node level or an estimate calculation based on configured join and split thresholds.

16 . The computing device of claim 11 further comprises accessing common index information associated with the dispersed hierarchical index to extract the index key type.

17 . The computing device of claim 11 , wherein the partition the branching factor includes dividing the branching factor by the number of available data access resources to produce the index node to data access resource mapping.

18 . The computing device of claim 11 , wherein the generate updated naming affiliation information includes identifying index key ranges associated with each of the data access resources in accordance with the data access resource mapping and the index key type.

19 . The computing device of claim 11 , wherein the facilitate data access includes distributing the updated naming affiliation information to accessing devices and to the data access resources and utilizing the updated naming affiliation information to access the data access resources.

20 . A dispersed storage network (DSN) comprises:

a plurality of data access resources; and

a processing module operably coupled to an interface and local memory, wherein the processing module functions to:

determine whether to update naming affiliation information that associates index node index key range assignments of a dispersed hierarchical index to the plurality of data access resources;

when updating, identify a number of available data access resources;

determine a branching factor of the dispersed hierarchical index;

identify an index key type associated with the dispersed hierarchical index;

partition the branching factor based on the number of available data access resources to produce an index node to data access resource mapping;

generate updated naming affiliation information based on the index node to data access resource mapping and the index key type; and

facilitate data access utilizing the updated naming affiliation information.

Assignments (3)
CORRECTIVE ASSIGNMENT TO CORRECT THE DELETE 15/174/279 AND 15/174/596 PROPERTY NUMBERS PREVIOUSLY RECORDED AT REEL: 49555 FRAME: 530. ASSIGNOR(S) HEREBY CONFIRMS THE ASSIGNMENT. Recorded Jan 7, 2020
From: INTERNATIONAL BUSINESS MACHINES CORPORATION
To: PURE STORAGE, INC.
Reel/Frame 051495/0831 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 21, 2019
From: INTERNATIONAL BUSINESS MACHINES CORPORATION
To: PURE STORAGE, INC.
Reel/Frame 049555/0530 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 6, 2018
From: RESCH, JASON K.; DHUSE, GREG R.
To: INTERNATIONAL BUSINESS MACHINES CORPORATION
Reel/Frame 046797/0743 →