Execution list merging method and device, equipment and storage medium

Abstract

The invention discloses an execution list merging method and device, equipment and a storage medium, relates to the technical field of automation, and discloses an execution list merging method which comprises the steps that in response to a trigger request for receiving a to-be-merged list, the remaining duration for triggering a recent event in the current execution list is checked; judging whether the residual duration is smaller than a merging duration of a preset merging period or not; if it is determined that the time length is less than the merging time length, delaying the trigger time of each event to be merged in the list to be merged based on the merging time length, and determining a corresponding delay time; and in a preset merging period, according to the delay time, merging the to-be-merged events into a current execution list. Namely, the triggering time of each to-be-merged event is delayed through the set merging duration of the preset merging period, so that the certainty of the triggering time of each to-be-merged event is ensured, and then in the preset merging period, the to-be-merged events are merged into the to-be-executed list according to the triggering time, so that the resource access conflict generated in the merging process is avoided.

Description

Technical Field

[0001] The present application relates to the field of automation technology, and in particular to a method, device, equipment and storage medium for merging execution lists. Background Art

[0002] In automation scenarios, in order to improve resource utilization, new lists are usually merged into the executing list.

[0003] Since the time required to insert a new execution list into the executing list is uncertain, inserting a new execution list into an execution list while it is being executed in chronological order will destroy the integrity of the resources of the executing list due to the uncertainty of the insertion time, causing access conflicts of shared resources.

[0004] The above contents are only used to assist in understanding the technical solution of the present application and do not constitute an admission that the above contents are prior art. Summary of the invention

[0005] The main purpose of the present application is to provide a method for merging execution lists, aiming to solve the technical problems of uncertainty in the insertion time, destruction of the integrity of the resources in the execution list, and induction of access conflicts of shared resources.

[0006] To achieve the above object, the present application proposes a method for merging execution lists, the method comprising:

[0007] In response to receiving a trigger request for the list to be merged, checking the remaining time for triggering the most recent event in the current execution list;

[0008] Determine whether the remaining time is less than the combined time of the preset combined period;

[0009] If it is determined that it is less than the merging time, then based on the merging time, the triggering time of each event to be merged in the list to be merged is postponed to determine the corresponding postponed time;

[0010] Within the preset merging period, each of the to-be-merged events is merged into the current execution list according to the postponed time.

[0011] In one embodiment, the step of merging each of the to-be-merged events into the current execution list according to the postponed time includes:

[0012] According to the postponed time, the corresponding event to be merged is inserted into the current execution list to obtain a merged list;

[0013] According to the event time of the merged list, screening each to-be-triggered event triggered after the preset merge period from the merged list;

[0014] Resources are allocated to each of the events to be triggered, so as to complete merging of each of the events to be merged into the current execution list.

[0015] In one embodiment, if the most recent event needs to be triggered within the preset merging period, the step of filtering the events to be triggered after the preset merging period from the merging list according to the event time of the merging list includes:

[0016] The latest event is triggered at a triggering time point of the latest event based on the allocated resources allocated for the latest event before the preset merging period.

[0017] In one embodiment, if it is determined that the time is less than the merging time, then based on the merging time, the triggering time of each event to be merged in the list to be merged is postponed, and after the step of determining the corresponding postponed time, the step further includes:

[0018] Obtaining the duration of the preset merging cycle in real time;

[0019] When the duration is equal to the merging duration, the action of merging the to-be-merged event into the current execution list is terminated.

[0020] In one embodiment, when the duration is equal to the merging duration, after the step of ending the action of merging the to-be-merged event into the current execution list, the method further includes:

[0021] According to the event time of the merged list, the to-be-triggered events of the merged list are triggered in sequence, and the merged list is a list obtained after the to-be-merged events are merged with the current execution list.

[0022] In one embodiment, after the step of determining whether the remaining duration is less than the combined duration of the preset combined period, the step further includes:

[0023] If it is determined that the remaining duration is greater than or equal to the merging duration of the preset merging period, the original triggering time of each event to be merged in the list to be merged is retrieved from the list to be merged;

[0024] According to the original triggering time, each of the merged events is merged into the current execution list.

[0025] In addition, to achieve the above-mentioned purpose, the present application also proposes a device for merging execution lists, and the device for merging execution lists includes:

[0026] A checking module, configured to check the remaining time for triggering the most recent event in the current execution list in response to receiving a trigger request for the list to be merged;

[0027] A judging module, used to judge whether the remaining time is less than the combined time of a preset combined period;

[0028] A postponement module, configured to postpone the triggering time of each event to be merged in the to-be-merged list based on the merge duration, and determine a corresponding postponed time if it is determined that the triggering time is less than the merge duration;

[0029] A merging module is used to merge each of the to-be-merged events into the current execution list according to the postponed time within the preset merging period.

[0030] In addition, to achieve the above-mentioned purpose, the present application also proposes a device for merging execution lists, the device comprising: a memory, a processor, and a computer program stored in the memory and executable on the processor, the computer program being configured to implement the steps of the method for merging execution lists as described above.

[0031] In addition, to achieve the above-mentioned purpose, the present application also proposes a storage medium, which is a computer-readable storage medium, and a computer program is stored on the storage medium. When the computer program is executed by the processor, the steps of the execution list merging method as described above are implemented.

[0032] In addition, to achieve the above-mentioned purpose, the present application also provides a computer program product, which includes a computer program, and when the computer program is executed by a processor, the steps of the execution list merging method as described above are implemented.

[0033] One or more technical solutions proposed in this application have at least the following technical effects:

[0034] Since each event in the current execution list has been allocated the resources required for triggering, in order to avoid interfering with the most recent event in the current execution list during the list merging process, in response to receiving a trigger request for the list to be merged, the remaining time for triggering the most recent event in the current execution list is first checked. When it is determined that the remaining time is less than the preset merging time, it means that the remaining time cannot meet the time requirement for merging the list to be merged with the current execution list. Therefore, the triggering time of each event to be merged in the list to be merged is postponed according to the preset merging time, and the merging time of the preset merging period is set as the fixed time required for the list merging, so as to delay the triggering time of each event to be merged according to the fixed time, and ensure the certainty of the original triggering time of each event to be merged, and then merge the event to be merged into the list to be executed within the preset merging period according to the triggering time, so as to avoid the triggering time of the event to be merged and the most recent event overlapping during the list merging process, thereby avoiding the destruction of the integrity of the resources of the list being executed, thereby avoiding resource access conflicts during the merging process. BRIEF DESCRIPTION OF THE DRAWINGS

[0035] The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present application and, together with the description, serve to explain the principles of the present application.

[0036] In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, for ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative labor.

[0037] Figure 1 A flowchart of the first embodiment of the method for merging execution lists of the present application is provided;

[0038] Figure 2 A schematic diagram of a list merging scenario provided for the list merging method of the present application;

[0039] Figure 3 A schematic diagram of the network topology of each module in the automation controller provided for the method of merging the lists of the present application;

[0040] Figure 4 A flowchart diagram of the second embodiment of the method for merging execution lists of the present application is provided;

[0041] Figure 5 A flowchart diagram of the second embodiment of the method for merging execution lists of the present application is provided;

[0042] Figure 6 A schematic diagram of the module structure of a device for merging execution lists according to an embodiment of the present application;

[0043] Figure 7 A schematic diagram of the device structure of the hardware operating environment involved in the execution list merging method in the embodiment of the present application.

[0044] The realization of the purpose, functional features and advantages of this application will be further explained in conjunction with embodiments and with reference to the accompanying drawings. DETAILED DESCRIPTION

[0045] It should be understood that the specific embodiments described herein are only used to explain the technical solutions of the present application and are not used to limit the present application.

[0046] In order to better understand the technical solution of the present application, a detailed description will be given below in conjunction with the accompanying drawings and specific implementation methods.

[0047] The main solution of the embodiment of the present application is: the automation controller checks the remaining time for triggering the most recent event in the current execution list in response to receiving a trigger request for the list to be merged; determines whether the remaining time is less than the merge time of a preset merge period; if it is determined to be less than the merge time, then based on the merge time, postpones the trigger time of each event to be merged in the list to be merged, and determines the corresponding postponed time; within the preset merge period, merges each event to be merged into the current execution list according to the postponed time.

[0048] In this embodiment, for ease of description, the following description is made with reference to the execution subject of the automation controller.

[0049] Since the time required to insert a new execution list into the executing list is uncertain, inserting a new execution list into an execution list while it is being executed in chronological order will destroy the integrity of the resources of the executing list due to the uncertainty of the insertion time, causing access conflicts of shared resources.

[0050] The present application provides a solution. Since each event in the current execution list has allocated the resources required for triggering, in order to avoid interfering with the most recent event in the current execution list during the list merging process, in response to receiving a trigger request for the list to be merged, the remaining time for triggering the most recent event in the current execution list is first checked. When it is determined that the remaining time is less than the preset merging time, it means that the remaining time cannot meet the time requirement for merging the list to be merged with the current execution list. Therefore, the triggering time of each event to be merged in the list to be merged is postponed according to the preset merging time, and the merging time of the preset merging period is set as the fixed time required for the list merging, so as to delay the triggering time of each event to be merged according to the fixed time, and ensure the certainty of the original triggering time of each event to be merged, and then merge the event to be merged into the list to be executed within the preset merging period according to the triggering time, so as to avoid the triggering time of the event to be merged and the most recent event overlapping during the list merging process, thereby avoiding the destruction of the integrity of the resources of the list being executed, thereby avoiding resource access conflicts during the merging process.

[0051] It should be noted that the execution subject of this embodiment may be a computing service device with data processing, network communication and program running functions, such as a tablet computer, a personal computer, a mobile phone, etc., or an electronic device capable of realizing the above functions, an automation controller, etc. The following takes the automation controller as an example to illustrate this embodiment and the following embodiments.

[0052] Based on this, the embodiment of the present application provides a method for merging execution lists, referring to Figure 1 , Figure 1 This is a flowchart of the first embodiment of the method for merging execution lists of the present application.

[0053] In this embodiment, the execution list merging method includes steps S10 to S40:

[0054] Step S10, in response to receiving a trigger request for the list to be merged, checking the remaining time for triggering the most recent event in the current execution list;

[0055] It should be noted that the list to be merged is a trigger sequence list of events to be merged arranged in chronological order. The list to be merged can be one or more, depending on the actual situation. The trigger request is a signal or instruction that requires the list to be merged. Its function is to start the process of performing related operations on the list to be merged. When the automation controller receives this trigger request, it will start to check the remaining duration of the most recent event in the current execution list and other operations, which can be regarded as the trigger point for the start of the entire merging process. The current execution list is a list of events that are being executed or will be executed in a certain order, including events that have been completed, are being executed, and are about to be executed, and the events therein have a certain trigger order and execution logic. The most recent event is an event that is about to occur or is occurring in the current execution list. The remaining duration is the duration from the current moment to the triggering of the most recent event in the current execution list.

[0056] It is understandable that since the lists are merged from the current moment to before the most recent event in the currently executed list is triggered, when the remaining time for triggering the most recent event is less than the time required for merging, the first event in the list to be merged will compete with the most recent event for resources, resulting in an access conflict to shared resources. Therefore, after responding to the trigger request, it is necessary to check the remaining time for triggering the most recent event in the currently executed list to subsequently determine whether the list to be merged needs to be processed to avoid resource access conflicts during the merging process.

[0057] Step S20, determining whether the remaining time is less than the combined time of the preset combined period;

[0058] It should be noted that the preset merging period is a pre-estimated time required for list merging based on the number of events to be merged in the list to be merged. The merging time is the length of a preset merging period, that is, the total time for list merging.

[0059] It is understandable that since the time required to merge an event is almost constant, a merging cycle can be determined based on the number of events to be merged, and the time required to merge the list can be determined by the preset merging cycle, thereby ensuring the certainty of the execution time of each event to be triggered in the new list after the merger.

[0060] It can be understood that since the list merging cycle (preset merging cycle) is determined, when merging the list to be merged into the current execution list, there will be no uncertainty in the time required for the list merging, thereby avoiding the uncertainty of the time of executing the first event to be merged in the list to be merged.

[0061] It can be understood that by judging whether the remaining time is less than the merge time of the preset merge cycle, it is possible to judge whether the time from the current moment to the triggering of the most recent event can complete the merging of the lists. And because the merging of lists requires reintegration of resources and allocation of resources for the merged events to be triggered, if the remaining time is less than the merge time and the list to be merged is not processed, the events to be merged in the list to be merged will be triggered within the preset merge list cycle, thereby snatching the resources of the currently executing list. Therefore, judging the remaining time and the merge time before merging the lists can facilitate the subsequent reasonable arrangement of the triggering time of the events to be merged, avoid resource conflicts and waste, and thus improve event processing efficiency.

[0062] In a specific implementation, the remaining duration may be greater than or equal to the combined duration, or the remaining duration may be less than the combined duration.

[0063] Furthermore, step S20 further includes:

[0064] If it is determined that the remaining duration is greater than or equal to the merging duration of the preset merging period, the original triggering time of each event to be merged in the list to be merged is retrieved from the list to be merged;

[0065] According to the original triggering time, each of the merged events is merged into the current execution list.

[0066] It should be noted that the pending events are events in the pending list that need to be merged into the current execution list. The original triggering time is the time when each pending event needs to be executed, that is, the triggering time when the pending events are not postponed.

[0067] It is understandable that when the remaining duration is greater than or equal to the merge duration of the preset merge cycle, directly merging the events to be merged in the list to be merged into the current execution list will not affect the untriggered events in the current execution list. Therefore, each event to be merged can be inserted into the current execution list according to the original triggering time of the event to be merged in the list to be merged, and resources can be reasonably allocated to each event to be merged and the untriggered events to avoid resource grabbing, thereby avoiding resource access conflicts during the merging process.

[0068] In the specific implementation, refer to Figure 2, if a request to trigger ListB (list to be merged) is received at the 15th millisecond, and the remaining time required to trigger ListA (current execution list) in ListA is 5 milliseconds, if the merging time of the preset merging cycle is less than or equal to 5 milliseconds, it means that the merging of the lists can be completed within the remaining time and will not affect the triggering of the most recent event (item3). Therefore, each merged event can be merged into the current execution list according to the original triggering time of each event to be merged in the list to be merged.

[0069] Step S30: If it is determined that the time is less than the merging time, based on the merging time, the triggering time of each event to be merged in the list to be merged is postponed to determine the corresponding postponed time;

[0070] It can be understood that when the remaining time is less than the merge time, in order to enable each event to be merged in the list to be merged to be triggered after the list merge is completed, so as to avoid resource access conflicts caused by triggering the list to be merged during the merging process, therefore, when it is determined that the remaining time is less than the merge time, it is necessary to postpone the triggering time of each event to be merged according to the merge time to ensure that each event to be merged is triggered after the list merge is completed.

[0071] It can be understood that since the resources for the event have already been allocated when the event in the current execution list is triggered within the preset merging cycle, the event in the current execution list can be triggered normally within the preset merging cycle, and the triggering time of each event to be merged in the list to be merged can be postponed by the merging duration to obtain the postponed time, thereby avoiding occupying the resources for triggering the event in the current execution list within the preset merging cycle.

[0072] In the specific implementation, refer to Figure 2 If a trigger request is received at the 15th millisecond, and the merging duration of the preset merging cycle is set to 10 milliseconds, and the time from the current moment to the triggering of the most recent event (item3) is detected to be 5 milliseconds, it is determined that the list merging cannot be completed within the remaining time. Therefore, it is necessary to postpone the triggering time of each event to be merged in ListB by the merging time, that is, postpone the triggering time of each first event to be merged (item1) in ListB to the 15th millisecond, and the triggering time of the remaining events to be merged is also postponed by 10 milliseconds.

[0073] Step S40: within the preset merging period, according to the postponed time, merge each of the to-be-merged events into the current execution list.

[0074] It can be understood that since the preset merging period is determined based on the total duration of merging each event to be merged, that is, the merging duration of the preset merging period is at least equal to the total duration, and can also be greater than the total duration, to ensure that each event to be merged can be merged into the current execution list within the preset merging period, thereby determining the merged list.

[0075] It can be understood that since the postponed time is the time when each time to be merged is triggered after the merging time is postponed, and the postponed time is fixed, the certainty of the execution time of the new list can be guaranteed, the list to be merged can be dynamically merged into the current execution list being executed, and the corresponding event can be accurately triggered at the determined postponed time, thereby ensuring the stability and certainty of the operation of the automation equipment.

[0076] In the specific implementation, refer to Figure 3 , the automation controller may include a trigger module, a merging module, a timing module and a time management module (not shown in the figure). When the trigger module detects that a new list (list to be merged) needs to be executed, it queries the remaining time of the latest event in the current execution list, and determines whether the remaining time is less than the merging time of the preset merging cycle. When it is determined that the remaining time is less than the merging time, the trigger time of each event to be merged in the list to be merged is postponed (a fake triggering time is added), and the merging module is notified to perform a merging operation to merge the events to be merged in the list to be merged into the current execution list. After the merging is completed, the timing module and the time management module are used to remind the trigger module to trigger the corresponding event on time.

[0077] The present embodiment provides a method for merging execution lists. Since each event in the current execution list has been allocated with the resources required for triggering, in order to avoid interfering with the most recent event in the current execution list during the list merging process, in response to receiving a trigger request of the list to be merged, the remaining time for triggering the most recent event in the current execution list is first checked. When it is determined that the remaining time is less than the preset merging time, it means that the remaining time cannot meet the time requirement for merging the list to be merged with the current execution list. Therefore, the triggering time of each event to be merged in the list to be merged is postponed according to the preset merging time. The merging time of the preset merging period is set as the fixed time required for the list merging, so as to delay the triggering time of each event to be merged according to the fixed time, and ensure the certainty of the original triggering time of each event to be merged. Then, within the preset merging period, the event to be merged is merged into the list to be executed according to the triggering time, so as to avoid the triggering time of the event to be merged and the most recent event overlapping during the list merging process, thereby avoiding the destruction of the integrity of the resources of the list being executed, thereby avoiding the generation of resource access conflicts during the merging process.

[0078] Based on the first embodiment of the present application, in the second embodiment of the present application, the same or similar contents as those in the above-mentioned embodiment 1 can refer to the above introduction, and will not be repeated later. Figure 4 , step S40 also includes steps S41 to S43:

[0079] Step S41, inserting the corresponding event to be merged into the current execution list according to the postponed time to obtain a merged list;

[0080] Step S42, screening each to-be-triggered event triggered after the preset merging period from the merging list according to the event time of the merging list;

[0081] Step S43: Allocate resources for each of the events to be triggered, so as to complete merging of each of the events to be merged into the current execution list.

[0082] It should be noted that the merged list is a list obtained by inserting the events to be merged into the current execution list. At this time, resources are not reallocated to the events in the list. The events to be triggered include the events in the current execution list and the events to be merged.

[0083] It is understandable that since no resources are allocated to the events to be merged, in order to avoid the event to be merged not snatching the resources required to trigger the events in the current execution list after the event to be merged is inserted into the current execution list, it is necessary to insert the event to be merged into the current execution list and allocate resources to the events in the merged list after obtaining the merged list.

[0084] It can be understood that since the events that need to be triggered within the preset merge cycle are all events in the current execution list, and the resources required to trigger each event in the current execution list have been allocated before the preset merge cycle, in order to ensure that the events that need to be triggered within the preset merge cycle can be triggered normally on time, and to ensure that the resource allocation for the events to be merged can be completed within the preset merge cycle, it is necessary to filter out the events to be triggered that need to be triggered after the preset merge cycle from the merge list to reallocate resources for the events to be triggered.

[0085] In the specific implementation, each event to be merged is inserted into the current execution list at the time corresponding to the postponed time to obtain a merged list, and then according to the event time of each event in the merged list, the events to be triggered after the preset merge period are filtered out from the merged list, and resources are allocated to the events to be triggered to complete the merging of each event to be merged into the current execution list.

[0086] Furthermore, if the most recent event needs to be triggered within the preset merging period, before step S42, the following steps are further included:

[0087] The latest event is triggered at a triggering time point of the latest event based on the allocated resources allocated for the latest event before the preset merging period.

[0088] It should be noted that the allocated resources are the resources allocated to the events in the current execution list before the preset merging cycle. The latest event can be one or more.

[0089] It can be understood that since the event that needs to be triggered in the preset merging cycle is the most recent event in the current execution list, in order to ensure that the most recent event can be triggered smoothly, when allocating resources for the events in the merged list, the resources allocated for the most recent event are retained to ensure that the triggering of the most recent event will not be affected when the list is merged within the preset merging cycle.

[0090] Based on the first and second embodiments of the present application, in the third embodiment of the present application, the same or similar contents as those in the above embodiments can be referred to the above introduction, and will not be described in detail later. Figure 5 After step S30, the execution list merging method further includes steps S01 to S02:

[0091] Step S01, obtaining the duration of the preset merging cycle in real time;

[0092] Step S02, when the duration is equal to the merging duration, the action of merging the to-be-merged event into the current execution list ends.

[0093] It can be understood that when the duration is equal to the merge duration, it means that the merging of the lists has been completed. In order to ensure that the subsequent triggered events in the merged list can be smoothly executed, the merging action of the lists is automatically stopped when the duration of the preset merging cycle is equal to the merging duration, thereby avoiding the risk of processing delays or loss of important events caused by excessive merging.

[0094] In a specific implementation, when the time management module detects that the list is in a preset merging period, the duration of the preset merging period is accumulated, and when the duration is greater than 10ms, the merging period is exited, and the merging process is completed.

[0095] Since the merged list will only change the task events after 10ms in the current execution list, the task events before 10ms in the current execution list are executed within the preset merge cycle. Therefore, there is no access to the same resource and no access conflict. The list to be merged after the preset merge cycle has been merged with the current execution list. The timing module will trigger the first task event of the new list on time at 10ms, thus ensuring the certainty of the execution time of the new list.

[0096] Furthermore, after step S02, the execution list merging method further includes:

[0097] According to the event time of the merged list, the to-be-triggered events of the merged list are triggered in sequence, and the merged list is a list obtained after the to-be-merged events are merged with the current execution list.

[0098] It should be noted that the event time is the triggering time of each event after the list is merged.

[0099] It is understandable that, since the triggering time of each to-be-triggered event in the combined list is determined, the corresponding event can be triggered on time according to the triggering time to ensure the stability and certainty of the operation of the automation equipment.

[0100] In the specific implementation, refer to Figure 2 , the time management module is triggered at 20ms to remind the trigger module to trigger item2 in ListA, and detects that the list is in the preset merge cycle. At this time, the second trigger event (item2) in ListA will be executed. It should be noted that since the list to be merged is merged into the current execution list and item2 in ListA is not changed, there will be no resource access conflict for item2 in ListA; and the time management module will be triggered at 25ms to remind the trigger module to trigger item1 in the list to be merged, so as to trigger the first event "item1" in ListB on time; since the accumulated time of the time management module at this time is greater than or equal to 10ms, it is necessary to exit the merge cycle, thus completing the entire merging process of the new and old lists. This process not only ensures the time certainty of the execution of the first event "item1" in ListB, but also ensures the resource integrity when the AB lists are merged.

[0101] It should be noted that the above examples are only used to understand the present application and do not constitute a limitation on the method of merging the execution lists of the present application. More simple transformations based on this technical concept are all within the scope of protection of the present application.

[0102] This application also provides a merging device for executing lists, please refer to Figure 6 , the execution list merging device includes:

[0103] A checking module 10, configured to check the remaining time for triggering the most recent event in the current execution list in response to receiving a trigger request for the list to be merged;

[0104] A judging module 20 is used to judge whether the remaining time is less than the combined time of a preset combined period;

[0105] The postponement module 30 is used to postpone the triggering time of each event to be merged in the to-be-merged list based on the merge duration if it is determined that the time is less than the merge duration, and determine the corresponding postponed time;

[0106] The merging module 40 is used to merge each of the to-be-merged events into the current execution list according to the postponed time within the preset merging period.

[0107] Optionally, the merging module 40 is also used to insert the corresponding events to be merged into the current execution list according to the postponed time to obtain a merged list; filter out the events to be triggered that are triggered after the preset merging period from the merged list according to the event time of the merged list; and allocate resources to each of the events to be triggered to complete the merging of each of the events to be merged into the current execution list.

[0108] Optionally, if the latest event needs to be triggered within the preset merging period, the merging module 40 is further configured to trigger the latest event at the triggering time point of the latest event based on the allocated resources allocated for the latest event before the preset merging period.

[0109] Optionally, the postponement module 30 is further used to obtain the duration of the preset merging cycle in real time; when the duration is equal to the merging duration, end the action of merging the to-be-merged event into the current execution list.

[0110] Optionally, the deferral module 30 is further configured to trigger the to-be-triggered events in the merged list in sequence according to the event times of the merged list, wherein the merged list is a list obtained after the to-be-merged events are merged with the current execution list.

[0111] Optionally, the merging module 40 is also used to retrieve the original trigger time of each event to be merged in the list to be merged from the list to be merged if it is determined that the remaining duration is greater than or equal to the merging duration of the preset merging period; and merge each of the merged events into the current execution list according to the original trigger time.

[0112] The execution list merging device provided by the present application adopts the execution list merging method in the above embodiment, which can solve the technical problems of uncertainty in the insertion time, destruction of the integrity of the resources in the execution list, and conflict in access to shared resources. Compared with the prior art, the beneficial effects of the execution list merging device provided by the present application are the same as the beneficial effects of the execution list merging method provided by the above embodiment, and the other technical features in the execution list merging device are the same as the features disclosed in the above embodiment method, which will not be repeated here.

[0113] The present application provides a device for merging execution lists, the device for merging execution lists comprising: at least one processor; and a memory communicatively connected to the at least one processor; wherein the memory stores instructions executable by the at least one processor, and the instructions are executed by the at least one processor so that the at least one processor can execute the method for merging execution lists in the above-mentioned embodiment one.

[0114] Reference below Figure 7 , which shows a schematic diagram of the structure of a merging device for implementing the execution list of the embodiment of the present application. The merging device for the execution list in the embodiment of the present application may include but is not limited to mobile terminals such as mobile phones, laptop computers, digital broadcast receivers, PDAs (Personal Digital Assistants), PADs (Portable Application Descriptions), PMPs (Portable Media Players), vehicle-mounted terminals (such as vehicle-mounted navigation terminals), etc., and fixed terminals such as digital TVs, desktop computers, etc. Figure 7 The merging device of the execution list shown is only an example and should not bring any limitation to the functions and scope of use of the embodiments of the present application.

[0115] like Figure 7As shown, the merging device for executing the list may include a processing device 1001 (e.g., a central processing unit, a graphics processor, etc.), which can perform various appropriate actions and processes according to a program stored in a read-only memory (ROM: Read Only Memory) 1002 or a program loaded from a storage device 1003 to a random access memory (RAM: Random Access Memory) 1004. In RAM1004, various programs and data required for the operation of the merging device for executing the list are also stored. The processing device 1001, ROM1002, and RAM1004 are connected to each other through a bus 1005. An input / output (I / O) interface 1006 is also connected to the bus. Generally, the following systems can be connected to the I / O interface 1006: an input device 1007 including, for example, a touch screen, a touch pad, a keyboard, a mouse, an image sensor, a microphone, an accelerometer, a gyroscope, etc.; an output device 1008 including, for example, a liquid crystal display (LCD: Liquid Crystal Display), a speaker, a vibrator, etc.; a storage device 1003 including, for example, a magnetic tape, a hard disk, etc.; and a communication device 1009. The communication device 1009 can allow the merging device for executing the list to communicate with other devices wirelessly or by wire to exchange data. Although the figure shows the merging device for executing the list with various systems, it should be understood that it is not required to implement or have all the systems shown. More or fewer systems can be implemented or have alternatively.

[0116] In particular, according to the embodiments disclosed in the present application, the process described above with reference to the flowchart can be implemented as a computer software program. For example, the embodiments disclosed in the present application include a computer program product, which includes a computer program carried on a computer-readable medium, and the computer program includes a program code for executing the method shown in the flowchart. In such an embodiment, the computer program can be downloaded and installed from a network through a communication device, or installed from a storage device 1003, or installed from a ROM 1002. When the computer program is executed by the processing device 1001, the above-mentioned functions defined in the method of the embodiment disclosed in the present application are executed.

[0117] The execution list merging device provided by the present application adopts the execution list merging method in the above embodiment, which can solve the technical problems of uncertainty in the insertion time, destruction of the integrity of the resources in the execution list, and conflict in access to shared resources. Compared with the prior art, the beneficial effects of the execution list merging device provided by the present application are the same as the beneficial effects of the execution list merging method provided by the above embodiment, and the other technical features in the execution list merging device are the same as the features disclosed in the method of the previous embodiment, which will not be repeated here.

[0118] It should be understood that the various parts disclosed in this application can be implemented by hardware, software, firmware or a combination thereof. In the description of the above embodiments, specific features, structures, materials or characteristics can be combined in any one or more embodiments or examples in a suitable manner.

[0119] The above is only a specific implementation of the present application, but the protection scope of the present application is not limited thereto. Any person skilled in the art who is familiar with the present technical field can easily think of changes or substitutions within the technical scope disclosed in the present application, which should be included in the protection scope of the present application. Therefore, the protection scope of the present application should be based on the protection scope of the claims.

[0120] The present application provides a computer-readable storage medium having computer-readable program instructions (ie, computer programs) stored thereon, and the computer-readable program instructions are used to execute the execution list merging method in the above-mentioned embodiment.

[0121] The computer-readable storage medium provided in the present application may be, for example, a USB flash drive, but is not limited to electrical, magnetic, optical, electromagnetic, infrared, or semiconductor systems, systems or devices, or any combination of the above. More specific examples of computer-readable storage media may include, but are not limited to: an electrical connection with one or more wires, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above. In this embodiment, the computer-readable storage medium may be any tangible medium containing or storing a program that can be used by or in combination with an instruction execution system, system or device. The program code contained on the computer-readable storage medium may be transmitted using any appropriate medium, including but not limited to: wires, optical cables, RF (Radio Frequency), etc., or any suitable combination of the above.

[0122] The computer-readable storage medium may be included in the merging device for executing the list; or may exist independently without being assembled into the merging device for executing the list.

[0123] The above-mentioned computer-readable storage medium carries one or more programs. When the above-mentioned one or more programs are executed by the merging device of the execution list, the merging device of the execution list: in response to receiving a trigger request of the list to be merged, checks the remaining time for triggering the most recent event in the current execution list; determines whether the remaining time is less than the merging time of a preset merging period; if it is determined to be less than the merging time, then based on the merging time, postpones the triggering time of each event to be merged in the list to be merged, and determines the corresponding postponed time; within the preset merging period, merges each event to be merged into the current execution list according to the postponed time.

[0124] Computer program code for performing the operations of the present application may be written in one or more programming languages ​​or a combination thereof, including object-oriented programming languages ​​such as Java, Smalltalk, C++, and conventional procedural programming languages ​​such as "C" or similar programming languages. The program code may be executed entirely on the user's computer, partially on the user's computer, as a separate software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computer (e.g., via the Internet using an Internet service provider).

[0125] The flow chart and block diagram in the accompanying drawings illustrate the possible architecture, function and operation of the system, method and computer program product according to various embodiments of the present application. In this regard, each square box in the flow chart or block diagram can represent a module, a program segment or a part of a code, and the module, the program segment or a part of the code contains one or more executable instructions for realizing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the square box can also occur in a sequence different from that marked in the accompanying drawings. For example, two square boxes represented in succession can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each square box in the block diagram and / or flow chart, and the combination of the square boxes in the block diagram and / or flow chart can be implemented with a dedicated hardware-based system that performs a specified function or operation, or can be implemented with a combination of dedicated hardware and computer instructions.

[0126] The modules involved in the embodiments described in this application may be implemented by software or hardware, wherein the name of the module does not constitute a limitation on the unit itself in some cases.

[0127] The readable storage medium provided by the present application is a computer-readable storage medium, which stores computer-readable program instructions (i.e., computer programs) for executing the above-mentioned execution list merging method, and can solve the technical problems of uncertainty in the insertion time, destruction of the integrity of the resources of the execution list being executed, and causing access conflicts of shared resources. Compared with the prior art, the beneficial effects of the computer-readable storage medium provided by the present application are the same as the beneficial effects of the execution list merging method provided by the above-mentioned embodiment, and will not be repeated here.

[0128] The present application also provides a computer program product, including a computer program, wherein when the computer program is executed by a processor, the steps of the above-mentioned execution list merging method are implemented.

[0129] The computer program product provided by the present application can solve the technical problems of uncertainty in the insertion time, destruction of the integrity of the resources in the execution list, and conflict in access to shared resources. Compared with the prior art, the beneficial effects of the computer program product provided by the present application are the same as the beneficial effects of the execution list merging method provided by the above embodiment, which will not be elaborated here.

[0130] The above descriptions are only some embodiments of the present application, and are not intended to limit the patent scope of the present application. All equivalent structural changes made using the contents of the present application specification and drawings under the technical concept of the present application, or direct / indirect applications in other related technical fields are included in the patent protection scope of the present application.

Claims

1. A method for merging execution lists, characterized in that: The method includes: In response to receiving a trigger request for the list to be merged, checking the remaining time for triggering the most recent event in the current execution list; Determine whether the remaining time is less than the combined time of the preset combined period; If it is determined that it is less than the merging time, then based on the merging time, the triggering time of each event to be merged in the list to be merged is postponed to determine the corresponding postponed time; Within the preset merging period, each of the to-be-merged events is merged into the current execution list according to the postponed time.

2. The method according to claim 1, characterized in that The step of merging each of the to-be-merged events into the current execution list according to the postponed time includes: According to the postponed time, the corresponding event to be merged is inserted into the current execution list to obtain a merged list; According to the event time of the merged list, screening each to-be-triggered event triggered after the preset merge period from the merged list; Resources are allocated to each of the events to be triggered, so as to complete merging of each of the events to be merged into the current execution list.

3. The method according to claim 2, characterized in that If the most recent event needs to be triggered within the preset merging period, the step of screening the events to be triggered after the preset merging period from the merging list according to the event time of the merging list includes: The latest event is triggered at a triggering time point of the latest event based on the allocated resources allocated for the latest event before the preset merging period.

4. The method according to claim 1, characterized in that If it is determined that the time is less than the merging time, then based on the merging time, the triggering time of each event to be merged in the list to be merged is postponed, and after the step of determining the corresponding postponed time, the method further includes: Obtaining the duration of the preset merging cycle in real time; When the duration is equal to the merging duration, the action of merging the to-be-merged event into the current execution list is terminated.

5. The method according to claim 4, characterized in that After the step of ending the action of merging the to-be-merged event into the current execution list when the duration is equal to the merging duration, the following further comprises: According to the event time of the merged list, the to-be-triggered events of the merged list are triggered in sequence, and the merged list is a list obtained after the to-be-merged events are merged with the current execution list.

6. The method according to claim 1, characterized in that After the step of determining whether the remaining time is less than the combined time of the preset combined period, the following step further includes: If it is determined that the remaining duration is greater than or equal to the merging duration of the preset merging period, the original triggering time of each event to be merged in the list to be merged is retrieved from the list to be merged; According to the original triggering time, each of the merged events is merged into the current execution list.

7. A device for merging execution lists, characterized in that: The device comprises: A checking module, configured to check the remaining time for triggering the most recent event in the current execution list in response to receiving a trigger request for the list to be merged; A judging module, used to judge whether the remaining time is less than the combined time of a preset combined period; A postponement module, configured to postpone the triggering time of each event to be merged in the to-be-merged list based on the merge duration, and determine a corresponding postponed time if it is determined that the triggering time is less than the merge duration; A merging module is used to merge each of the to-be-merged events into the current execution list according to the postponed time within the preset merging period.

8. A device for merging execution lists, characterized in that: The device comprises: a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the computer program is configured to implement the steps of the execution list merging method according to any one of claims 1 to 6.

9. A storage medium, characterized in that: The storage medium is a computer-readable storage medium, and a computer program is stored on the storage medium. When the computer program is executed by a processor, the steps of the execution list merging method according to any one of claims 1 to 6 are implemented.

10. A computer program product, characterized in that The computer program product comprises a computer program, and when the computer program is executed by a processor, the steps of the method for merging execution lists according to any one of claims 1 to 6 are implemented.

Images