Graph data based task scheduling method, apparatus and storage medium thereof

A graph-data-based task scheduling apparatus, comprising:

• a memory operable to store program code;
• and
• a processor operable to read the program code and configured to:
• obtain subgraph data divided from graph data to be processed by a computing node;
• perform a unit computing task for a graph node in the subgraph data;
• obtain a first quantized value, the first quantized value being a quantized value corresponding to a completed unit computing task in response to data corresponding to the completed unit computing task being formed into blockchain data;
• obtain a second quantized value, the second quantized value being a quantized value corresponding to the completed unit computing task in response to the data corresponding to the completed unit computing task being not formed into blockchain data;
• determine a third quantized value corresponding to an uncompleted unit computing task in the subgraph data;
• and
• exchange the graph node and the first quantized value with another computing node in response to the second quantized value and the third quantized value failing to meet an equilibrium condition.

A non-transitory machine-readable media, having processor executable instructions stored thereon for causing a processor to:

• obtain subgraph data divided from graph data to be processed by a computing node;
• perform a unit computing task for a graph node in the subgraph data;
• obtain a first quantized value, the first quantized value being a quantized value corresponding to a completed unit computing task in response to data corresponding to the completed unit computing task being formed into blockchain data;
• obtain a second quantized value, the second quantized value being a quantized value corresponding to the completed unit computing task in response to the data corresponding to the completed unit computing task being not formed into blockchain data;
• determine a third quantized value corresponding to an uncompleted unit computing task in the subgraph data;
• and
• exchange the graph node and the first quantized value with another computing node in response to the second quantized value and the third quantized value failing to meet an equilibrium condition.