CN112769961B - Node processing method and device of network system - Google Patents
Node processing method and device of network system Download PDFInfo
- Publication number
- CN112769961B CN112769961B CN202110265135.0A CN202110265135A CN112769961B CN 112769961 B CN112769961 B CN 112769961B CN 202110265135 A CN202110265135 A CN 202110265135A CN 112769961 B CN112769961 B CN 112769961B
- Authority
- CN
- China
- Prior art keywords
- node
- time
- nodes
- task
- task information
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1001—Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/60—Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources
- H04L67/62—Establishing a time schedule for servicing the requests
Abstract
The invention discloses a node processing method and device of a network system. Wherein, the method comprises the following steps: acquiring self-timing first time of a target node of a network system executing a historical task; communicating with a target node through a server of a network system, and acquiring second time for the server to communicate with the target node; acquiring task information of a historical task executed by a target node; according to the task information, multiplying the number of nodes before the target node by the second time and adding the first time to obtain the actual time of the target node for executing the historical task; and updating the target execution time corresponding to the node in the task information according to the real time. The invention solves the technical problem that the time in the historical task information of the nodes of the network system in the prior art is not accurate enough.
Description
Technical Field
The present invention relates to the field of network systems, and in particular, to a node processing method and apparatus for a network system.
Background
The nodes in the network system execute the tasks according to the execution sequence of the tasks indicated by the server, and when the tasks are executed, each node finishes executing the tasks to generate corresponding task information and sends the task information to the server, and the server records and stores the task information. However, the communication between the node and the server may cause the subsequent node to deviate the task execution time, so that the time in the task information is not accurate enough.
In view of the above problems, no effective solution has been proposed.
Disclosure of Invention
The embodiment of the invention provides a node processing method and device of a network system, which are used for at least solving the technical problem that the time in the historical task information of the nodes of the network system in the prior art is not accurate enough.
According to an aspect of an embodiment of the present invention, a node processing method of a network system is provided, including: acquiring self-timing first time of a target node of a network system executing a historical task, wherein the target node autonomously performs timing after being established in the network system and generates the first time, and the target node is any one of a plurality of nodes executing the historical task in the network system; communicating with the target node through a server of the network system, and acquiring a second time used by the server for communicating with the target node; the server is used for establishing a communication link with the target node, performing communication, and timing the communication of the target node to generate the second time; acquiring task information of a historical task executed by the target node, wherein the task information comprises all nodes and execution time of each node when the network system executes the historical task; according to the task information, multiplying the number of nodes before the target node by the second time and adding the first time to obtain the real time of the target node for executing the historical task, wherein the target node is a newly-built node for executing the historical task, and the execution of the historical task in the network system and the establishment of the nodes are carried out simultaneously; and updating the target execution time corresponding to the node in the task information according to the real time.
Optionally, the acquiring the first time counted by the node itself further includes: determining the execution time of the node executing the historical task according to the time acquired from the server when the node is established in the network system and the self-timing time when the node executes the historical task; and writing the execution time and the corresponding node into the task information.
Optionally, after updating the target execution time corresponding to the node in the task information according to the real time, the method further includes: determining the time error of the node according to the real time of the node and the target execution time corresponding to the node; determining the real time of the rest nodes in the task information according to the error and the execution time corresponding to the rest nodes in the task information; and updating the execution time corresponding to the other nodes in the task information according to the real time of the other nodes.
Optionally, after updating the target execution time corresponding to the node in the task information according to the real time, the method further includes: selecting the updated execution time of two adjacent nodes in the task information; comparing whether the execution time of the two nodes is correct or not according to the sequence of the two nodes executing the historical tasks; and outputting the task information under the condition that the execution time of any two adjacent nodes in the task information is correct.
Optionally, comparing whether the execution time of the two nodes is correct according to the sequence of the two nodes executing the historical task includes: acquiring the execution time of a node which executes the historical task first and the process time of executing the historical task in two adjacent nodes, and determining the execution end time of the node which executes the historical task first; subtracting the execution ending time of the node which executes the historical task first from the execution time of the node which executes the historical task later to obtain a time interval; determining that the execution time of the two adjacent nodes is correct under the condition that the time interval is positive; and determining that the execution time of the two adjacent nodes is wrong under the condition that the time interval is negative.
Optionally, after determining that the execution time of the two adjacent nodes is correct when the time interval is positive, the method further includes: selecting the execution time of the other two adjacent nodes in the task information in a random extraction mode; under the condition that the execution time of the other two adjacent nodes is correct, other nodes in the task information are continuously and randomly extracted for verification; and determining that the execution time of any two adjacent nodes in the task information is correct until the execution time of all the nodes in the task information passes verification.
Optionally, in a case that the time interval is negative, after determining that the execution time of the two adjacent nodes is incorrect, the method further includes: selecting a node for executing the historical task from the two adjacent nodes with the negative time interval as an updating node; and updating the target execution time corresponding to the node in the task information according to the updating node, the first time of self timing of the updating node and the second time of communication between the server and the updating node.
According to another aspect of the embodiments of the present invention, there is provided a node processing apparatus of a network system, including: the system comprises a first acquisition module, a first processing module and a second processing module, wherein the first acquisition module is used for acquiring self-timing first time of a target node of a historical task executed by a network system, the target node is established in the network system and then autonomously performs timing and generates the first time, and the target node is any one of a plurality of nodes of the historical task executed in the network system; the communication module is used for communicating with the target node through a server of the network system and acquiring second time used by the server for communicating with the target node; the server is used for establishing a communication link with the target node, performing communication, and timing the communication of the target node to generate the second time; a second obtaining module, configured to obtain task information of a historical task executed by the target node, where the task information includes execution times of all nodes and each node when the network system executes the historical task; the computing module is configured to obtain, according to the task information, the actual time for the target node to execute the historical task by multiplying the number of nodes before the target node by the second time and adding the first time, where the target node is a newly-established node for executing the historical task, and the execution of the historical task in the network system and the establishment of the nodes are performed simultaneously; and the updating module is used for updating the target execution time corresponding to the node in the task information according to the real time.
According to another aspect of the embodiments of the present invention, there is provided a computer storage medium storing program instructions, wherein when the program instructions are executed, the apparatus on which the computer storage medium is located is controlled to execute any one of the methods described above.
According to another aspect of the embodiments of the present invention, there is provided a processor for executing a program, wherein the program executes to perform the method of any one of the above.
In the embodiment of the invention, the first time of self timing of a target node for executing a historical task by a network system is acquired, wherein the target node is set up in the network system and then is automatically timed to generate the first time, and the target node is any one of a plurality of nodes for executing the historical task in the network system; communicating with a target node through a server of a network system, and acquiring second time for the server to communicate with the target node; the server is used for establishing a communication link with the target node, carrying out communication and timing the communication of the target node to generate second time; acquiring task information of a historical task executed by a target node, wherein the task information comprises all nodes and execution time of each node when a network system executes the historical task; according to the task information, multiplying the number of nodes before the target node by the second time and adding the first time to obtain the actual time for the target node to execute the historical task, wherein the target node is a newly-built node for executing the historical task, and the execution of the historical task in the network system and the establishment of the nodes are carried out simultaneously; according to the method for updating the target execution time corresponding to the node in the task information according to the real time, the purpose of effectively correcting the execution time of the node in the task information is achieved, the technical effect of improving the accuracy of the execution time of the node of the task information of the network system is achieved, and the technical problem that the time in the historical task information of the node of the network system in the prior art is not accurate enough is solved.
Drawings
The accompanying drawings, which are included to provide a further understanding of the invention and are incorporated in and constitute a part of this application, illustrate embodiment(s) of the invention and together with the description serve to explain the invention without limiting the invention. In the drawings:
fig. 1 is a flowchart of a node processing method of a network system according to an embodiment of the present invention;
fig. 2 is a schematic diagram of a node processing apparatus of a network system according to an embodiment of the present invention.
Detailed Description
In order to make the technical solutions of the present invention better understood, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
It should be noted that the terms "first," "second," and the like in the description and claims of the present invention and in the drawings described above are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used is interchangeable under appropriate circumstances such that the embodiments of the invention described herein are capable of operation in sequences other than those illustrated or described herein. Furthermore, the terms "comprises," "comprising," and "having," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed, but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.
In accordance with an embodiment of the present invention, there is provided an embodiment of a node processing method for a network system, it should be noted that the steps illustrated in the flowchart of the drawings may be performed in a computer system such as a set of computer executable instructions, and that while a logical order is illustrated in the flowchart, in some cases the steps illustrated or described may be performed in an order different than that herein.
Fig. 1 is a flowchart of a node processing method of a network system according to an embodiment of the present invention, as shown in fig. 1, the method includes the following steps:
step S102, acquiring self-timing first time of a target node of a historical task executed by a network system, wherein the target node autonomously performs timing after being established in the network system and generates the first time, and the target node is any one of a plurality of nodes of the historical task executed in the network system;
step S104, communicating with the target node through a server of the network system, and acquiring a second time for the server to communicate with the target node; the server is used for establishing a communication link with the target node, carrying out communication and timing the communication of the target node to generate second time;
step S106, acquiring task information of a historical task executed by a target node, wherein the task information comprises all nodes and execution time of each node when a network system executes the historical task;
step S108, according to the number of nodes before the target node in the task information, multiplying the number by the second time and adding the first time to obtain the real time of the target node for executing the historical task, wherein the target node is a newly-built node for executing the historical task, and the execution of the historical task in the network system and the establishment of the node are carried out simultaneously;
and step S110, updating the target execution time corresponding to the node in the task information according to the real time.
Through the steps, the self-timing first time of the target node of the network system for executing the historical task is acquired, wherein the target node is set up in the network system and then is automatically timed to generate the first time, and the target node is any one of a plurality of nodes for executing the historical task in the network system; communicating with a target node through a server of a network system, and acquiring second time for the server to communicate with the target node; the server is used for establishing a communication link with the target node, carrying out communication and timing the communication of the target node to generate second time; acquiring task information of a historical task executed by a target node, wherein the task information comprises all nodes and execution time of each node when a network system executes the historical task; according to the task information, multiplying the number of nodes before the target node by the second time and adding the first time to obtain the actual time for the target node to execute the historical task, wherein the target node is a newly-built node for executing the historical task, and the execution of the historical task in the network system and the establishment of the nodes are carried out simultaneously; according to the method for updating the target execution time corresponding to the node in the task information according to the real time, the purpose of effectively correcting the execution time of the node in the task information is achieved, the technical effect of improving the accuracy of the execution time of the node of the task information of the network system is achieved, and the technical problem that the time in the historical task information of the node of the network system in the prior art is not accurate enough is solved.
The network system may be a distributed network system, and the nodes may be nodes of different levels in the distributed network system. The node can perform self-timing after being established through an internal or external timer. The target node is a node newly established by the network system for executing the historical task, and the time counted by the node from the brief calendar is the same as the time of the network system for executing the historical task. Therefore, according to the first time timed by the node, the time interval of the plurality of nodes in the historical task execution can be considered, and the real time of the node in the historical task execution can be determined. And further, the task information of the historical task is corrected, and the time accuracy of the nodes in the task information is improved.
Specifically, the execution of the node to the task is controlled by the server, and the node needs to communicate with the server after executing the task each time so as to record the execution process of the node to the task, so that the server can conveniently record and monitor the execution process of the task. Where the latency of the communication between the node and the server is stored.
The method comprises the steps that communication is carried out between a server of a network system and a target node, and second time used for the server to communicate with the target node is obtained; the server is used for establishing a communication link with the target node, carrying out communication and timing the communication of the target node to generate second time. The execution time of the historical task executed by the node can be corrected through the second time, and the accuracy of the time of the node in the task information is improved.
Acquiring task information of a historical task executed by a target node, wherein the task information comprises all nodes and execution time of each node when a network system executes the historical task; therefore, the execution time is updated according to the first time and the second time so as to improve the accuracy of the time of the nodes in the task information.
Specifically, according to the number of nodes before the target node in the task information, multiplying the second time by the first time to obtain the actual time for the target node to execute the historical task, wherein the target node is a newly-built node for executing the historical task, and the execution of the historical task in the network system and the establishment of the nodes are performed simultaneously; and updating the target execution time corresponding to the node in the task information according to the real time.
The purpose of effectively correcting the execution time of the nodes in the task information is achieved, the technical effect of improving the accuracy of the execution time of the nodes in the task information of the network system is achieved, and the technical problem that the time in the historical task information of the nodes in the network system is not accurate enough in the prior art is solved.
Optionally, the acquiring the first time counted by the node itself further includes: determining the execution time of the nodes for executing the historical tasks according to the time acquired from the server when the nodes are established in the network system and the self-timing time when the nodes execute the historical tasks; and writing the execution time and the corresponding node into the task information.
That is, when the node of the network system executes the historical task, the execution time in the task information is generated by the time acquired by the server, that is, the server time, in combination with the self-timed time.
Optionally, after updating the target execution time corresponding to the node in the task information according to the real time, the method further includes: determining the time error of the node according to the real time of the node and the target execution time corresponding to the node; determining the real time of the rest nodes in the task information according to the error and the corresponding execution time of the rest nodes in the task information; and updating the execution time corresponding to the other nodes in the task information according to the real time of the other nodes.
The real time of the rest nodes can be deduced through the real time of a target node in the network system and the execution time error in the task information. Specifically, the real time of the other nodes can be determined by combining the second time through the difference between the execution times of the task information of the target node and the other nodes and the difference between the target node and the other nodes in the task execution sequence.
And updating the execution time corresponding to the node in the task information according to the real time of the rest nodes, thereby saving the complicated step of correcting each node, and avoiding the problem that the corresponding execution time in the task information is difficult to correct by some nodes which are established before executing the task.
Optionally, after updating the target execution time corresponding to the node in the task information according to the real time, the method further includes: selecting updated execution time of two adjacent nodes in the task information; comparing whether the execution time of the two nodes is correct or not according to the sequence of the two nodes executing the historical tasks; and outputting the task information when the execution time of any two adjacent nodes in the task information is correct.
After the execution time of the nodes in the task information is updated, the updated execution time is verified, so that the time accuracy of the nodes in the task information is further improved, and the problem of correction errors caused by operation errors is effectively solved.
Optionally, comparing whether the execution time of the two nodes is correct according to the sequence of the two nodes executing the historical tasks includes: acquiring the execution time of a node which executes the historical task first and the process time of executing the historical task in two adjacent nodes, and determining the execution end time of the node which executes the historical task first; subtracting the execution ending time of the node which executes the historical task first from the execution time of the node which executes the historical task later to obtain a time interval; under the condition that the time interval is positive, determining that the execution time of two adjacent nodes is correct; in the case where the time interval is negative, it is determined that the execution time of the adjacent two nodes is erroneous.
The execution time of the nodes executing the historical tasks is verified by utilizing the sequence of the nodes executing the historical tasks, and the reasonability and the accuracy of the execution time are ensured.
Optionally, after determining that the execution time of the two adjacent nodes is correct when the time interval is positive, the method further includes: selecting the execution time of the other two adjacent nodes in the task information in a random extraction mode; under the condition that the execution time of the other two adjacent nodes is correct, other nodes in the task information are continuously and randomly extracted for verification; and determining that the execution time of any two adjacent nodes in the task information is correct until the execution time of all the nodes in the task information passes verification.
All nodes in the task information are traversed and verified in a random extraction mode, and the accuracy of the execution time of the nodes in the task information is effectively guaranteed.
It should be noted that, when two adjacent nodes are randomly selected, partial node drop may be caused, that is, the adjacent previous node is already verified, and the adjacent subsequent node is also already verified, and at this time, the adjacent verified node and the node of the un-verified drop may be randomly selected to form two adjacent nodes for verification. The problem that partial node drop lists are difficult to verify is solved, and the problem that the time accuracy of the nodes of the task information is not high enough due to the node drop lists is solved.
Optionally, in a case that the time interval is negative, after determining that the execution time of the two adjacent nodes is incorrect, the method further includes: selecting a node which executes a historical task from two adjacent nodes with a negative time interval as an updating node; and updating the target execution time corresponding to the node in the task information according to the updating node and through the first time of self timing of the updating node and the second time of communication between the server and the updating node.
For the node which does not pass the verification, the node can be corrected again in the manner of only S110 in the step S102, so that the problem of low time accuracy of the node in the task information due to failure of the verification is avoided.
Fig. 2 is a schematic structural diagram of an apparatus for controlling a temperature of a refrigerator according to an embodiment of the present invention, and as shown in fig. 2, according to another aspect of an embodiment of the present invention, there is provided a node processing apparatus of a network system, including: a first acquisition module 20, a communication module 22, a second acquisition module 24, a calculation module 26, and an update module 28. The apparatus is described in detail below.
The first obtaining module 20 is configured to obtain a first time of self-timing of a target node of a network system executing a historical task, where the target node performs self-timing after being established in the network system, and generates the first time, and the target node is any one of a plurality of nodes of the network system executing the historical task; the communication module 22 is configured to communicate with the target node through a server of the network system, and acquire a second time used by the server to communicate with the target node; the server is used for establishing a communication link with the target node, carrying out communication and timing the communication of the target node to generate second time; the second obtaining module 24 is configured to obtain task information of a historical task executed by a target node, where the task information includes all nodes and execution time of each node when the network system executes the historical task; the calculation module 26 is configured to obtain the actual time for the target node to execute the historical task according to the number of nodes before the target node in the task information, which is multiplied by the second time, plus the first time, where the target node is a newly-established node for executing the historical task, and the execution of the historical task in the network system and the establishment of the node are performed simultaneously; and the updating module 28 is configured to update the target execution time corresponding to the node in the task information according to the real time.
By the device, the self-timing first time of the target node for executing the historical task by the network system is acquired, wherein the target node is set up in the network system and then is automatically timed to generate the first time, and the target node is any one of a plurality of nodes for executing the historical task in the network system; communicating with a target node through a server of a network system, and acquiring second time for the server to communicate with the target node; the server is used for establishing a communication link with the target node, carrying out communication and timing the communication of the target node to generate second time; acquiring task information of a historical task executed by a target node, wherein the task information comprises all nodes and execution time of each node when a network system executes the historical task; according to the task information, multiplying the number of nodes before the target node by the second time and adding the first time to obtain the actual time for the target node to execute the historical task, wherein the target node is a newly-built node for executing the historical task, and the execution of the historical task in the network system and the establishment of the nodes are carried out simultaneously; according to the method for updating the target execution time corresponding to the node in the task information according to the real time, the purpose of effectively correcting the execution time of the node in the task information is achieved, the technical effect of improving the accuracy of the execution time of the node of the task information of the network system is achieved, and the technical problem that the time in the historical task information of the node of the network system in the prior art is not accurate enough is solved.
According to another aspect of the embodiments of the present invention, there is provided a computer storage medium storing program instructions, wherein when the program instructions are executed, the apparatus in which the computer storage medium is located is controlled to perform the method of any one of the above.
According to another aspect of the embodiments of the present invention, there is provided a processor for executing a program, wherein the program executes to perform the method of any one of the above.
The above-mentioned serial numbers of the embodiments of the present invention are merely for description and do not represent the merits of the embodiments.
In the above embodiments of the present invention, the descriptions of the respective embodiments have respective emphasis, and for parts that are not described in detail in a certain embodiment, reference may be made to related descriptions of other embodiments.
In the embodiments provided in the present application, it should be understood that the disclosed technology can be implemented in other ways. The above-described embodiments of the apparatus are merely illustrative, and for example, the division of the units may be a logical division, and in actual implementation, there may be another division, for example, multiple units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, units or modules, and may be in an electrical or other form.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, functional units in the embodiments of the present invention may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.
The integrated unit, if implemented in the form of a software functional unit and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present invention may be embodied in the form of a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: a U-disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a removable hard disk, a magnetic or optical disk, and other various media capable of storing program codes.
The foregoing is only a preferred embodiment of the present invention, and it should be noted that, for those skilled in the art, various modifications and decorations can be made without departing from the principle of the present invention, and these modifications and decorations should also be regarded as the protection scope of the present invention.
Claims (5)
1. A node processing method of a network system, comprising:
acquiring self-timing first time of a target node of a network system executing a historical task, wherein the target node autonomously performs timing after being established in the network system and generates the first time, and the target node is any one of a plurality of nodes executing the historical task in the network system;
communicating with the target node through a server of the network system, and acquiring a second time used by the server for communicating with the target node; the server is used for establishing a communication link with the target node, performing communication, and timing the communication of the target node to generate the second time;
acquiring task information of a historical task executed by the target node, wherein the task information comprises all nodes and execution time of each node when the network system executes the historical task;
according to the task information, multiplying the number of nodes before the target node by the second time and adding the first time to obtain the real time of the target node for executing the historical task, wherein the target node is a newly-built node for executing the historical task, and the execution of the historical task in the network system and the establishment of the nodes are carried out simultaneously;
updating the target execution time corresponding to the node in the task information according to the real time;
the method for acquiring the first time timed by the node comprises the following steps: determining the execution time of the node executing the historical task according to the time acquired from the server when the node is established in the network system and the self-timing time when the node executes the historical task;
writing the execution time and the corresponding node into the task information;
after the target execution time corresponding to the node in the task information is updated according to the real time, the method further includes: determining the time error of the node according to the real time of the node and the target execution time corresponding to the node;
determining the real time of the rest nodes in the task information according to the error and the execution time corresponding to the rest nodes in the task information;
and updating the execution time corresponding to the other nodes in the task information according to the real time of the other nodes.
2. The method according to claim 1, further comprising, after updating the target execution time corresponding to the node in the task information according to the real time: selecting the updated execution time of two adjacent nodes in the task information;
comparing whether the execution time of the two nodes is correct or not according to the sequence of the two nodes executing the historical tasks;
and outputting the task information under the condition that the execution time of any two adjacent nodes in the task information is correct.
3. The method of claim 1, wherein comparing whether the execution time of the two nodes is correct according to the sequence of the two nodes executing the historical tasks comprises: acquiring the execution time of a node which executes the historical task first and the process time of executing the historical task in two adjacent nodes, and determining the execution end time of the node which executes the historical task first;
subtracting the execution ending time of the node which executes the historical task first from the execution time of the node which executes the historical task later to obtain a time interval;
determining that the execution time of the two adjacent nodes is correct under the condition that the time interval is positive;
and determining that the execution time of the two adjacent nodes is wrong under the condition that the time interval is negative.
4. The method of claim 3, wherein after determining that the execution time of the two adjacent nodes is correct if the time interval is positive, further comprising: selecting the execution time of the other two adjacent nodes in the task information in a random extraction mode;
under the condition that the execution time of the other two adjacent nodes is correct, other nodes in the task information are continuously and randomly extracted for verification;
and determining that the execution time of any two adjacent nodes in the task information is correct until the execution time of all the nodes in the task information passes verification.
5. The method of claim 3, wherein after determining that the execution time of the two adjacent nodes is incorrect if the time interval is negative, the method further comprises: selecting a node for executing the historical task from the two adjacent nodes with the negative time interval as an updating node;
and updating the target execution time corresponding to the node in the task information according to the updating node, the first time of self timing of the updating node and the second time of communication between the server and the updating node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110265135.0A CN112769961B (en) | 2021-03-11 | 2021-03-11 | Node processing method and device of network system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110265135.0A CN112769961B (en) | 2021-03-11 | 2021-03-11 | Node processing method and device of network system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112769961A CN112769961A (en) | 2021-05-07 |
| CN112769961B true CN112769961B (en) | 2021-10-15 |
Family
ID=75690948
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110265135.0A Active CN112769961B (en) | 2021-03-11 | 2021-03-11 | Node processing method and device of network system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112769961B (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR100509794B1 (en) * | 2005-03-09 | 2005-08-23 | 주식회사 퓨전소프트 | Method of scheduling jobs using database management system for real-time processing |
| CN103929263A (en) * | 2014-04-30 | 2014-07-16 | 北京华力创通科技股份有限公司 | Network communication method, network communication delay determining method and network communication local time synchronizing method |
| CN104065707A (en) * | 2014-06-09 | 2014-09-24 | 上海交通大学 | Time-triggered dispatching system based on computation and communication collaborative design |
| CN111158894A (en) * | 2018-11-08 | 2020-05-15 | 杭州海康威视数字技术股份有限公司 | Task monitoring method and device in cloud analysis system |
| CN111582407A (en) * | 2020-06-19 | 2020-08-25 | 拉扎斯网络科技（上海）有限公司 | Task processing method and device, readable storage medium and electronic equipment |
| CN112306671A (en) * | 2019-07-29 | 2021-02-02 | 国际商业机器公司 | Determining optimal computing resources for distributed batch-based optimization applications |
-
2021
- 2021-03-11 CN CN202110265135.0A patent/CN112769961B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR100509794B1 (en) * | 2005-03-09 | 2005-08-23 | 주식회사 퓨전소프트 | Method of scheduling jobs using database management system for real-time processing |
| CN103929263A (en) * | 2014-04-30 | 2014-07-16 | 北京华力创通科技股份有限公司 | Network communication method, network communication delay determining method and network communication local time synchronizing method |
| CN104065707A (en) * | 2014-06-09 | 2014-09-24 | 上海交通大学 | Time-triggered dispatching system based on computation and communication collaborative design |
| CN111158894A (en) * | 2018-11-08 | 2020-05-15 | 杭州海康威视数字技术股份有限公司 | Task monitoring method and device in cloud analysis system |
| CN112306671A (en) * | 2019-07-29 | 2021-02-02 | 国际商业机器公司 | Determining optimal computing resources for distributed batch-based optimization applications |
| CN111582407A (en) * | 2020-06-19 | 2020-08-25 | 拉扎斯网络科技（上海）有限公司 | Task processing method and device, readable storage medium and electronic equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112769961A (en) | 2021-05-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108536752B (en) | Data synchronization method, device and equipment | |
| JP2021512519A5 (en) | ||
| CN111078662B (en) | Block chain data storage method and device | |
| CN113760476B (en) | Task dependency processing method and related device | |
| CN110955661B (en) | Data fusion method and device, readable storage medium and electronic equipment | |
| CN111176885A (en) | Data verification method and related device for distributed storage system | |
| CN111369350A (en) | Orthogonal punching easy processing method and device | |
| CN112769961B (en) | Node processing method and device of network system | |
| KR20130096033A (en) | Computer system and siglature verification server | |
| CN107562695B (en) | Load data processing method and device for distribution transformer | |
| CN113672167B (en) | Data consistency verification method, device and equipment for distributed storage system | |
| US20240036990A1 (en) | Inference service management method, apparatus and system for inference platform, and medium | |
| CN110046172A (en) | In line computation data processing method and system | |
| CN114816509A (en) | Block chain version compatibility verification method and device and electronic equipment | |
| CN112487004A (en) | Method, device, medium and system for automatically controlling task based on data blood margin | |
| US10922301B1 (en) | Apparatus, computer program, and method for trigger-based tracking of database modifications | |
| JP2008198001A (en) | Correction patch selection support system and method | |
| CN110147355B (en) | Data synchronization method, device and server | |
| CN111371818A (en) | Data request verification method, device and equipment | |
| CN109241205A (en) | A method of can be used for high-volume production Methods type analogue data | |
| CN114328563B (en) | Data updating control method and device | |
| CN115757423B (en) | Engineering cost data correction method, system, equipment and storage medium | |
| CN108764900A (en) | Exchange management method, device based on system for cloud computing and storage device | |
| CN108228685A (en) | Obtain the method and device of the statistic behavior of data | |
| CN117290582A (en) | Content recommendation method and device, computer equipment and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| CB03 | Change of inventor or designer information | ||
| CB03 | Change of inventor or designer information |
Inventor after: Su Wanbao Inventor after: Tian Jiwei Inventor before: Tian Jiwei |
|
| TA01 | Transfer of patent application right | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20210924 Address after: 232000 051, team 1, wumiao village, Jiahe Township, Panji District, Huainan City, Anhui Province Applicant after: Su Wanbao Applicant after: Shanghai kechen Technology Co.,Ltd. Address before: No.5, Zhongguancun South Street, Haidian District, Beijing Applicant before: Tian Jiwei |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CP02 | Change in the address of a patent holder | ||
| CP02 | Change in the address of a patent holder |
Address after: No.1586, Changxing East Road, Dongjing Town, Songjiang District, Shanghai Patentee after: Su Wanbao Patentee after: Shanghai kechen Technology Co.,Ltd. Address before: 232000 051, team 1, wumiao village, Jiahe Township, Panji District, Huainan City, Anhui Province Patentee before: Su Wanbao Patentee before: Shanghai kechen Technology Co.,Ltd. |