IP Library Granted Patent US 10,168,950
Granted Patent B2
US 10,168,950 · App. 15/263,564 · Granted Jan 1, 2019

Coordination of connection initiation scheduling in a distributed storage network (DSN)

Inventors: Charles H. Chong (Chicago, IL); Richard W. France (Schaumburg, IL); Patrick A. Tamborski (Chicago, IL)
Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
G06F3/0653G06F3/064G06F3/067G06F3/0611G06F3/0614G06F3/0619G06F3/0659G06F3/0661G06F8/65G06F11/1092H03M13/154H03M13/3761H04L63/061H04L67/1097H04L67/32H04L67/34H03M13/1515H04L67/02H04L67/06H04L67/42
View Patent ↗
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 10,168,950
App. No.
15/263,564
Granted
Jan 1, 2019
Kind
B2
Abstract

A dispersed storage network (DSN) include multiple distributed computing systems distributed across time zones, each including a DSN memory. A global scheduling module identifies a number of the distributed computing systems operating in each of the time zones. For each distributed computing system operating in a particular time zone, the scheduling module selects a connection time based, at least in part, on the number of distributed computing systems operating in the particular time zone. The connection time selected for a particular distributed computing system specifies a recurring time period to be used by that system for initiating connections with a global coordination unit. The global scheduling module issues, to the distributed computing systems, scheduling messages that include information specifying a connection times for particular distributed computing systems.

Claims (55)

1. A method for use in a dispersed storage network (DSN) including a plurality of distributed computing systems distributed across time zones, each computing system including a DSN memory, the method comprising:

identifying, at a global scheduling module used by the plurality of distributed computing systems, a number of the distributed computing systems operating in each of the time zones;

for each distributed computing system operating in a particular time zone, selecting at the global scheduling module, a connection time based, at least in part, on the number of distributed computing systems operating in the particular time zone, wherein a connection time selected for a particular distributed computing system specifies a recurring time period to be used by the particular distributed computing system for initiating a connection with a global coordination unit; and

issuing scheduling messages from the global scheduling module to the plurality of distributed computing systems, wherein the scheduling messages include information specifying a connection times for particular distributed computing systems.

2. The method of claim 1 , wherein the selecting a connection time includes:

selecting a connection-time assignment approach from among a plurality of different connection-time assignment approaches.

3. The method of claim 2 , wherein the connection-time assignment approach is selected from the group consisting of: even distribution, every “X” seconds, frontloaded distribution, backloaded distribution, random distribution, and parallel distribution.

4. The method of claim 1 , wherein the selecting a connection time includes:

attempting to evenly distribute connection times across a given period of time, the given period of time repeated on a periodic basis.

5. The method of claim 4 , wherein:

the given period of time is a portion of an hour;

the given period of time begins at a given hour; and

the given period of time repeats at least on a daily basis.

6. The method of claim 1 , wherein the selecting a connection time includes:

modifying a length of the recurring time period in response to determining that a number of the distributed computing systems operating in a particular time zone exceeds a threshold value.

7. The method of claim 6 , wherein the selecting a connection time includes:

modifying the length of the recurring time period to limit all recurring time periods assigned to distributed computing systems within a particular time zone to occur within a given length of time, wherein a period of recurrence corresponds to the given length of time;

the global coordination unit requiring authentication of each managing unit attempting to initiate a connection with the global coordination unit.

8. A processing system configured to implement a coordination unit for use in a distributed storage network (DSN) including a plurality of distributed computing systems, the coordination unit comprising:

at least one computing core and associated memory configured to implement a scheduling module coupled to the plurality of distributed computing systems included in the DSN, wherein the DSN spans a plurality of time zones;

the scheduling module configured to:

identify a number of the distributed computing systems operating in each of the plurality of time zones;

for each distributed computing system operating in a particular time zone, select a connection time based, at least in part, on the number of distributed computing systems operating in the particular time zone, wherein a connection time selected for a particular distributed computing system specifies a recurring time period to be used by the particular distributed computing system for initiating a connection with the coordination unit; and

issue scheduling messages to the plurality of distributed computing systems, wherein the scheduling messages include information specifying connection times for particular distributed computing systems.

9. The processing system of claim 8 , wherein the scheduling module is further configured to:

select a connection-time assignment approach from among a plurality of different connection-time assignment approaches.

10. The processing system of claim 9 , wherein the scheduling module is further configured to:

select the connection-time assignment approach from the group consisting of: every “X” seconds, frontloaded distribution, backloaded distribution, random distribution, and parallel distribution.

11. The processing system of claim 8 , wherein the scheduling module is further configured to:

attempt to evenly distribute connection times across a given period of time, the given period of time repeated on a periodic basis.

12. The processing system of claim 11 , wherein:

the given period of time is a portion of an hour;

the given period of time begins at a given hour; and

the given period of time repeats at least on a daily basis.

13. The processing system of claim 8 , wherein the scheduling module is further configured to:

modify a length of the recurring time period in response to determining that a number of the distributed computing systems operating in a particular time zone exceeds a threshold value.

14. The processing system of claim 13 , wherein the scheduling module is further configured to:

select the length of the recurring time period to limit all recurring time periods assigned to distributed computing systems within a particular time zone to occur within a given length of time, wherein a period of recurrence corresponds to the given length of time.

15. A distributed storage network (DSN) spanning a plurality of time zones, the DSN comprising:

a plurality distributed computing systems implementing a plurality of DSN memories, each of the plurality of DSN memories including a DSTN managing unit;

a coordination unit coupled to the DSTN managing unit included in each of the plurality of DSN memories, the coordination unit including at least one computing core and associated memory configured to implement a scheduling module;

the scheduling module configured to:

identify a number of the plurality of DSN memories operating in each of the plurality of time zones;

for each of the plurality of DSN memories operating in a particular time zone, select a connection time based, at least in part, on the number of plurality of DSN memories operating in the particular time zone, wherein a connection time selected for a particular DSN memory specifies a recurring time period to be used by a DSTN managing unit associated with the particular DSN memory for initiating a connection with the coordination unit; and

issue scheduling messages to the plurality of distributed computing systems, wherein the scheduling messages include information specifying connection times for particular distributed computing systems.

16. The distributed storage network of claim 15 , wherein the scheduling module is further configured to:

select a connection-time assignment approach from among a plurality of different connection-time assignment approaches.

17. The distributed storage network of claim 16 , wherein the scheduling module is further configured to:

select the connection-time assignment approach from the group consisting of: every “X” seconds, frontloaded distribution, backloaded distribution, random distribution, and parallel distribution.

18. The distributed storage network of claim 15 , wherein the scheduling module is further configured to:

attempt to evenly distribute connection times across a given period of time, the given period of time repeated on a periodic basis.

19. The distributed storage network of claim 15 , wherein the scheduling module is further configured to:

modify a length of the recurring time period in response to determining that a number of the plurality of DSN memories operating in a particular time zone exceeds a threshold value.

20. The distributed storage network of claim 15 , wherein the scheduling module is further configured to:

select a length of the recurring time period to limit all recurring time periods assigned to the plurality of DSN memories within a particular time zone to occur within a given length of time, wherein a period of recurrence corresponds to the given length of time.

Assignments (5)
TERMINATION AND RELEASE OF SECURITY INTEREST IN PATENT RIGHTS Recorded Jun 11, 2025
From: BARCLAYS BANK PLC, AS ADMINISTRATIVE AGENT
To: PURE STORAGE, INC.
Reel/Frame 071558/0523 →
SECURITY INTEREST Recorded Aug 26, 2020
From: PURE STORAGE, INC.
To: BARCLAYS BANK PLC AS ADMINISTRATIVE AGENT
Reel/Frame 053867/0581 →
CORRECTIVE ASSIGNMENT TO CORRECT THE 9992063 AND 10334045 LISTED IN ERROR PREVIOUSLY RECORDED ON REEL 049556 FRAME 0012. ASSIGNOR(S) HEREBY CONFIRMS THE ASSIGNOR HEREBY CONFIRMS THE ASSIGNMENT. Recorded Jan 14, 2020
From: INTERNATIONAL BUSINESS MACHINES CORPORATION
To: PURE STORAGE, INC.
Reel/Frame 052205/0705 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 21, 2019
From: INTERNATIONAL BUSINESS MACHINES CORPORATION
To: PURE STORAGE, INC.
Reel/Frame 049556/0012 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 13, 2016
From: CHONG, CHARLES H.; FRANCE, RICHARD W.; TAMBORSKI, PATRICK A.
To: INTERNATIONAL BUSINESS MACHINES CORPORATION
Reel/Frame 039716/0303 →
Continuity (2)
Provisional Application 62222819 · Sep 24, 2015
Related Publication 20170094013A1 · Mar 30, 2017