WO2015144014A1

WO2015144014A1 - Method and device for achieving dynamic time delay invoking of control logic via scheduled queue

Info

Publication number: WO2015144014A1
Application number: PCT/CN2015/074634
Authority: WO
Inventors: 韩骐键
Original assignee: 三和智控(北京)系统集成有限公司
Priority date: 2014-03-24
Filing date: 2015-03-19
Publication date: 2015-10-01
Also published as: CN103885364A; CN103885364B

Abstract

A method for achieving the dynamic time delay invoking of control logic via a scheduled queue, which is characterized in that a main program of a control system achieves the dynamic time delay invoking of control logic by establishing a scheduled queue and a corresponding management module. The method comprises: taking control logic needing time delay invoking in a control system as a schedule item to be added into a scheduled queue 1; establishing a scheduled mirror image 2 as the information backup of the scheduled queue 1; detecting whether a certain schedule item reaches required execution time via an inspection execution and synchronization module 3, if so, taking charge of executing control logic in a time delay schedule and synchronizing information in the scheduled mirror image 2 at the same time, and when the system is restarted, also taking charge of recovering information in the scheduled queue 1; and a scheduled queue management module 4 taking charge of responding to a request of the main program of the control system, such as adding, deleting, querying and modifying the schedule item. The method itself can form a control logic algorithm. The method improves the performance of the control system.

Description

Method and device for realizing dynamic delay call of control logic by scheduling queue

Technical field

The invention discloses a method and a device for realizing dynamic delay call of control logic by scheduling a queue, which is characterized in that the control of the computer or MCU (Micro Control Unit) is controlled by establishing a plan queue and a corresponding management module. The main program of the system can realize dynamic delay call and management of the control logic.

Background technique

Control logic is a key part of various software programs in a computer or MCU (Micro Control Unit)-based control system. Its function is to obtain control conclusions through the operation of a given logic algorithm. Corresponding automatic control tasks.

In realistic automatic control systems (such as: industrial control, agricultural production automation, building automation, smart home, and automatic control of various types of electromechanical equipment), there are many control functions that need to delay the execution of specific control logic programs. Implementation, these requirements include but are not limited to:

1. Pre-planned fixed-cycle scheduled inspection tasks: In the actual control system, the indicators from the issuance of control commands to the expected control objectives need to go through a series of electromechanical devices, which takes a certain amount of time to implement; therefore, there are A certain number of control tasks only need to be run according to a fixed time period; such requirements are the task requirements of the most basic and simple delay operation control logic in the control system.

2. Pre-planned non-fixed-cycle delay check tasks: Similarly, in a real-world control system, to complete certain types of control tasks, a series of control commands need to be issued at intervals, and in particular, there are cases where instructions The interval is calculated by the previous control effect and its trend. It is calculated by determining the time of the next expected running related control logic during the running process, and then the output command is obtained; therefore, the “dynamic delay” The demand is the task requirement of the more complex delay running control logic that exists in the control system.

3. Non-pre-planned non-fixed-cycle delay check tasks: Similarly, in a real-world control system, especially a self-diagnostic logic program for system faults, when a certain operational indicator information in the system may deviate from the normal range, the system fails. The self-diagnostic logic program should be triggered to run. However, it is often impossible to draw a conclusion whether the fault has been completed after only one inspection and diagnosis. It is necessary to delay the diagnosis again or more after a period of time according to the actual situation; here is a simple example. Example: In winter buildings or houses, there is a need for heat source heating (such as boilers, heating air conditioning units, central heating pipes, etc.). If the control system finds that the heat source temperature is not high enough during the planned heating period, it runs. "Heat source fault self-diagnostic logic program", can confirm that the temperature deviates from the normal range, but can not confirm the genus In the case of a fault, it may be a normal heat supply adjustment process. However, if the heat source temperature still deviates from the normal range after a certain time, it can be confirmed that it belongs to the fault, and the standby heat source is instructed to start the operation; thus, it is known that the non-pre-planned non-fixed period The delayed task operation is the task requirement of the more complex delay running control logic that exists in the control system.

4. Series delay tasks with different delay times but the same content: Similarly, in the actual control system, the execution of certain types of control tasks contains preconditions, which may be comprehensive judgments on some information. The change is known to have certain rules, but it cannot be accurately predicted. It needs to be checked intermittently according to the actual situation; for example, the fan and the pump cannot be stopped immediately after the boiler stops running, and the furnace temperature and water temperature need to be lowered to a safe range. All shutdowns, such delay check intervals can be based on existing relevant data to estimate one or more checkpoints, and these intervals are often gradually shortened; therefore, when establishing a delay task, refer to the existing mission plan The requirements are also the task requirements of the more complex delay running control logic present in the control system.

5. As stated in the requirements of clause 4 above, if a control system restart event occurs after the delay task is established, a type of task such as delayed shutdown should continue to be executed; in a realistic control system, such a requirement should be guaranteed. .

In summary, there is a general need for delay calls of control logic in various control systems, including but not limited to:

1. Fixed-cycle scheduled operation tasks;

2. A single delay runs the task, and the delay time has been fixed in the program;

3. A single delay runs the task, and the time of the delay is dynamically determined during the running of the program;

4. The delayed task that has been established can query the scheduled task content and remaining time before executing, and can modify the delay time or cancel the task;

5. Ability to create multiple delay schedules with the same task content, while they have different delay times;

6. When multiple delay schedules with the same task content are established, the delay time in the post-established delay task can be dynamically determined according to the delay time of the scheduled delay task;

7. The established delay task, after a brief failure or restart of the control system, should be able to continue or provide a re-verification function.

In order to meet the needs of time-delayed call control logic programs, many computer programming languages and runtime environments provide functions such as "timers". For example, in the Windows operating environment, the functions related to the timer include:

(1) Sleep () function, can achieve the task pause waiting, but at the same time the entire program is suspended, usually rarely used;

(2) SetTimer () and KillTimer () function, commonly used timers, can be established or canceled;

(3) timeSetEvent(), timeKillEvent() function, common timer, same, can be established or canceled.

Timers with similar functions are also available for applications in the Linux operating system.

The above-mentioned timers can realize the function of delaying the calling of the task program. Their basic workflow is shown in FIG. 1 , which is a flowchart for implementing the delay running of the task program by using the timer; wherein, in the step 1 , the application setting A timer i, the timer usually contains information: the unique ID of the timer, the time interval (the length of time from the start of the timer to calculate the delay), the target task i (usually using the callback function to trigger the target task) Running); the application continues to run after starting the timer i in step 2; in step 3, the operating system monitors the timing time set by the timer i; after the step 4, the operating system notifies the application to run the target task i; Task i can also determine in its own program that timer i is the only function to delay the call of the target task, or continue to exist to achieve the target task i running at the same time interval.

In summary, the general-purpose timer provided by the program development language realizes the function of delay running of the task program, which can meet the requirements of a simple delay calling program, but there are relatively complicated control logic programs in various control systems. The requirement for delayed execution. In this case, the use of a general-purpose timer provided by the program development language to implement the delayed operation of the task program may exhibit the following disadvantages:

1. The timer is managed by the operating system, and the application cannot intervene. It can only be established or cancelled.

2. The timer is difficult to be queried and modified by the application; if the same task program needs to establish different delay call plans, different timer IDs must be used, and the application will be difficult to query and manage all delay tasks. Therefore, When it comes to the complicated requirements of establishing and modifying a delayed task plan, the general-purpose timer is not competent;

3. If an application or operating system accidentally restarts, the previously established delayed task plan disappears, and there are no records to check which tasks are not executed.

The invention solves the above problems well by establishing a planning queue and corresponding management functions.

Summary of the invention

The invention discloses a method and a device for realizing dynamic delay calling of control logic through a planning queue, and the purpose is to solve the problem that the system main program in various control systems dynamically manages the delayed calling control logic (program). Problems, including: query, modification requirements, and requirements for continued execution or query and modification after an unexpected system restart.

In order to achieve the object of the present invention, in accordance with an aspect of an embodiment of the present invention, a method for implementing dynamic delay invocation of control logic by a scheduling queue is provided, the method comprising:

1. The invention discloses a method for realizing dynamic delay calling of control logic by scheduling a queue, which is characterized in that a main program of a computer or MCU based control system can realize control by establishing a planning queue and a corresponding management module. Logic dynamic delay call and management; the technical solution of the method of the present invention is shown in FIG. 2, which is a structural diagram of the technical solution of the present invention, which includes:

(1) The planning queue 1 is used to add the control logic in the control system that needs to be delayed to be added to the planning queue 1 as a planning item, wherein each of the planning items includes data elements: a control logic ID, Execution time, parameters required for control logic execution, timestamps added to schedule queue 1;

(2) Plan image 2 is the real-time dynamic mirror information of plan queue 1, and the complete content in plan queue 1 is recorded synchronously; plan image 2 can be saved in the database or in the data file; plan mirror 2 functions include: as a plan The real-time backup of queue 1 is used to restore the information in the planned queue 1 when the system is unexpectedly restarted;

(3) The patrol execution and synchronization module 3 is responsible for cyclically detecting all the planned items recorded in the planning queue 1, and when detecting that the execution time of a certain plan item mark is less than or equal to the current system time, the plan is The control logic will be executed and removed from the planning queue 1 and the planning mirror 2; the inspection execution and synchronization module 3 is responsible for the complete synchronization of the planning mirror 2 with the planning queue 1, including the addition of the planning items in the planning queue 1. , delete, modify the corresponding record in the plan mirror 2; especially when the system is unexpectedly restarted, the patrol execution and synchronization module 3 is responsible for importing the contents of the plan image 2 into the newly established plan queue 1 after the system restarts;

(4) The plan queue management module 4 is in accordance with the request of the control system main program: responsible for inserting the new plan item of the delay call control logic into the tail of the plan queue 1, and responsible for modifying the execution time of the existing plan item, Responsible for deleting the unexecuted plan items, responsible for querying the detailed information of the existing plan items and replying to the query request; the establishment and use of the plan queue management module 4 can achieve precise control of any plan item tasks;

2. A method for implementing dynamic delay invocation of control logic by a scheduling queue according to the present invention, characterized in that the method based on the dynamic delay of the control logic implemented by the planning queue and its management module itself can constitute the control A logic algorithm used by the system to perform an automatic control task, which includes: when a certain control logic i is being called to run, if the control conclusion cannot be obtained based on the currently obtained related information, the change may be based on the existing information. The trend calculation determines a delay time for executing the control logic i again, so that the second operation, or even more delay operations, can be performed until the control conclusion can be obtained based on the latest state information; thus, the simulation is manually performed. Multiple observations and judgments lead to a logical analysis and calculation method of control conclusions. For a detailed description of this part, refer to the specific embodiment section. FIG. 5 is a schematic diagram showing the flow of an algorithm of the method itself.

In order to achieve the above object, according to another aspect of the embodiments of the present invention, a method for implementing dynamic delay invocation of control logic by a scheduling queue is provided, the method comprising: adding at least one planning item to a first queue, wherein The plan item includes at least one of: an ID of the program, an execution time of the program, a parameter required to execute the program, and a time when the program is added to the first queue; detecting all plan items in the first queue If the execution time of the program in the first plan item of the plurality of plan items is less than or equal to the current system time, the corresponding program is found by the ID of the program in the first plan item and executed; The first plan item corresponding to the executed program is removed from the first queue.

In order to achieve the above object, according to another aspect of an embodiment of the present invention, an apparatus for implementing dynamic delay invocation of control logic by a scheduling queue is provided, the apparatus comprising: a planning queue management module, configured to be based on a main program of the control system Requesting to add control logic in the control system that requires a delayed call as a plan item to the plan queue, wherein each of the plan items includes data elements: control logic ID, execution time, and parameters required for control logic execution a timestamp added to the plan queue; a synchronization module for synchronously recording the complete content in the plan queue to the plan image in real time, and when the system is unexpectedly restarted, the synchronization module is further configured to use the content in the plan image Importing the plan queue newly created after the system is restarted, wherein the plan image is saved in the database or in the data file; the patrol execution module is configured to cyclically detect all the plan items recorded in the plan queue, When it is detected that the execution time of a certain plan item mark is less than or equal to the current system time, The control logic will be executed and the control logic is removed from the scheduling queue. The plan queue management module is further configured to modify information of an existing plan item, delete a plan item that has not been executed, and query information of an existing plan item and reply to the query request.

In order to achieve the above object, according to another aspect of an embodiment of the present invention, an apparatus for implementing a dynamic delay call of control logic by a schedule queue is provided, the apparatus comprising: an add module for adding at least one plan item to the first a queue, wherein the plan item includes at least one of: an ID of the program, an execution time of the program, a parameter required to execute the program, and a time when the program is added to the first queue; a detection module, For detecting all plan items in the first queue, in a case where an execution time of a program in a first plan item of the plurality of plan items is less than or equal to a current system time, by using the first plan item The ID of the program is searched for its corresponding program and executed; the first plan item corresponding to the executed program is removed from the first queue.

According to an embodiment of the invention, at least one plan item is added to the first queue, wherein the plan item includes at least one of the following: an ID of the program, an execution time of the program, a parameter required to execute the program, and a program is added to The time of the first queue; detecting all the plan items in the first queue, in a case where the execution time of the program in the first plan item of the plurality of plan items is less than or equal to the current system time, The ID of the program in the first plan item is searched for its corresponding program and executed; the first plan item corresponding to the executed program is removed from the first queue, and the existing delayed execution program is solved. The method is difficult to implement the problem of managing delayed tasks.

DRAWINGS

The accompanying drawings, which are incorporated in the claims In the drawing:

FIG. 1 is a flow chart of a conventional delay running of a task program using a timer;

2 is a structural diagram of a technical solution of the present invention;

3 is a flowchart of a plan queue management module in a technical solution of the present invention;

4 is a flowchart of a patrol execution and synchronization module in the technical solution of the present invention;

FIG. 5 is a schematic flow chart of an algorithm formed by the method itself.

detailed description

Embodiment 1

Embodiments of the present invention provide a method for implementing dynamic delay invocation of control logic by scheduling a queue.

Embodiments of the technical solution of the present invention are described below with reference to the accompanying drawings:

FIG. 2 is a structural diagram of a technical solution of the present invention, illustrating a method for implementing the technical solution of the present invention. Wherein the method comprises:

(1) A plan queue 1 is a commonly used computer data structure which is a bidirectional circular linked list, and control logics in the control system that require delayed calls are added to the plan queue 1 as a plan item, wherein each of the plan items includes The data elements are: control logic ID, execution time, parameters required to control logic execution, timestamps added to schedule queue 1; the following program code is an example of build plan queue 1:

(2) A plan image 2 is the real-time dynamic mirror information of the plan queue 1, and the complete content in the plan queue 1 is synchronously recorded; the plan image 2 can be saved in the database or in the data file; the plan image 2 function includes: The real-time backup of the scheduled queue 1 is used to restore the information in the planned queue 1 when the system is unexpectedly restarted;

(3) A patrol execution and synchronization module 3 is responsible for cyclically detecting all of the plan items recorded in the plan queue 1 when the execution time of a certain plan item mark is less than or equal to the current system time, in the plan The control logic will be executed and removed from the planning queue 1 and the planning mirror 2; the inspection execution and synchronization module 3 is also responsible for the complete synchronization of the planning mirror 2 with the planning queue 1, including the planning items in the planning queue 1 Add to, Delete and modify the corresponding record in the plan image 2; especially after the system restarts unexpectedly, the patrol execution and synchronization module 3 is responsible for importing the contents of the plan image 2 into the newly created plan queue 1 after the system restarts;

(4) a plan queue management module 4 according to the request of the control system main program: responsible for inserting the new plan item of the delay call control logic into the tail of the plan queue 1, and responsible for modifying the execution time of the existing plan item Responsible for deleting the unexecuted plan items, responsible for querying the detailed information of the existing plan items and replying to the query request; the establishment and use of the plan queue management module 4 can achieve precise control of any plan item tasks;

FIG. 3 is a flowchart of a plan queue management module according to a technical solution of the present invention, and specifically illustrates an implementation manner of a plan queue management module of one of the main modules in the technical solution of the present invention. The method includes: when the control system main program needs to delay calling a certain control logic, generating delay plan item information in step 1, the data elements included in the information include: control logic ID, execution time, and control logic execution The required parameters, the timestamp added to the planning queue 1; check the presence or absence of relevant information in the queue through step 2, that is, by traversing each of the planning items in the planning queue, to see if there is the same ID; The conclusion is no, step 3 is executed to insert the new plan item into the tail of the team; in step 9 to exit; if step 2 is concluded as yes, through step 4, the main program is asked to delete the original plan item; if step 4 is concluded If yes, delete the original plan item (with the same ID) through step 5; then insert the new plan item into the end of the team through step 7; then exit through step 9; if the conclusion reached in step 4 is no, step 6 is based on The main program requests to decide whether to change the original plan item; if the conclusion of step 6 is yes, execute step 8 to modify the original plan item information according to the requirements of the main program, and abandon the insertion of the new plan item. If the instruction issued by the main program is a change instruction, in this scenario, only the original plan item information is modified without inserting a new plan item; if the conclusion of step 6 is no, then step 7 will be new. The plan item is inserted into the tail of the team. At this time, there will be multiple plan items with the same ID and different plan time in the plan queue, indicating that there are multiple control logics of the same content waiting in line for execution. It should be noted that if the main program is issued The instruction is to either modify the instruction or delete the instruction, and directly insert the new plan item into the queue. At this time, there may be multiple plan items of the same ID in the queue; as can be seen from the above description, the method of the present invention is The system main program provides a variety of flexible and convenient methods and means for implementing dynamic delay calls of control logic.

4 is a flowchart of a patrol execution and synchronization module in the technical solution of the present invention, and specifically illustrates an implementation manner of a patrol execution and synchronization module of one of the main modules in the technical solution of the present invention. The method includes: the patrol execution and synchronization module is always patrolling the plan queue, and when there is plan item information in the plan queue, the patrol execution and synchronization module starts from the head of the plan queue, and steps 1 The plan queue header takes out a plan item information, and through step 2, it is determined whether the execution time in the plan item information is less than or equal to the current system time (that is, whether the scheduled task delay execution time has arrived); if step 2 is obtained The conclusion is that the control logic of the plan item mark is executed by step 3; then the plan item is deleted from the queue through step 5, and at the same time, the plan item information is ensured to be synchronized with the information in the plan image by step 6; Step 7, point the pointer to the next under the planning queue An information is looped back; if the result of step 2 is no, the same step 6 is performed to synchronize the information synchronization in the plan image, and then step 7 is performed, and the process proceeds to step 1.

FIG. 5 is a schematic flow chart of an algorithm of the present invention, which exemplifies an implementation method of an algorithm by using the method of the present invention. The method includes: when a certain control logic i is being called to run, step 1 indicates that the control logic i is started to run; after the control logic i is operated, the judgment is performed in step 2, and whether the control conclusion can be obtained according to the currently obtained related information. If the conclusion of step 2 is no, then by step 3, the delay time of executing the control logic i again, that is, the execution time of the aforementioned delay plan item, is determined according to the change trend of the existing information; The planning queue management module adds the control logic i to the foregoing scheduling queue for delaying the call control logic; in step 5, through the foregoing patrol execution and the continuous patrol of the synchronization module, when the delay execution is detected The execution time has expired, then the control logic i is called again to execute; until the control logic i can draw the control conclusion according to the latest state information; thus, the simulation realizes a kind of logic analysis and calculation for manually performing multiple observations and judgments. method.

It should be noted that the above embodiments are for explaining the technical solutions of the present invention, and are not limited thereto.

In summary, the present invention has the following advantages:

1. Realize the function of dynamic delay call of control logic;

2. During the operation of the control system, the plan item information of the existing delay call control logic can be queried, modified, and deleted, and the management is transparent and flexible;

3. Broaden the method and means of the control system flexible call control logic, can handle complex control logic call relationships, improve the performance of the control system;

4. After the system is restarted unexpectedly, the original plan item information can be restored to ensure the continuity of the controlled object operation;

5. The method of the present invention itself is capable of generating a logic algorithm in a time dimension, which is particularly suitable for intelligent diagnosis of a fault of a controlled system.

The technical solution of the present invention has been used in the actual engineering project of the applicant and has undergone at least 2 years of operation inspection.

Embodiment 2

The embodiment of the present invention further provides an apparatus for implementing dynamic delay call of control logic by scheduling a queue, the apparatus may include: a plan queue management module, configured to extend the control system according to a request of a control system main program Control logic called when added as a plan item to the plan queue, where each plan is described The data elements contained in the item are: control logic ID, execution time, parameters required to control logic execution, and timestamps added to the schedule queue.

a synchronization module, configured to synchronously record the complete content in the scheduled queue to the planned image in real time, and when the system is unexpectedly restarted, the synchronization module is further configured to import the content in the planned image into the newly established device after the system is restarted. A plan queue in which the plan image is saved in a database or in a data file.

a patrol execution module, configured to cyclically detect all the plan items recorded in the plan queue, and when the execution time of detecting a plan item mark is less than or equal to a current system time, executing the control logic is executed And remove the control logic from the planning queue.

It should be noted that the plan queue management module is further configured to modify information of an existing plan item, delete a plan item that has not been executed, and query information of an existing plan item and reply to the query request.

Optionally, the foregoing apparatus may further include: a processing module, configured to: when a certain control logic i is being invoked to run, if the control conclusion cannot be obtained according to the currently obtained related information, the change trend of the existing information may be The calculation determines a delay time for executing control logic i again to perform a second operation, or even more delay operations, until a control conclusion can be derived from the latest state information.

Embodiment 3

The embodiment of the invention further provides a method for implementing dynamic delay calling of control logic by scheduling a queue, the method may include:

Step S10, adding at least one plan item to the first queue, wherein the plan item includes at least one of the following: an ID of the program, an execution time of the program, a parameter required to execute the program, and a time when the program is added to the first queue. .

Specifically, in the solution, the first queue may be the scheduling queue 1, and the program may be a control logic program, and the time that the program is added to the first queue may be a timestamp added to the first planning queue.

Step S20: Detect all plan items in the first queue, and pass the ID of the program in the first plan item if the execution time of the program in the first plan item of the plurality of plan items is less than or equal to the current system time Find the corresponding program and execute it.

Specifically, in the solution, the first plan item may be any one of the first queue items, and when any one of the plan items is detected, that is, the execution time marked by the first plan item is less than or equal to the current system time, The control logic program corresponding to the program ID in the first plan item is executed.

Step S30, the first plan item corresponding to the executed program is removed from the first queue.

In an optional embodiment, in step S10, after the at least one plan item is added to the first queue, the method provided in this embodiment may further include:

In step S12, all the plan items in the first queue are synchronized to the second queue.

Step S14, in the case that the system is restarted, all the plan items in the second queue are added to the first queue.

Specifically, in the solution, the first queue may be the planning queue 1, the second queue may be the planning mirror 2, and the planning mirror 2 may be the real-time dynamic mirroring information of the scheduling queue 1 for synchronizing the recording scheduling queue 1 In the complete content, the above plan image 2 can be saved in the database or saved in the data file. The above plan image 2 function includes: as the real-time backup of the plan queue 1, when the system is unexpectedly restarted, it is used to restore the plan queue 1 Information.

It should be noted that, in the present solution, the patrol execution and synchronization module 3 may be used to cyclically detect all the planned items recorded in the plan queue 1 when the execution time of a certain plan item mark is detected is less than or equal to At the current system time, the control logic described in the plan will be executed and removed from Plan Queue 1 and Plan Mirror 2; Patrol Execution and Sync Module 3 will be responsible for the full synchronization of Plan Mirror 2 and Plan Queue 1, including The corresponding record in the plan image 2 is updated while the plan item is added, deleted, or modified in the queue 1; especially after the system is unexpectedly restarted, the patrol execution and synchronization module 3 is responsible for importing the contents of the plan image 2 into the system. The newly created plan queue 1 after restarting.

Optionally, in step S10, the step of adding at least one plan item to the first queue may include:

Step S101, detecting all plan items in the first queue.

Step S103, if the ID of the program of the first plan item in the first queue is different from the ID of the program of the plan item to be added, insert the plan item to be added into the first The tail of the queue.

Step S105: If the ID of the program of the first plan item in the first queue is the same as the ID of the program of the plan item to be added, the plan item to be added is processed according to the received instruction.

Optionally, in step S105, if the ID of the program of the first plan item in the first queue is the same as the ID of the program of the plan item to be added, the to-be-added is processed according to the received instruction. The steps of the plan item can include:

In step S1051, if the received instruction is a delete instruction, the first plan item is deleted, and the plan item to be added is inserted into the tail of the first queue.

Step S1053: If the received instruction is a change instruction, change data of the first plan item, and discard the plan item to be added.

In step S1054, if the received instruction is neither a delete instruction nor a change instruction, the plan item to be added is directly inserted into the tail of the first queue.

Specifically, the above steps S101 to S105 and steps S1051 to S1053 are specifically described below with reference to FIG. 3. In the present solution, when the control system main program needs to delay calling a certain control logic program, it is generated in step 1. Delayed schedule item information, the data elements included in the information include: control logic ID, execution time, parameters required for control logic execution, time stamps added to the schedule queue 1; and step 2 to check whether there is relevant information in the queue, ie By traversing each plan item in the plan queue, check whether there is the same ID; if the conclusion reached in step 2 is none, perform step 3 to insert the new plan item into the tail of the team; exit in step 9; if step 2 is obtained If there is a conclusion, ask whether the main program deletes the original plan item through step 4; if step 4 concludes that it is yes, delete the original plan item (with the same ID) through step 5; and then step 7 to move the new plan item. Insert the tail of the team; exit with step 9; if the conclusion reached in step 4 is no, decide whether to change the original plan item according to the requirements of the main program through step 6; if the conclusion of step 6 is yes, Step 8 modify the original plan item information according to the requirements of the main program, and abandon the insertion of the new plan item. Here, it should be noted that if the instruction issued by the main program is a change instruction, in the present plan, only the original plan item information is modified. If the conclusion of step 6 is no, then step 7 will insert the new plan item into the end of the team. At this time, there will be multiple plan items with the same ID and different plan time in the plan queue. A plurality of control logics of the same content are waiting in line for execution; here, if the instruction issued by the main program is neither a modified instruction nor a delete instruction, the new plan item is directly inserted into the queue. At this time, the queue There may be multiple plan items with the same ID; as can be seen from the above description, the method of the present invention provides a rich, flexible and convenient method and means for the system main program to implement dynamic delay call of the control logic.

In an optional embodiment, in step S20, all plan items in the first queue are detected, in a case where the execution time of the program in the first plan item of the plurality of plan items is less than or equal to the current system time, The steps of finding the corresponding program by the ID of the program in the first plan item and executing may include:

Step S201, detecting a plan item of the head in the first queue, and confirming that the plan item of the head in the first queue is the first plan item.

Step S202: If the execution time of the program in the first plan item is less than or equal to the current system time, run the program according to the parameters required to execute the program in the first plan item.

The following steps S201 to S202 are described in conjunction with FIG. 4. Specifically, in the present solution, FIG. 4 is a flowchart of a patrol execution and synchronization module in the technical solution of the present invention, and specifically illustrates the main modules in the technical solution of the present invention. An implementation of the patrol execution and synchronization module. The method includes: the patrol execution and synchronization module is always patrolling the plan queue, and when there is plan item information in the plan queue, the patrol execution and synchronization module starts from the head of the plan queue, and steps 1 The plan queue header takes out a plan item information, and through step 2, it is determined whether the execution time in the plan item information is less than or equal to the current system time (that is, whether the scheduled task delay execution time has arrived); if step 2 is obtained The conclusion is that the control logic of the plan item mark is executed by step 3; then the plan item is deleted from the queue through step 5, and at the same time, the plan item information is ensured to be synchronized with the information in the plan image by step 6; Step 7. Point the pointer to the next item of information in the planning queue, and cycle back and forth; if the result of step 2 is no, the same step 6 is performed to synchronize the information synchronization in the plan image, and then step 7 is performed, and the process proceeds to step 1.

Optionally, in step S20, all plan items in the first queue are detected, and when the execution time of the program in the first plan item of the plurality of plan items is less than or equal to the current system time, the first plan item is passed. After the ID of the program in the program is found and executed, the method provided in this embodiment may further include:

Step S22, generating an execution time of the program again according to the parameter generated by executing the program.

Step S24, generating a new plan item according to the execution time of the program being executed again.

Step S26, inserting the new plan item into the tail of the first queue.

Specifically, the above steps S22 to S26 are specifically explained in conjunction with FIG. 5, when a certain control logic i is being called to run, step 1 indicates that the operation control logic i is started; and after the control logic i is operated, the determination is performed in step 2, Whether the control conclusion can be obtained according to the currently obtained related information, it should be noted that the control conclusion may be the parameter in the above step S22; if the conclusion of the step 2 is no, then according to the change trend of the existing information through the step 3 Calculating a delay time for executing the control logic i again, that is, the execution time of the foregoing delay plan item; and informing the aforementioned plan queue management module by step 4 to add the control logic i to the aforementioned delay call control logic The scheduling queue; in step 5, through the foregoing patrol execution and the continuous patrol of the synchronization module, when it is detected that the execution time of the delayed execution has arrived, the control logic i is called again; until the control logic i can The latest state information reaches the conclusion of the control; thus, the simulation realizes the logic analysis and calculation of the manual observation One way.

Embodiment 4

Embodiments of the present invention also provide an apparatus for implementing dynamic delay invocation of control logic by scheduling a queue. The device can include:

The adding module 700 is configured to add at least one plan item to the first queue, wherein the plan item includes at least one of the following: an ID of the program, an execution time of the program, a parameter required to execute the program, and a program is added to The time of the first queue.

The detecting module 702 is configured to detect all the plan items in the first queue, where the execution time of the program in the first plan item of the plurality of plan items is less than or equal to the current system time, by using the first The ID of the program in the plan item is found and executed by its corresponding program.

The removing module 704 is configured to remove the first plan item corresponding to the executed program from the first queue.

It should be noted that the foregoing adding module 700, detecting module 702, and removing module 704 may be run in a computer terminal as part of the device, and the functions implemented by the above module may be performed by a processor in the computer terminal, and the computer terminal is also It can be a smart phone (such as Android phone, iOS phone, etc.), tablet computer, applause computer, and mobile Internet devices (MID), PAD and other terminal devices.

Optionally, the apparatus provided in this embodiment may further include:

The synchronization module 806 is configured to synchronize all the plan items in the first queue into the second queue.

The recovery module 808 is configured to add all the plan items in the second queue to the first queue in case of a system restart.

It should be noted that the synchronization module 806 and the recovery module 808 may be run in a computer terminal as part of the device, and the functions implemented by the module may be performed by a processor in the computer terminal, and the computer terminal may also be a smart phone ( Such as Android phones, iOS phones, etc.), tablets, applause computers and mobile Internet devices (Mobile Internet Devices, MID), PAD and other terminal devices.

Optionally, the foregoing adding module may further include:

The first sub-detection module is configured to detect all plan items in the first queue.

a sub-addition module, configured to insert the plan item to be added into the office if the ID of the program of the first plan item in the first queue is different from the ID of the program of the plan item to be added The tail of the first queue.

a sub-processing module, configured to process the to-be-added according to the received instruction if the ID of the program of the first plan item in the first queue is the same as the ID of the program of the plan item to be added Plan item.

It should be noted that the foregoing first sub-detection module, sub-addition module, and sub-processing module may be run in a computer terminal as part of the device, and the functions implemented by the above module may be executed by a processor in the computer terminal, the computer terminal It can also be a smart phone (such as an Android phone, an iOS phone, etc.), a tablet computer, an applause computer, and a mobile Internet device (MID), a PAD, and the like.

Optionally, the foregoing sub-processing module may further include:

a sub-delete module, configured to delete the first plan item and insert the plan item to be added into a tail of the first queue if the received instruction is a delete instruction.

And a sub-modification module, configured to: when the received instruction is a change instruction, change data of the first plan item, and insert the plan item to be added into a tail of the first queue.

a sub-insert module, configured to insert the plan item to be added into the tail of the first queue if the received instruction is neither a delete instruction nor a change instruction.

It should be noted that the foregoing sub-deletion module, sub-modification module, and sub-insertion module may be run in a computer terminal as part of the device, and the functions implemented by the above module may be performed by a processor in the computer terminal, and the computer terminal may also be It is a smart phone (such as Android phone, iOS phone, etc.), tablet computer, applause computer, and mobile Internet devices (MID), PAD and other terminal devices.

Optionally, the foregoing detecting module may further include:

The second sub-detection module is configured to detect a plan item of the head in the first queue, and confirm that the plan item of the head in the first queue is the first plan item.

a sub-execution module, configured to run the program according to a parameter required for a given execution program in the first plan item if an execution time of the program in the first plan item is less than or equal to a current system time .

It should be noted that the second sub-detection module and the sub-execution module may be run in a computer terminal as part of the device, and the functions implemented by the module may be performed by a processor in the computer terminal, and the computer terminal may also be intelligent. Mobile devices (such as Android phones, iOS phones, etc.), tablets, applause computers, and mobile Internet devices (MID), PAD and other terminal devices.

Optionally, the apparatus provided in this embodiment may further include:

And a first generation module, configured to generate an execution time of the program to be executed again according to the parameter value generated by executing the program.

And a second generating module, configured to generate a new plan item according to the execution time of the program being executed again.

Inserting a module for inserting the new plan item into the tail of the first queue.

It should be noted that the first generation module and the insertion module may be run in a computer terminal as part of the device, and the functions implemented by the module may be performed by a processor in the computer terminal, and the computer terminal may also be a smart phone ( Such as Android phones, iOS phones, etc.), tablets, applause computers and mobile Internet devices (Mobile Internet Devices, MID), PAD and other terminal devices.

The various functional units provided by the embodiments of the present application may be operated in a mobile terminal, a computer terminal, or the like, or may be stored as part of a storage medium.

Thus, embodiments of the present invention may provide a computer terminal, which may be any computer terminal device in a group of computer terminals. Optionally, in this embodiment, the foregoing computer terminal may also be replaced with a terminal device such as a mobile terminal.

Optionally, in this embodiment, the computer terminal may be located in at least one network device of the plurality of network devices of the computer network.

In this embodiment, the computer terminal may execute the program code of the following steps in the method for implementing the dynamic delay call of the control logic by the scheduling queue: adding at least one plan item to the first queue, wherein the plan item includes at least one of the following Data: ID of the program, execution time of the program, parameters required to execute the program, and time when the program is added to the first queue; detecting all plan items in the first queue, the first plan item among the plurality of plan items In the case where the execution time of the program in the program is less than or equal to the current system time, the corresponding program is found and executed by the ID of the program in the first plan item; the first plan item corresponding to the executed program is from the first queue Removed.

Optionally, the computer terminal can include: one or more processors, memory, and transmission means.

The memory can be used to store the software program and the module, such as the method for acquiring the dynamic delay call of the control logic through the scheduling queue and the program instruction/module corresponding to the device, and the processor is stored in the memory by running the program. Software programs and modules to perform various functional applications and data processing, that is, to implement the above-described method of implementing dynamic delay calls of control logic through a scheduled queue. The memory may include a high speed random access memory, and may also include non-volatile memory such as one or more magnetic storage devices, flash memory, or other non-volatile solid state memory. In some examples, the memory can further include memory remotely located relative to the processor, which can be connected to the terminal over a network. Examples of such networks include, but are not limited to, the Internet, intranets, local area networks, mobile communication networks, and combinations thereof.

The above transmission device is for receiving or transmitting data via a network. Specific examples of the above network may include a wired network and a wireless network. In one example, the transmission device includes a Network Interface Controller (NIC) that can be connected to other network devices and routers via a network cable to communicate with the Internet or a local area network. In one example, the transmission device is a Radio Frequency (RF) module for communicating with the Internet wirelessly.

Specifically, the memory is used to store preset action conditions and information of the preset rights user, and an application.

The processor can call the memory stored information and the application by the transmitting device to execute the program code of the method steps of each of the alternative or preferred embodiments of the above method embodiments.

A person skilled in the art can understand that the computer terminal can also be a smart phone (such as an Android phone, an iOS phone, etc.), a tablet computer, an applause computer, and a mobile Internet device (MID), a PAD, and the like.

A person of ordinary skill in the art may understand that all or part of the steps of the foregoing embodiments may be completed by a program to instruct terminal device related hardware, and the program may be stored in a computer readable storage medium, and the storage medium may be Including: flash disk, read-only memory (ROM), random access memory (RAM), disk or optical disk.

Embodiments of the present invention also provide a storage medium. Optionally, in this embodiment, the foregoing storage medium may be used to save the program code executed by the method for implementing the dynamic delay call of the control logic by the scheduling queue provided by the foregoing method embodiment and the device embodiment.

Optionally, in this embodiment, the foregoing storage medium may be located in any one of the computer terminal groups in the computer network, or in any one of the mobile terminal groups.

Optionally, in the embodiment, the storage medium is configured to store program code for performing the step of adding at least one plan item to the first queue, wherein the plan item comprises at least one of the following: an ID of the program, The execution time of the program, the parameters required to execute the program, and the time at which the program is added to the first queue; the execution time of the program in the first plan item among the plurality of plan items is detected for all plan items in the first queue If the current system time is less than or equal to the current system time, the corresponding program is found and executed by the ID of the program in the first plan item; and the first plan item corresponding to the executed program is removed from the first queue.

Alternatively, in the present embodiment, the storage medium may also be arranged to store program code for obtaining various preferred or optional method steps provided by the method of dynamically delaying the call of the control logic to implement the control logic.

A method and apparatus for implementing dynamic delay invocation of control logic by a scheduling queue in accordance with the present invention is described above by way of example with reference to the accompanying drawings. However, those skilled in the art should understand that various improvements can be made to the method and apparatus for implementing the dynamic delay call of the control logic by the scheduling queue as described above. Therefore, the scope of the invention should be determined by the content of the appended claims.

For the convenience of description, the above devices are described separately by function into various units. Of course, the functions of each unit may be implemented in the same software or software and/or hardware when implementing the present application.

The various embodiments in the specification are described in a progressive manner, and the same or similar parts between the various embodiments may be referred to each other, and each embodiment focuses on the differences from the other embodiments. In particular, for the device embodiment, since it is basically similar to the method embodiment, the description is relatively simple, and the relevant parts can be referred to the description of the method embodiment. The device embodiments described above are merely illustrative, wherein the units described as separate components may or may not be physically separate, and the components displayed as units may or may not be physical units, ie may be located A place, or it can be distributed to multiple network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of the embodiment. Those of ordinary skill in the art can understand and implement without any creative effort.

The application can be described in the general context of computer-executable instructions executed by a computer, such as a program module. Generally, program modules include routines, programs, objects, components, data structures, and the like that perform particular tasks or implement particular abstract data types. The present application can also be practiced in distributed computing environments where tasks are performed by remote processing devices that are connected through a communication network. In a distributed computing environment, program modules can be located in both local and remote computer storage media including storage devices.

It should be noted that, in this context, relational terms such as "first" and "second" are used merely to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply these There is any such actual relationship or order between entities or operations. Rather, the term "comprises" or "comprises" or "comprises" or "comprising" or "comprising" or "comprises" Other elements listed, or elements that are inherent to such a process, method, device, unit, or device. An element that is defined by the phrase "comprising a singular" or "an" or "an"

The above description is only a specific embodiment of the present application, so that those skilled in the art can understand or implement the present application. Various modifications to these embodiments are obvious to those skilled in the art, and the general principles defined herein may be implemented in other embodiments without departing from the spirit or scope of the application. Therefore, The application is not limited to the embodiments shown herein, but rather the broadest scope consistent with the principles and novel features disclosed herein.

Claims

A method for implementing dynamic delay call of control logic by scheduling a queue, characterized in that a main program of a control system based on a computer or an MCU can implement dynamic delay call of control logic by establishing a plan queue and a corresponding management module And management, it includes:

(1) a scheduling queue for adding control logic in the control system that requires a delayed call to the planning queue as a planning item, wherein each of the planning items includes data elements: control logic ID, execution time , the parameters required to control the logic execution, and the timestamp added to the plan queue;

(2) a plan image, which is real-time dynamic mirror information of the plan queue, which records the complete content in the plan queue; the plan image is saved in the database or in the data file; the role of the plan image includes: as the plan Real-time backup of the queue, used to restore the information in the scheduled queue when the system is unexpectedly restarted;

(3) a patrol execution and synchronization module, configured to cyclically detect all the plan items recorded in the plan queue, and when the execution time of detecting a plan item mark is less than or equal to a current system time, the execution time The control logic described in the plan item less than or equal to the current system time will be executed and removed from the plan queue; the patrol execution and synchronization module will be responsible for synchronizing the information of the plan mirror and the plan queue; when the system is restarted, the patrol execution and The synchronization module is responsible for importing the content in the plan image into the newly created plan queue after the system restarts;

(4) a plan queue management module, according to the request of the control system main program: responsible for inserting the new plan item of the delay call control logic into the plan queue, responsible for modifying the information of the existing plan item, and responsible for deleting the unexecuted Plan items, responsible for querying information about existing plan items and responding to query requests.
The method for implementing dynamic delay invocation of control logic by a scheduling queue according to claim 1, wherein the method based on the dynamic delay of the control logic implemented by the scheduling queue and its management module itself can constitute the control A logic algorithm used by the system to perform automatic control tasks, which includes: when a certain control logic i is being called, if it is not yet possible to draw control conclusions based on the currently obtained related information, it may be based on the trend of existing information. The calculation determines a delay time for executing the control logic i again, so as to perform the second operation, or even more delay operations, until the control conclusion can be obtained according to the latest state information; thus, the simulation realizes manual execution. The second observation judges the logical analysis and calculation method of the control conclusion.
A method for implementing a dynamic delay call of a control logic by a plan queue, which is characterized by comprising:

Adding at least one plan item to the first queue, wherein the plan item includes at least one of: an ID of the program, an execution time of the program, a parameter required to execute the program, and a program added to the first queue time;

Detecting, in the first queue, all the plan items in the first plan item, if the execution time of the program in the first plan item of the plurality of plan items is less than or equal to the current system time, by using the program in the first plan item The ID finds its corresponding program and executes it;

The first plan item corresponding to the executed program is removed from the first queue.
The method of claim 3, wherein after adding the at least one plan item to the first queue, the method further comprises:

Synchronizing all plan items in the first queue to the second queue;

In the case of a system restart, all plan items in the second queue are added to the first queue.
The method of claim 3 or 4, wherein the step of adding the at least one plan item to the first queue comprises:

Detecting all plan items in the first queue;

Inserting the plan item to be added into the team of the first queue if the ID of the program of the first plan item in the first queue is different from the ID of the program of the plan item to be added tail;

In a case where the ID of the program of the first plan item in the first queue is the same as the ID of the program of the plan item to be added, the plan item to be added is processed according to the received instruction.
The method according to claim 5, wherein, in the case where the ID of the program of the first plan item in the first queue is the same as the ID of the program of the plan item to be added, according to the received The step of processing the planned item to be added includes:

If the received instruction is a delete instruction, deleting the first plan item, inserting the plan item to be added into a tail of the first queue;

Changing the data of the first plan item if the received instruction is a change instruction;

In the case that the received instruction is neither a delete instruction nor a change instruction, the plan item to be added is inserted into the tail of the first queue.
The method according to claim 3, wherein all the plan items in the first queue are detected, and the execution time of the program in the first plan item of the plurality of plan items is less than or equal to the current system time In the case, the steps of finding the corresponding program by the ID of the program in the first plan item and executing the steps include:

Detecting a plan item of the head in the first queue, and confirming that the plan item of the head in the first queue is the first plan item;

In a case where the execution time of the program in the first plan item is less than or equal to the current system time, the program is executed according to the parameters required to execute the program given in the first plan item.
The method according to claim 3, wherein all the plan items in the first queue are detected, and the execution time of the program in the first plan item of the plurality of plan items is less than or equal to the current system time After the program of the program in the first plan item is found and executed by the ID of the program in the first plan item, the method further includes:

Generating an execution time of the program again according to a parameter generated by executing the program;

Generating a new plan item according to the execution time of the program being executed again;

The new plan item is inserted into the tail of the first queue.
An apparatus for implementing dynamic delay invocation of control logic by a scheduling queue, comprising:

a plan queue management module, configured to add, to the plan queue, control logic that needs to be delayed in the control system as a plan item according to a request of the control system main program, where each of the plan items includes data elements: Logical ID, execution time, parameters required to control logic execution, timestamps added to the schedule queue;

a synchronization module, configured to synchronously record the complete content in the scheduled queue to the planned image in real time, and when the system is unexpectedly restarted, the synchronization module is further configured to import the content in the planned image into the newly established device after the system is restarted. a plan queue in which the plan image is saved in a database or in a data file;

a patrol execution module, configured to cyclically detect all the plan items recorded in the plan queue, and when the execution time of detecting a plan item mark is less than or equal to a current system time, executing the control logic is executed And removing the control logic from the scheduling queue;

The plan queue management module is further configured to modify information of an existing plan item, delete a plan item that has not been executed, and query information of an existing plan item and reply to the query request.
The device according to claim 9, wherein the device further comprises:

The processing module is configured to determine, when the control logic i is being called, if the control conclusion cannot be obtained according to the currently obtained related information, the extension of the control logic i can be determined according to the change trend of the existing information. Time, in order to perform the second operation, or even more delay operations, until the control conclusion can be drawn based on the latest status information.
An apparatus for implementing dynamic delay invocation of control logic by a scheduling queue, wherein the apparatus comprises:

Adding a module for adding at least one plan item to the first queue, wherein the plan item includes at least one of the following: an ID of the program, an execution time of the program, a parameter required to execute the program, and a program added to the program The time of the first queue;

a detecting module, configured to detect all plan items in the first queue, and pass the first plan if an execution time of a program in a first plan item of the plurality of plan items is less than or equal to a current system time The ID of the program in the item finds its corresponding program and executes it;

And removing the module, configured to remove the first plan item corresponding to the executed program from the first queue.
The device according to claim 11, wherein the device further comprises:

a synchronization module, configured to synchronize all the plan items in the first queue to the second queue;

And a recovery module, configured to add all the plan items in the second queue to the first queue in case of a system restart.
The device according to claim 11 or 12, wherein the adding module comprises:

a first sub-detection module, configured to detect all plan items in the first queue;

a sub-addition module, configured to insert the plan item to be added into the office if the ID of the program of the first plan item in the first queue is different from the ID of the program of the plan item to be added Said the tail of the first queue;

a sub-processing module, configured to process the to-be-added according to the received instruction if the ID of the program of the first plan item in the first queue is the same as the ID of the program of the plan item to be added Plan item.
The device according to claim 13, wherein the sub-processing module comprises:

a sub-delete module, configured to delete the first plan item and insert the plan item to be added into a tail of the first queue if the received instruction is a delete instruction;

a sub-change module, configured to change data of the first plan item if the received instruction is a change instruction;

a sub-insert module, configured to insert the plan item to be added into the tail of the first queue if the received instruction is neither a delete instruction nor a change instruction.
The device according to claim 11, wherein the detecting module comprises:

a second sub-detection module, configured to detect a plan item of the head in the first queue, and confirm that a plan item of the head in the first queue is the first plan item;

a sub-execution module, configured to: when the execution time of the program in the first plan item is less than or equal to a current system time, run the parameter according to the required parameter of the execution program given in the first plan item program.
The device according to claim 11, wherein the device further comprises:

a first generation module, configured to generate an execution time of the program again according to a parameter generated by executing the program;

a second generating module, configured to generate a new plan item according to the execution time of the program being executed again;

Inserting a module for inserting the new plan item into the tail of the first queue.