Data processing method and device

Abstract

An embodiment of the application provides a data processing method and device. For a distributed data processing system having at least one edge node and a control unit, after obtaining the first task file, the control unit can first determine whether the first task file includes a first label. The first task file is used to indicate the execution of a target processing task, and the first label indicates that the target task file is used to indicate that the edge node executes the target processing task. If the first task file includes the first label, indicating that the first task file requires an edge node to execute, the control unit can determine at least one target node based on the first task file and instruct at least one target node to execute the target processing task. The target node is the edge node indicated by the first task file, that is, the edge node that executes the target processing task. In this way, unified distribution and scheduling of applications on edge nodes can be achieved by simply adjusting and modifying the labels.

Description

Technical Field

[0001] The present application relates to the field of computer technology, and in particular to a data processing method and device. Background Art

[0002] With the advancement of computer technology, container virtualization has become a widely used method for sharing container server resources, providing system administrators with significant flexibility in building container operating system instances on demand. Container technology can improve the performance and resource efficiency issues of hypervisors, providing users with a more efficient way to utilize computing resources.

[0003] Combining container technology with distributed processing technology creates a container cluster. A container cluster can rely on one or more physical computers, each of which can run one or more containers, each capable of relatively independent execution. In a container cluster, each container is referred to as a node, indicating that it can process data relatively independently.

[0004] If the physical computer devices that make up the container cluster are located in different geographical locations, then there will inevitably be edge nodes located at the edge of the region in the container cluster. There may be network incompatibility issues between edge nodes, making it difficult to configure tasks on edge nodes. Summary of the Invention

[0005] In view of this, an embodiment of the present application provides a data processing method and apparatus, aiming to provide a technical solution that can efficiently deploy tasks on edge nodes.

[0006] In a first aspect, an embodiment of the present application provides a data processing method, which is applied to a distributed data processing system, wherein the distributed processing system includes a control unit and multiple nodes, wherein the multiple nodes include at least one edge node, including:

[0007] The control unit obtains a first task file, where the first task file is used to instruct the node to execute a target processing task;

[0008] The control unit determines whether the first task file includes a first tag, where the first tag indicates that the target task file is used to instruct the edge node to execute the target processing task;

[0009] In response to the first task file including the first tag, the control unit determines at least one target node according to the first task file, the target node belonging to the at least one edge node;

[0010] The control unit instructs the at least one target node to execute the target processing task.

[0011] Optionally, the at least one target node includes a first node, and the control unit instructing the at least one target node to perform the target processing task includes:

[0012] The control unit generates a second task file according to the first task file and information of the first node, wherein the second task file is used to instruct the first node to execute the target processing task;

[0013] The control unit creates a target processing task on the first node based on the second task file.

[0014] Optionally, before the control unit generates the second task file according to the first task file and the information of the first node, the method further includes:

[0015] The control unit parses the first task file to obtain second tag information;

[0016] The control unit determines the information of the first node according to the second label information.

[0017] Optionally, the information of the first node includes a rejection scheduling parameter of the first node, where the rejection scheduling parameter is used to instruct the first node to refuse to execute a task that does not have a tolerance parameter corresponding to the rejection scheduling parameter;

[0018] The control unit generating a second task file according to the first task file and information of the first node includes:

[0019] The control unit determines, according to the rejection scheduling parameter of the first node, a tolerance parameter corresponding to the rejection scheduling parameter;

[0020] The control unit generates a second task file according to the tolerance parameter corresponding to the rejection scheduling parameter and the first task file.

[0021] Optionally, the multiple nodes include a second node, and the method further includes:

[0022] The control unit obtains relevant information of the second node;

[0023] In response to the relevant information of the second node including the first tag, the control unit determines the second node as an edge node; or,

[0024] In response to the relevant information of the second node not including the first tag, the control unit determines the second node as a non-edge node.

[0025] Optionally, the distributed data processing system is implemented based on the Kubernetes engine.

[0026] Optionally, the method further includes:

[0027] In response to a third node joining the distributed data processing system, obtaining first location information of the third node;

[0028] In response to the geographic location information of the third node being the same as the geographic location information of the first node, and the third node being an edge node, the first label is added to the third node.

[0029] Optionally, the at least one target node further includes a third node, and the third node and the first node belong to a different region. The method further includes:

[0030] It is determined that the first task file has a function of being applied to a region corresponding to the first node and a region corresponding to the second node.

[0031] In a second aspect, an embodiment of the present application provides a data processing device, which is applied to a distributed data processing system, wherein the distributed processing system includes a control unit and multiple nodes, wherein the multiple nodes include at least one edge node; the device includes:

[0032] An acquisition module, configured to acquire a first task file, wherein the first task file is used to instruct a node to execute a target processing task;

[0033] a determination module, configured to determine whether the first task file includes a first tag, wherein the first tag indicates that the target task file is used to instruct the edge node to execute the target processing task;

[0034] a determining module, configured to determine at least one target node according to the first task file in response to the first task file including the first tag, the target node belonging to the at least one edge node;

[0035] The instruction module is used to instruct the at least one target node to execute the target processing task.

[0036] Optionally, the at least one target node includes a first node;

[0037] The instruction module is used to generate a second task file based on the first task file and the information of the first node, wherein the second task file is used to instruct the first node to execute the target processing task; and based on the second task file, create the target processing task on the first node.

[0038] Optionally, the device further includes a second determining module;

[0039] The second determination module is configured to parse the first task file to obtain second tag information; and determine the information of the first node according to the second tag information.

[0040] Optionally, the information of the first node includes a rejection scheduling parameter of the first node, where the rejection scheduling parameter is used to instruct the first node to refuse to execute a task that does not have a tolerance parameter corresponding to the rejection scheduling parameter;

[0041] The indication module is configured to determine a tolerance parameter corresponding to the rejection scheduling parameter according to the rejection scheduling parameter of the first node; and generate a second task file according to the tolerance parameter corresponding to the rejection scheduling parameter and the first task file.

[0042] Optionally, the plurality of nodes include a second node, and the apparatus further includes an adjustment module;

[0043] The adjustment module is configured to obtain relevant information of the second node; in response to the relevant information of the second node including the first tag, determine the second node as an edge node; or, in response to the relevant information of the second node not including the first tag, the control unit determines the second node as a non-edge node.

[0044] In a third aspect, an embodiment of the present application further provides a device comprising a memory and a processor, wherein the memory is used to store instructions, and the processor is used to run the instructions stored in the memory so that the device executes the data processing method described in the first aspect above.

[0045] In a fourth aspect, an embodiment of the present application further provides a computer-readable storage medium, wherein the computer-readable storage medium is used to store a computer program, and the computer program is used to control a computer to execute the data processing method described in the first aspect.

[0046] An embodiment of the present application provides a data processing method and device. For a distributed data processing system having at least one edge node and a control unit, after obtaining a first task file, the control unit can first determine whether the first task file includes a first tag. The first task file is used to indicate the execution of a target processing task, and the first tag indicates that the target task file is used to instruct the edge node to execute the target processing task. If the first task file includes the first tag, indicating that the first task file requires an edge node to execute, the control unit can determine at least one target node based on the first task file and instruct the at least one target node to execute the target processing task. The target node is the edge node indicated by the first task file, that is, the edge node that executes the target processing task. In this way, during the execution of the data processing task, the control unit can automatically analyze the task file and determine whether the task requires an edge node to execute based on the first tag. If the task requires an edge node to execute, the control unit can determine the task and control the edge node to execute it. In this way, unified distribution and scheduling of applications on edge nodes can be achieved by simply adjusting and modifying the tags. BRIEF DESCRIPTION OF THE DRAWINGS

[0047] In order to more clearly illustrate the technical solutions in this embodiment or the prior art, the following briefly introduces the drawings required for use in the embodiment or the prior art description. Obviously, the drawings described below are only some embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work.

[0048] Figure 1 A schematic diagram of an application scenario of the data processing method provided in an embodiment of the present application;

[0049] Figure 2 A flow chart of a data processing method provided in an embodiment of the present application;

[0050] Figure 3 A schematic diagram of the structure of a data processing device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0051] Container cluster technology has been widely adopted due to its flexibility and high resource utilization. For example, container engines such as Kubernetes (k8s) are written in Linux and offer comprehensive cluster management capabilities, powerful fault detection and self-repair capabilities, rolling service upgrades and online capacity expansion, scalable automatic resource scheduling mechanisms, and multi-granular resource quota management. K8s also provides comprehensive management tools covering all aspects of development, deployment testing, operations, and monitoring. Because containers are lighter than virtual machines, they can save storage space and simplify operations.

[0052] However, due to the limitations of physical computer installation locations, edge nodes inevitably appear in container clusters at different locations. These edge nodes often have distinct isolation properties, such as lack of network connectivity, resource non-sharing, heterogeneous resources, and independent applications. This makes communication between edge nodes and other nodes in the container cluster difficult.

[0053] In particular, for container clusters using engines like Kubernetes, edge nodes often lack independent user interfaces. Users must configure tasks for edge nodes through command lines or task files written in YAML (YAML Ain't a Markup Language). Consequently, when the number of edge nodes is large, users must manually maintain each node one by one, which is inefficient and labor-intensive.

[0054] To provide a technical solution for configuring edge nodes in a container cluster, the present invention provides a data processing method and apparatus. This is described in detail below with reference to the accompanying drawings. First, the application scenarios of the data processing method provided in the present invention are introduced.

[0055] See also Figure 1 , which is a schematic diagram of an application scenario of the data transfer method provided in an embodiment of the present application, including a control unit 110, a first node 121, a second node 122, a third node 123, and a fourth node 124. The control unit 110 is connected to the first node 121, the second node 122, the third node 123, and the fourth node 124, respectively. The first node 121 and the fourth node 124 are edge nodes and cannot communicate with each other.

[0056] The following is a combination of the accompanying drawings of the specification. Figure 1 The data migration method provided in the embodiment of the present application is described from the perspective of the control unit 110. It should be noted that the control unit can be a software program for managing a container cluster, which can run on one or more computers or servers. The computer equipment described in the embodiment of the present application includes both computers and servers or other physical devices with data processing functions. Obviously, the described embodiments are only part of the embodiments of the present application, not all of the embodiments. Based on the embodiments in this application, all other embodiments obtained by ordinary technicians in this field without making creative work are within the scope of protection of this application.

[0057] See also Figure 2 , Figure 2 The method flow chart of the data processing method provided in the embodiment of the present application includes:

[0058] S201: The control unit obtains a first task file.

[0059] Before executing a target processing task, the control unit can first obtain a first task file. This first task file is a description file corresponding to the target processing task and can be used to instruct nodes to execute the target processing task. For example, when a technician needs to create an application in a cluster, they can set the task file in the cluster's control unit. This allows the cluster to determine the relevant parameters of the target processing task and execute the target processing task based on the parameters.

[0060] It should be noted that the "first task file" described in the embodiments of the present application may not be a file in the traditional sense, but a parameter set related to the target processing task. That is, the first task file may be a parameter set composed of relevant parameters for processing the target processing task.

[0061] In distributed processing systems such as K8s, resource files such as the first task file can only be used by one container. In order to adapt to the use of nodes in different regions, a corresponding annotation can be added to the resource file, "edge.kubernetes.io / origin" = 'true'. This annotation indicates that the resource file is the source application of the edge, and the patch object is first defined in the resource file. Each patch object has two sub-objects, which are the identifiers in the edge node and the object parameter identifiers that need to be patched. In other words, if the first task file supports the use of different nodes in different regions, the control unit can send the first task file to multiple nodes in different regions.

[0062] S202: The control unit determines whether the first task file includes a first tag.

[0063] After obtaining the first task file, the control unit may determine whether the first task file includes the first tag. Optionally, if the cluster is created based on the K8s engine, the tag may refer to an attribute used to identify a resource and may be represented as a key-value pair. In other words, the tag may be represented as a "key=value" pair.

[0064] In the embodiment of the present application, the first tag is a tag that identifies that the target processing task needs to be executed by an edge node in the cluster. In other words, if the file corresponding to the task has the first tag, it means that the execution of the task needs to be executed by an edge node in the cluster.

[0065] In one possible implementation, the first tag can be represented as "edge.kubernetes.io / origin='true'," indicating that files with the first tag must be executed by edge nodes. Accordingly, to enable edge nodes to execute the target processing task, technicians can add the first tag to the first task file corresponding to the target processing task. This will cause the cluster's target unit to adopt the corresponding processing flow, allowing the edge nodes in the cluster to execute the target processing task.

[0066] If the first task file does not include the first tag, indicating that the target processing task does not require execution by an edge node in the cluster, the control unit may control the node to execute the target processing task according to the traditional processing flow. If the first task file includes the first tag, indicating that the target processing task requires execution by an edge node in the cluster, the control unit may proceed to the subsequent step S203.

[0067] S203: In response to the first task file including the first tag, the control unit determines at least one target node according to the first task file.

[0068] After determining that the first task file includes the first tag, the control unit can determine at least one target node based on the first task file. The target node is a node among the edge nodes that needs to execute the target processing task. That is, in some possible implementations, even if the first task file includes the first tag, the first task file may only need to be executed by some edge nodes, not all edge nodes. Therefore, the control unit can determine at least one target node that needs to execute the target processing task based on the first task file. Optionally, the at least one target node may also include all edge nodes, that is, the target processing task can be executed by all edge nodes.

[0069] Optionally, the control unit determines at least one target node based on a tag included in the first task file. Specifically, if the first task file includes the tag "'edge.kubernetes.io / origin'="true", the control unit may parse the first task file, find the tag "edge.kubernetes.io / pool" included in the first task file, and determine the target node based on a value corresponding to the tag.

[0070] For example, the first task file may include the tag "'edge.kubernetes.io / pool'='A,B'". Based on this tag, the control unit can determine that the target processing task needs to be executed by nodes in two node pools, node pool A and node pool B. In this way, the control unit can determine the nodes in node pool A and node pool B as target nodes. Node pool A and node pool B can be obtained by pre-dividing edge nodes, for example, by dividing edge nodes according to their geographical locations.

[0071] S204: The control unit instructs at least one target node to execute a target processing task.

[0072] After determining at least one target node, the control unit may instruct each of the at least one target node to execute the target processing task. Detailed description is given below using the example that the at least one target node includes the first node.

[0073] Specifically, the control unit can generate a second task file based on the first task file and information about the first node. This second task file is required for edge nodes in the region described by the first node to execute the target processing task. The control unit can then create the target processing task on the first node based on the second task file. In this way, the first task file can be adjusted based on the region to which the first node belongs, so that the resulting second task file is better adapted to the conditions in the region to which the first node belongs, thereby creating the corresponding task on the first node.

[0074] In some possible implementations, the first node information may be obtained by the control unit by parsing the first task file. Specifically, the control unit may parse the first task file to obtain second label information, and then determine the first node information based on the second label information. Optionally, the second label information may be obtained based on the aforementioned label "edge.kubernetes.io / pool", for example, information about node pool A and node pool B.

[0075] In some possible implementations, a rejection scheduling parameter (Taints) can be set for the first node, and the rejection scheduling parameter is used to instruct the first node to refuse to execute the corresponding task. In this way, when receiving a task file corresponding to a task, the first node can determine whether the task file includes a tolerance parameter corresponding to the rejection scheduling parameter. If the task file includes the tolerance parameter, the first node can execute the task corresponding to the task file. If the task file does not include the tolerance parameter, the first node can refuse to execute the task corresponding to the task file.

[0076] To enable the first node to execute the target processing task, the information about the first node may further include a rejection scheduling parameter for the first node. During the generation of the second task file, the control unit may determine a tolerance parameter corresponding to the first node based on the rejection scheduling parameter for the first node, thereby generating a corresponding second task file based on the tolerance parameter and the first task file.

[0077] An embodiment of the present application provides a data processing method. For a distributed data processing system having at least one edge node and a control unit, after obtaining a first task file, the control unit can first determine whether the first task file includes a first tag. The first task file is used to indicate the execution of a target processing task, and the first tag indicates that the target task file is used to instruct the edge node to execute the target processing task. If the first task file includes the first tag, it means that the first task file needs to be executed by an edge node. Then, the control unit can determine at least one target node based on the first task file and instruct the at least one target node to execute the target processing task. The target node is the edge node indicated by the first task file, that is, the edge node that executes the target processing task. In this way, during the execution of the data processing task, the control unit can automatically analyze the task file and determine whether the task needs to be executed by an edge node through the first tag. If the task needs to be executed by an edge node, the control unit can determine the task and control the edge node to execute it. In this way, unified distribution and scheduling of applications on edge nodes can be achieved by simply adjusting and modifying the tags.

[0078] According to the previous introduction, the control unit can pre-divide the edge nodes in the cluster into node pools. Specifically, the control unit can add a label to each node in the cluster. The label can be, for example, the label "topology.kubernetes.io / pool", which indicates the node pool to which the node belongs. In addition, the control unit can also monitor changes in the attributes of the node and determine whether the node joins certain existing node values. In other words, the control unit can add nodes with the same value corresponding to the label "topology.kubernetes.io / pool" to the same node pool. In this way, technicians only need to add labels to the edge nodes in the cluster to achieve automatic classification of labels. Optionally, technicians can also modify the labels of the nodes through the control unit to transfer nodes from one node pool to other node pools.

[0079] In some possible implementations, the control unit can manage edge nodes based on their regions. Specifically, when a new edge node joins the distributed data processing system, the control unit can add the edge node to a corresponding edge node pool based on the edge node's region information. Each edge node pool includes one or more edge nodes with matching region information.

[0080] The above are some specific implementations of the data processing method provided in the embodiments of the present application. Based on this, the present application also provides a corresponding device. The device provided in the embodiments of the present application will be introduced from the perspective of functional modularization.

[0081] See also Figure 3 The structural diagram of the data processing device shown in FIG. 3 is a diagram of a data processing device, wherein the device 300 is applied to a distributed data processing system, wherein the distributed processing system includes a control unit and multiple nodes, wherein the multiple nodes include at least one edge node; the device 300 includes:

[0082] An acquisition module 310 is configured to acquire a first task file, where the first task file is used to instruct a node to execute a target processing task;

[0083] A determination module 320 is configured to determine whether the first task file includes a first tag, where the first tag indicates that the target task file is used to instruct the edge node to execute the target processing task;

[0084] a determining module 330 configured to determine, in response to the first task file including the first tag, at least one target node according to the first task file, the target node belonging to the at least one edge node;

[0085] The instructing module 340 is configured to instruct the at least one target node to execute the target processing task.

[0086] An embodiment of the present application provides a data processing device. For a distributed data processing system having at least one edge node and a control unit, after obtaining a first task file, the control unit can first determine whether the first task file includes a first tag. The first task file is used to indicate the execution of a target processing task, and the first tag indicates that the target task file is used to instruct the edge node to execute the target processing task. If the first task file includes the first tag, indicating that the first task file requires an edge node to execute, the control unit can determine at least one target node based on the first task file and instruct the at least one target node to execute the target processing task. The target node is the edge node indicated by the first task file, that is, the edge node that executes the target processing task. In this way, during the execution of the data processing task, the control unit can automatically analyze the task file and determine whether the task requires an edge node to execute based on the first tag. If the task requires an edge node to execute, the control unit can determine the task and control the edge node to execute it. In this way, unified distribution and scheduling of applications on edge nodes can be achieved by simply adjusting and modifying the tags.

[0087] Optionally, in some possible implementations, the at least one target node includes a first node; the indication module 340 is used to generate a second task file based on the first task file and information of the first node, and the second task file is used to instruct the first node to perform the target processing task; based on the second task file, a target processing task is created on the first node.

[0088] Optionally, in some possible implementations, the apparatus 300 further includes a second determination module; the second determination module is configured to parse the first task file to obtain second label information; and determine information of the first node based on the second label information.

[0089] Optionally, in some possible implementations, the information of the first node includes a rejection scheduling parameter of the first node, and the rejection scheduling parameter is used to instruct the first node to refuse to execute a task that does not have a tolerance parameter corresponding to the rejection scheduling parameter; the indication module 340 is used to determine the tolerance parameter corresponding to the rejection scheduling parameter based on the rejection scheduling parameter of the first node; and generate a second task file based on the tolerance parameter corresponding to the rejection scheduling parameter and the first task file.

[0090] Optionally, in some possible implementations, the multiple nodes include a second node, and the device 400 further includes an adjustment module; the adjustment module is used to obtain relevant information of the second node; in response to the relevant information of the second node including the first tag, the second node is determined as an edge node; or, in response to the relevant information of the second node not including the first tag, the control unit determines the second node as a non-edge node.

[0091] In addition, the embodiments of the present application also provide corresponding devices and computer storage media for implementing the data processing method described in any embodiment of the present application.

[0092] The "first" and "second" in the names of "first label" and "second label" mentioned in the embodiments of the present application are only used as name identifications and do not represent the first and second in order.

[0093] Through the description of the above embodiments, it can be known that those skilled in the art can clearly understand that all or part of the steps in the above embodiment methods can be implemented by means of software plus a general hardware platform. Based on this understanding, the technical solution of the present application can be embodied in the form of a software product, which can be stored in a storage medium, such as a read-only memory (ROM) / RAM, a magnetic disk, an optical disk, etc., and includes a number of instructions for enabling a computer device (which can be a personal computer, a server, or a network communication device such as a router) to execute the methods described in each embodiment or certain parts of the embodiments of the present application.

[0094] Each embodiment in this specification is described in a progressive manner. The same or similar parts between the embodiments can be referred to each other. Each embodiment focuses on the differences from other embodiments. In particular, for the device embodiment, since it is basically similar to the method embodiment, the description is relatively simple. For the relevant parts, refer to the partial description of the method embodiment. Some or all of the modules can be selected according to actual needs to achieve the purpose of the embodiment. Those of ordinary skill in the art can understand and implement it without paying any creative work.

[0095] The above description is merely an exemplary embodiment of the present application and is not intended to limit the scope of protection of the present application.

Claims

1. A data processing method, characterized in that: The method is applied to a distributed data processing system, the distributed processing system including a control unit and a plurality of nodes, the plurality of nodes including at least one edge node, including: The control unit obtains a first task file, where the first task file is used to instruct the node to execute a target processing task; The control unit determines whether the first task file includes a first tag, where the first tag indicates that the first task file is used to instruct the edge node to execute the target processing task; In response to the first task file including the first tag, the control unit determines at least one target node according to the first task file, the target node being an edge node; The control unit instructs the at least one target node to execute the target processing task.

2. The method according to claim 1, characterized in that The at least one target node includes a first node, and the control unit instructing the at least one target node to perform the target processing task includes: The control unit generates a second task file according to the first task file and information of the first node, wherein the second task file is used to instruct the first node to execute the target processing task; The control unit creates a target processing task on the first node based on the second task file.

3. The method according to claim 2, characterized in that Before the control unit generates the second task file according to the first task file and the information of the first node, the method further includes: The control unit parses the first task file to obtain second tag information; The control unit determines the information of the first node according to the second label information.

4. The method according to claim 3, characterized in that The information of the first node includes a rejection scheduling parameter of the first node, where the rejection scheduling parameter is used to instruct the first node to refuse to execute a task that does not have a tolerance parameter corresponding to the rejection scheduling parameter; The control unit generating a second task file according to the first task file and information of the first node includes: The control unit determines, according to the rejection scheduling parameter of the first node, a tolerance parameter corresponding to the rejection scheduling parameter; The control unit generates a second task file according to the tolerance parameter corresponding to the rejection scheduling parameter and the first task file.

5. The method according to any one of claims 2 to 4, characterized in that: The plurality of nodes includes a second node, the method further comprising: The control unit obtains relevant information of the second node; In response to the relevant information of the second node including the first tag, the control unit determines the second node as an edge node; or, In response to the relevant information of the second node not including the first tag, the control unit determines the second node as a non-edge node.

6. The method according to claim 2, characterized in that The method further comprises: In response to a third node joining the distributed data processing system, obtaining first location information of the third node; In response to the geographic location information of the third node being the same as the geographic location information of the first node, and the third node being an edge node, the first label is added to the third node.

7. The method according to claim 5, characterized in that The at least one target node further includes a third node, and the third node and the first node belong to a different region. The method further includes: It is determined that the first task file has a function of being applied to a region corresponding to the first node and a region corresponding to the second node.

8. A data processing device, characterized in that: The device is applied to a distributed data processing system, the distributed processing system including a control unit and multiple nodes, the multiple nodes including at least one edge node; the device includes: An acquisition module, configured to acquire a first task file, wherein the first task file is used to instruct a node to execute a target processing task; a determination module, configured to determine whether the first task file includes a first tag, where the first tag indicates that the first task file is used to instruct the edge node to execute the target processing task; a determining module, configured to determine at least one target node according to the first task file in response to the first task file including the first tag, the target node belonging to the at least one edge node; The instruction module is used to instruct the at least one target node to execute the target processing task.

9. A device, characterized in that The device comprises a memory and a processor, The memory is used to store instructions; The processor is configured to execute the instructions stored in the memory, so that the device executes the data processing method according to any one of claims 1 to 6.

10. A computer-readable storage medium, characterized in that The computer-readable storage mechanism is used to store a computer program, and the computer program is used to control a computer to execute the data processing method according to any one of claims 1 to 6.

Images