CPC H04L 41/12 (2013.01) [H04L 43/0852 (2013.01); H04L 43/106 (2013.01)] | 8 Claims |
1. A task processing method, applied to a network topology, wherein the network topology comprises a plurality of nodes, and the task processing method comprises:
acquiring target data and target algorithm required by a target task to be executed;
acquiring at least one first-type node capable of providing the target data and at least one second-type node capable of executing the target algorithm from the network topology;
selecting a node that provides one set of the target data as a first target node from the at least one first-type node, and selecting a node that provides one set of the target algorithm as a second target node from the at least one second-type node;
controlling the second target node to process the target data in the first target node by using the target algorithm;
wherein selecting the node that provides one set of the target data as the first target node from the at least one first-type node, and selecting the node that provides one set of the target algorithm as the second target node from the at least one second-type node comprising:
acquiring a combination formed by the node that provides one set of the target data and the node that provides one set of the target algorithm;
selecting one target combination according to capability information of each combination, determining the node that provides one set of the target data in the target combination as the first target node, and determining the node that provides one set of the target algorithm in the target combination as the second target node;
wherein, the capability information of the combination comprises at least one of a time delay from the node that provides one set of the target data to the node that provides one set of the target algorithm in the combination;
or, the capability information of the combination comprises at least one of a time delay from the node that provides one set of the target data to the node that provides one set of the target algorithm in the combination, and a duration required for the node that provides one set of the target algorithm to execute the target algorithm;
or, the capability information of the combination comprises at least one of a time delay from the node that provides one set of the target data to the node that provides one set of the target algorithm in the combination, and a cache space size of the node that provides one set of the target algorithm.
|