Distributed system workload management via node autonomy

Patent metadata

Field	Value
Publication number	US-12260258-B2
Application number	US-202117466262-A
Country	US
Kind code	B2
Filing date	Sep 3, 2021
Priority date	Sep 3, 2021
Publication date	Mar 25, 2025
Grant date	Mar 25, 2025

Abstract

A system may include a memory and a processor in communication with the memory. The processor may be configured to perform operations. The operations may include calculating a priority factor with a node autonomous center in a node and computing a node service capability with the node autonomous center. The operations may further include selecting, with the node autonomous center, a task based on the priority factor and the node service capability. The operations may further include directing the task to the node.

First claim

What is claimed is:

1. A system, said system comprising:
a memory; and
a processor in communication with said memory, said processor being configured to perform operations, said operations comprising:
calculating a priority factor with a node autonomous center in a node, wherein said node autonomous center is specific to said node;
computing a node service capability for said node with said node autonomous center in said node;
selecting, with said node autonomous center, a task based on said priority factor and said node service capability; and
directing said task to said node.

2. The system of claim 1 , said operations further comprising:
identifying a task type wherein said priority factor is computed based on said task type.

3. The system of claim 1 , said operations further comprising:
selecting, dynamically, at least one input for calculating said priority factor.

4. The system of claim 1 , said operations further comprising:
predicting a future node service capability with said node autonomous center, wherein said future node service capability is a component of said node service capability.

5. The system of claim 4 , said operations further comprising:
analyzing node data with said node autonomous center to predict said future node service capability.

6. The system of claim 1 , said operations further comprising:
communicating, by said node, a communication with a centralized module, wherein said centralized module provides said task to said node upon receipt of direction from said node.

7. The system of claim 6 , wherein:
said communication is communicated between said node and said centralized module via a label repository.

8. A method, said method comprising:
calculating a priority factor with a node autonomous center in a node, wherein said node autonomous center is specific to said node;
computing a node service capability for said node with said node autonomous center in said node;
selecting, with said node autonomous center, a task based on said priority factor and said node service capability; and
directing said task to said node.

9. The method of claim 8 , further comprising:
identifying a task type wherein said priority factor is computed based on said task type.

10. The method of claim 8 , further comprising:
choosing, dynamically, at least one input for calculating said priority factor.

11. The method of claim 8 , further comprising:
predicting a future node service capability with said node autonomous center, wherein said future node service capability is a component of said node service capability.

12. The method of claim 11 , further comprising:
analyzing node data with said node autonomous center to predict said future node service capability.

13. The method of claim 8 , further comprising:
communicating, by said node, a communication with a centralized module, wherein said centralized module provides said task to said node upon receipt of direction from said node.

14. The method of claim 13 , wherein:
said communication is communicated between said node and said centralized module via a label repository.

15. A computer program product, said computer program product comprising a computer readable storage medium having program instructions embodied therewith, said program instructions executable by a processor to cause said processor to perform a function, said function comprising:
calculating a priority factor with a node autonomous center in a node, wherein said node autonomous center is specific to said node;
computing a node service capability for said node with said node autonomous center in said node;
selecting, with said node autonomous center, a task based on said priority factor and said node service capability; and
directing said task to said node.

16. The computer program product of claim 15 , said function further comprising:
identifying a task type wherein said priority factor is computed based on said task type.

17. The computer program product of claim 15 , said function further comprising:
choosing, dynamically, at least one input for calculating said priority factor.

18. The computer program product of claim 15 , said function further comprising:
predicting a future node service capability with said node autonomous center, wherein said future node service capability is a component of said node service capability.

19. The computer program product of claim 15 , said function further comprising:
communicating, by said node, a communication with a centralized module, wherein said centralized module provides said task to said node upon receipt of direction from said node.

20. The method of claim 19 , wherein:
said communication is communicated between said node and said centralized module via a label repository.

Assignees

• IBM

Inventors

• Sheng Hao
• Wang Wen
• Fu Rong
• Yin Jian Dong
• Yu Chuan Qing
• Zhang Kang

Classifications

• G06F2209/503

  Resource availability · CPC title

• G06F2209/5021

  Priority · CPC title

• G06F2209/5019

  Workload prediction · CPC title

• G06F9/505 Primary

  considering the load · CPC title

• G06Q10/0633 Primary

  Workflow analysis · CPC title