Load leveler

Patent metadata

Field	Value
Publication number	US-11263059-B2
Application number	US-201816125466-A
Country	US
Kind code	B2
Filing date	Sep 7, 2018
Priority date	Sep 7, 2018
Publication date	Mar 1, 2022
Grant date	Mar 1, 2022

Abstract

An example operation may include one or more of connecting, by a load leveler, to a blockchain network comprising a plurality of nodes and configured to store a common work item, computing, by the load leveler, loads across the plurality of the nodes that need to execute the common work item upon completion of current tasks, determining, by the load leveler, a network load impact based on execution of a common blockchain consensus checking process on the network nodes, executing, by the load leveler, a work assessment process based on the loads computed across the plurality of the nodes and on the determined network load impact of the blockchain network, and assigning, by the load leveler, new tasks to the nodes based on results of the execution of the work assessment process.

First claim

What is claimed is:

1. A system, comprising:
a processor;
a memory on which are stored machine readable instructions that when executed by the processor, cause the processor to:
connect to a blockchain network comprising a plurality of blockchain peers;
determine a current computational load for a blockchain peer from among the plurality of the blockchain peers based on a frequency at which the blockchain peer succeeds in solving a blockchain block hash;
determine an overall load on the plurality of blockchain peers based on a difficulty of the blockchain block hash; and
assign new tasks to the blockchain peer based on the current computational load determined for the blockchain peer and the overall load on the plurality of blockchain peers.

2. The system of claim 1 , wherein the processor is further configured to determine the current computational load for the blockchain peer based on a comparison of the frequency at which the blockchain peer solves the blockchain hash and block solution frequencies of other blockchain peers among the plurality of blockchain peers.

3. The system of claim 1 , wherein the instructions are further to cause the processor to assign more tasks to a blockchain peer that solves blockchain blocks at a faster frequency than are assigned to another blockchain peer that solves blockchain blocks at a slower frequency.

4. The system of claim 1 , wherein the instructions are further to cause the processor to balance the new tasks among the plurality of blockchain peers based on respective current computational loads determined for the plurality of blockchain peers.

5. The system of claim 1 , wherein the instructions are further to cause the processor to determine if unassigned tasks require a high input/output (I/O) commitment.

6. The system of claim 5 , wherein the instructions are further to cause the processor to assign the tasks that require the high I/O commitment to an under-loaded node that has no current computational load.

7. A method, comprising:
connecting, by a load leveler, to a blockchain network comprising a plurality of blockchain peers;
determining, by the load leveler, a current computational load for a blockchain peer from among the plurality of blockchain peers based on a frequency at which the blockchain peer succeeds in solving a blockchain block hash;
determining an overall load on the plurality of blockchain peers based on a difficulty of the blockchain block hash; and
assigning, by the load leveler, new tasks to the blockchain peer based on the current computational load determined for the blockchain peer and the overall load on the plurality of blockchain peers.

8. The method of claim 7 , wherein the determining further comprises determining the current computational load for the blockchain peer based on a comparison of the frequency at which the blockchain peer solves the blockchain hash and block solution frequencies of other blockchain peers among the plurality of blockchain peers.

9. The method of claim 7 , wherein the assigning comprises assigning more tasks to a blockchain peer that solves blockchain blocks at a faster frequency than are assigned to another blockchain peer that solves blockchain blocks at a slower frequency.

10. The method of claim 7 , further comprising balancing the new tasks among the plurality of blockchain peers based on respective current computational loads determined for the plurality of blockchain peers.

11. The method of claim 7 , further comprising determining if unassigned tasks require a high input/output (I/O) commitment.

12. The method of claim 11 , further comprising assigning the tasks that require the high I/O commitment to an under-loaded node that has no current computational load.

13. A non-transitory computer readable medium comprising instructions, that when read by a processor, cause the processor to perform:
connecting to a blockchain network comprising a plurality of blockchain peers;
determining a current computational load for a blockchain peer from among the plurality of blockchain peers based on a frequency at which the blockchain peer succeeds in solving a blockchain block hash;
determining an overall load on the plurality of blockchain peers based on a difficulty of the blockchain block hash; and
assigning new tasks to the blockchain peer based on the current computational load determined for the blockchain peer and the overall load on the plurality of blockchain peers.

14. The non-transitory computer readable medium of claim 13 wherein the determining further comprises determining the current computational load for the blockchain peer based on a comparison of the frequency at which the blockchain peer solves the blockchain hash and block solution frequencies of other blockchain peers among the plurality of blockchain peers.

15. The non-transitory computer readable medium of claim 14 further comprising instructions, that when read by the processor, cause the processor to assign more tasks to a blockchain peer that solves blockchain blocks at a faster frequency than are assigned to another blockchain peer that solves blockchain blocks at a slower frequency.

16. The non-transitory computer readable medium of claim 13 further comprising instructions, that when read by the processor, cause the processor to balance the new tasks among the plurality of blockchain peers based on respective current computational loads determined for the plurality of blockchain peers.

17. The non-transitory computer readable medium of claim 13 further comprising instructions, that when read by the processor, cause the processor to determine if unassigned tasks require a high input/output (I/O) commitment.

18. The non-transitory computer readable medium of claim 17 further comprising instructions, that when read by the processor, cause the processor to assign the tasks that require the high I/O commitment to an under-loaded node that has no current computational load.

Assignees

• IBM

Inventors

• Fry Jonathan
• Penny Christopher J
• Bergendahl Marc
• Waskiewicz Christopher J
• Wynne Jean
• Demarest James

Classifications

• H04L9/50

  using hash chains, e.g. blockchains or hash trees · CPC title

• H04L9/3239 Primary

  involving non-keyed hash functions, e.g. modification detection codes [MDCs], MD5, SHA or RIPEMD · CPC title

• G06F9/5083 Primary

  Techniques for rebalancing the load in a distributed system · CPC title

• H04L9/0637

  Modes of operation, e.g. cipher block chaining [CBC], electronic codebook [ECB] or Galois/counter mode [GCM] · CPC title

• G06F9/505

  considering the load · CPC title