WO2021147382A1

WO2021147382A1 - Test task execution method and device

Info

Publication number: WO2021147382A1
Application number: PCT/CN2020/120885
Authority: WO
Inventors: 朱德铭
Original assignee: 上海万物新生环保科技集团有限公司
Priority date: 2020-01-21
Filing date: 2020-10-14
Publication date: 2021-07-29
Also published as: CN111309475B; CN111309475A

Abstract

The object of the present application is to provide a test task execution method and device. The present application comprises: acquiring relevant information about a plurality of test tasks to be executed, the relevant information comprising an execution safety point, an execution start point, a test time, and an execution end point; determining information about synchronous test and information about asynchronous test in said test tasks; determining, according to the relevant information about said test tasks, the information about synchronous test, and the information about asynchronous test, a basic time, a synchronous execution time and an asynchronous execution time consumed for executing each of said test tasks; and ordering all said test tasks according to the basic time, the synchronous execution time and the asynchronous execution time consumed for executing each of said test tasks, and putting said test tasks into a task execution queue. In this way, the optimal execution sequence of test tasks to be executed can be dynamically calculated on the basis of a start test path and an end test path and by comparing time consumption in a plurality of stages, so as to achieve the minimum global total time consumption.

Description

Method and equipment for executing detection task

Technical field

This application relates to the field of equipment detection, and in particular to a detection task execution method and equipment.

Background technique

In the detection process of the equipment, there are also a large number of detection tasks that need to be executed. The order of task execution and the time it takes affect the overall detection performance and the resources consumed. In the execution of multitasking, it is easy to repeat the mechanical movement path, The accumulation of tasks, processing delays, and the inability to arrange the execution order of the tasks to be executed reasonably will result in low resource scheduling efficiency, inability to give full play to the computing power of the detection equipment, resulting in excessive waiting time of the system and long detection process Long wait for the question.

Summary of the invention

One purpose of the present application is to provide a detection task execution method and device, which solves the problem that the execution sequence of the task to be executed cannot be dynamically calculated when the detection task is executed in the prior art.

According to one aspect of the present application, there is provided a detection task execution method, which includes:

Acquiring related information of multiple to-be-executed detection tasks, where the related information includes an execution safety point, an execution start point, a detection time, and an execution end point;

Determine the synchronous detection information and the asynchronous detection information in the detection task to be executed;

Determine the basic time, synchronous execution time, and asynchronous execution time consumed by the execution of each detection task to be executed according to the related information of the detection task, the synchronous detection information, and the asynchronous detection information;

According to the basic time, synchronous execution time and asynchronous execution time consumed by the execution of each detection task to be executed, all the detection tasks to be executed are arranged into the task execution queue.

Further, determining the synchronous detection information and the asynchronous detection information in the detection task to be executed includes:

Acquiring the execution relationship between all to-be-executed detection tasks, where the execution relationship includes a synchronous execution relationship and an asynchronous execution relationship;

The synchronous detection information and the asynchronous detection information are determined according to the execution relationship, wherein the synchronous detection information includes a synchronous detection task and related information of the synchronous detection task, and the asynchronous detection information includes an asynchronous detection task As well as information about asynchronous detection tasks.

Further, determining the basic time, synchronous execution time, and asynchronous execution time consumed by the execution of each detection task to be executed according to the related information of the detection task, the synchronous detection information, and the asynchronous detection information includes:

According to the related information of the detection task to be executed currently and the related information of the next detection task to be executed, it is determined whether the execution end point of the detection task to be executed currently is the same as the execution start point of the next detection task to be executed. At the same point, get the judgment result;

Determine the basic time consumed by the execution of the detection task currently to be executed according to the judgment result and the related information of the detection task currently to be executed, and repeat the above judgment process to determine the execution consumption of each detection task to be executed Basic time

Determining the synchronization execution time with any detection task to be executed in the synchronization execution relationship according to the detection time of the detection task currently to be executed and the synchronization detection information;

The asynchronous execution time between any detection task to be executed in the asynchronous execution relationship is determined according to the detection time of the detection task currently to be executed and the information of the asynchronous detection.

Further, determining the basic time consumed by the execution of the detection task currently to be executed according to the judgment result and the related information of the detection task currently to be executed includes:

If the judgment result is that the execution end point of the currently to-be-executed detection task is different from the execution start point of the next-to-be-executed detection task, then according to the execution safety point of the current to-be-executed detection task, The execution start point determines the first basic time consumed for execution;

According to the execution end point of the detection task currently to be executed and the execution safety point of the next detection task to be executed, the second basic time consumed between execution and the remaining detection task to be executed is determined.

Further, according to the basic time, synchronous execution time and asynchronous execution time consumed by the execution of each detection task to be executed, all the detection tasks to be executed are arranged into the task execution queue, including:

According to the first basic time, the second basic time, the synchronous execution time, and the asynchronous execution time, all to-be-executed detection tasks are arranged into a task execution queue.

Further, determining the basic time of the current to-be-detected task according to the judgment result and the relevant information of the current to-be-detected task includes:

If the judgment result is that the execution end point of the currently to-be-executed detection task is the same as the execution start point of the next-to-be-executed detection task, then the execution safety point of the current to-be-executed detection task is , The execution start point determines the basic time consumed for execution.

Determine the total execution consumption time of each detection task to be executed according to the basic time, synchronous execution time, and asynchronous execution time consumed by the execution of each detection task to be executed;

According to the total execution consumption time of each detection task to be executed, the time lengths are arranged in ascending order, and then they are placed in the task execution queue.

Prioritize selection of the basic time, synchronous execution time, and asynchronous execution time consumed by the execution of multiple to-be-executed detection tasks to sort the multiple to-be-executed detection tasks to obtain a sorted queue;

The remaining detection tasks to be executed are sequentially inserted into the sorting queue according to a preset insertion manner, and the task execution queue is obtained after the insertion of the last detection task to be executed is completed.

Further, the preset insertion manner includes:

Insert the detection tasks to be inserted into the sorting queue in turn into the insertion sites determined by the existing detection tasks to be executed, and obtain a new sorting queue corresponding to each insertion site;

Calculate the cumulative total execution time length of all the detection tasks to be executed in the new sorting queue corresponding to each insertion site, where the total execution time length is determined by the basic cost of the execution of the detection task to be executed. Time, synchronous execution time and asynchronous execution time are determined.

A new sorting queue corresponding to the shortest duration is selected according to all the accumulated total execution consumption time obtained by calculation, as the insertion result of inserting the detection task to be inserted into the sorting queue.

Further, the method further includes:

Group all the detection tasks to be executed according to the current operation status;

Determine the execution consumption time of each group according to the asynchronous execution time of each detection task to be executed in each group;

Each group is sorted according to the execution consumption time of each group, and the to-be-executed detection tasks in all the groups are sequentially executed in the sorted order.

According to another aspect of the present application, there is also provided a device for detecting task execution, and the device includes:

One or more processors; and

A memory storing computer-readable instructions, which when executed, cause the processor to perform operations as described in the foregoing method.

According to still another aspect of the present application, there is also provided a computer-readable medium having computer-readable instructions stored thereon, and the computer-readable instructions can be executed by a processor to implement the aforementioned method.

Compared with the prior art, this application obtains relevant information of multiple to-be-executed detection tasks, where the relevant information includes the execution safety point, the execution start point, the detection time, and the execution end point; determining the to-be-executed The information of synchronous detection and asynchronous detection in the detection task; the basic time consumed by the execution of each detection task to be executed is determined according to the related information of the detection task, the information of the synchronous detection and the information of the asynchronous detection, Synchronous execution time and asynchronous execution time; according to the basic time, synchronous execution time and asynchronous execution time consumed by the execution of each detection task to be executed, all the detection tasks to be executed are arranged into the task execution queue. Therefore, the optimal execution sequence of the detection task can be dynamically calculated based on the starting and ending path of the detection and the time-consuming comparison of multiple stages, so as to achieve the minimum overall time-consuming, improve task execution efficiency and allocate resources more reasonably.

Description of the drawings

By reading the detailed description of the non-limiting embodiments with reference to the following drawings, other features, purposes, and advantages of the present application will become more apparent:

Fig. 1 shows a schematic flowchart of a detection task execution method provided according to an aspect of the present application.

The same or similar reference signs in the drawings represent the same or similar components.

Detailed ways

The application will be further described in detail below in conjunction with the accompanying drawings.

In a typical configuration of this application, the terminal, the equipment of the service network, and the trusted party all include one or more processors (for example, a central processing unit (CPU)), input/output interfaces, network interfaces, and memory .

Memory may include non-permanent memory in computer readable media, random access memory (RAM) and/or non-volatile memory, such as read only memory (ROM) or flash memory (Read Only Memory). flash RAM). Memory is an example of computer readable media.

Computer-readable media include permanent and non-permanent, removable and non-removable media, and information storage can be realized by any method or technology. The information can be computer-readable instructions, data structures, program modules, or other data. Examples of computer storage media include, but are not limited to, Phase-Change RAM (PRAM), Static Random Access Memory (SRAM), and Dynamic Random Access Memory (DRAM) , Other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (Electrically Erasable Programmable Read-Only Memory, EEPROM), flash memory or other memory technologies, only CD-ROM (Compact Disc Read-Only Memory), Digital Versatile Disk (DVD) or other optical storage, magnetic cassette tape, magnetic tape disk storage or other magnetic storage devices or any other Non-transmission media that can be used to store information that can be accessed by computing devices. According to the definition in this article, computer-readable media does not include non-transitory computer-readable media (transitory media), such as modulated data signals and carrier waves.

Fig. 1 shows a schematic flow chart of a detection task execution method provided according to an aspect of the present application. The method includes: step S11 to step S14,

In step S11, obtain relevant information of a plurality of detection tasks to be executed, where the relevant information includes the execution safety point, the execution start point, the detection time, and the execution end point; in a detection application scenario, such as mobile phone The detection task can be the detection of the mobile phone camera, the detection of the installed application, and the unlocking detection. The execution safety point is a threshold point of the safety range determined to prevent the terminal device from colliding with the machine that detects the terminal device. During the detection process, no matter how the terminal device moves, it will not collide with the machine. Set the execution safety point, execution start point, execution process, and execution end point for each detection task to be executed, move the detection task from the execution safety point to the execution start point for detection, and complete the entire detection process when the execution reaches the end point , Get the detection time. When the detection task is completed, it will enter the execution safety point of the next detection task to be executed from the execution end point. It should be noted that the setting of the execution safety point can be set when the machine of the detection terminal device is configured, and it is determined according to the rotation information of the machine's axis control, and the execution start point is based on the time-consuming execution of the detection task. For setting, for example, it is better to set time-consuming within a certain value range, then the value can be the execution start point, and both the execution start point and the execution end point can be adjusted.

In step S12, the synchronous detection information and asynchronous detection information in the detection tasks to be executed are determined; here, when the execution order of all the detection tasks to be executed is determined, the execution order in the queue with the shortest execution time is selected, It is necessary to determine how long it takes from the execution of the current detection task to the next detection task. Among all the detection tasks to be executed, there are detection tasks to be executed that can be executed synchronously and detection tasks that are executed asynchronously, such as waiting The executed detection task is A, the to-be-executed detection tasks B and C that can be executed synchronously with it, and the to-be-executed detection tasks that are executed asynchronously with it are D and E. You need to determine the availability of each to-be-executed detection task. The information of the detection tasks that are executed synchronously and the information of the detection tasks that need to be executed asynchronously, that is, the classification of synchronization and asynchronous is performed, and the information of synchronous detection and the information of asynchronous detection are determined.

In step S13, the basic time, synchronous execution time, and asynchronous execution time consumed by the execution of each detection task to be executed are determined according to the related information of the detection task, the synchronous detection information, and the asynchronous detection information; Here, the basic time consumed by the execution of a detection task is the basic phase time required from the execution of the detection task to the next detection task. It does not change due to the execution of other detection tasks and whether they are executed synchronously or asynchronously. The time point set in the relevant information of the detection task is determined, such as the basic time consumed by the execution from the execution safety point to the execution start point. Through the related information of the detection task and the determined synchronous detection information corresponding to each to-be-executed detection task and the asynchronous detection information, it is possible to calculate the synchronization that needs to be consumed from one to-be-executed detection task to the next to-be-executed detection task. Execution time and asynchronous execution time.

Subsequently, in step S14, according to the basic time, synchronous execution time and asynchronous execution time consumed by the execution of each detection task to be executed, all the detection tasks to be executed are arranged into the task execution queue. Here, according to the calculated time required for each stage, all the inspection tasks to be executed are sorted according to the obtained time, and the sorting forms an ordered queue. If sorted according to the length of time, the shortest time-consuming order will be arranged. At the forefront, if the time required for detection task A to detection task B is the shortest, and detection task C is the second, then the order is A→B→C; sort all the inspection tasks to be executed according to the time-consuming order and finally get the task The execution queue, according to the task execution queue, executes the detection tasks in it. During the detection process, the task execution queue can also be adjusted according to the dynamic changes of the detection tasks to be executed. For example, the detection tasks to be executed need to be retried, or new detection tasks to be executed appear and the detection tasks need to be removed. For one or some of the detection tasks to be executed, the optimal task execution order can be dynamically calculated according to the current execution queue, so as to achieve the least overall time-consuming.

In this application, the execution safety point, execution start point, and execution end point of the execution task are set to determine the detection start and end path. Based on the detection start and end path, the mechanical movement time (basic time consumed for execution) and asynchronous calculation of the detection task are determined. Then, the optimal detection task execution sequence is calculated according to all the determined time-consuming.

In an embodiment of the present application, in step S12, the execution relationship between all to-be-executed detection tasks is acquired, where the execution relationship includes a synchronous execution relationship and an asynchronous execution relationship; the synchronous detection is determined according to the execution relationship Information and asynchronous detection information, wherein the synchronous detection information includes synchronous detection tasks and related information about the synchronous detection tasks, and the asynchronous detection information includes asynchronous detection tasks and related information about asynchronous detection tasks. Here, each to-be-executed detection task has other to-be-executed detection tasks that are executed synchronously and/or asynchronously with it, and the execution relationship between each to-be-executed detection task and other to-be-executed detection tasks is determined as What are the detection tasks that execute the relationship synchronously, and what are the detection tasks that execute the relationship asynchronously. According to the determined execution relationship, the classified information is obtained, that is, the synchronization detection information for the synchronization execution relationship is obtained. For example, if the synchronization execution step of detection task A is detection task B and detection task C, the synchronization detection information includes detection task A, Detection task B and detection task C itself, also include detection task A, related information of detection task B and related information of detection task C, that is, the execution safety point, execution start point, detection time, and execution end point of detection tasks B and C This information; similarly, asynchronous detection information includes the detection task itself and the related information of the detection task that is executed asynchronously. The execution relationship of each detection task to be executed is determined, and the corresponding synchronous detection information and asynchronous detection information are determined, so as to facilitate the subsequent calculation of the execution time consumption between each detection task to be executed.

In an embodiment of the present application, in step S13, it is determined whether the execution end point of the current detection task to be executed is the same as the execution end point of the current detection task to be executed according to the related information of the detection task to be executed currently and the related information of the next detection task to be executed. The execution start point of the next detection task to be executed is the same point, and the judgment result is obtained; according to the judgment result and the relevant information of the detection task to be executed currently, the basic cost of execution of the detection task to be executed is determined Time, repeat the above judgment process to determine the basic time consumed by the execution of each detection task to be executed; according to the detection time of the detection task currently to be executed and the information of the synchronization detection, determine any one of the relationship to be executed in the synchronization execution relationship The synchronous execution time between the detection tasks of the detection task; the asynchronous execution time between any detection task to be executed in the asynchronous execution relationship is determined according to the detection time of the detection task currently to be executed and the information of the asynchronous detection. Here, the detection task currently to be executed is the detection task that needs to be calculated and is time-consuming to execute. If it is necessary to calculate the time from detection task A to detection task B, then detection task A is the current detection task to be executed. B is the next detection task to be executed. According to the related information of detection task A and related information of detection task B, it is judged whether the execution end point of detection task A and the execution start point of detection task B are the same, so as to calculate the corresponding execution consumption of detection task A according to the judgment result. time. According to the basic time, synchronous execution time and asynchronous execution time required for each detection task to be executed, the execution sequence of each detection task to be executed is determined. For example, it is necessary to execute detection task A first and then execute detection task B. The time-consuming is T1, and the time-consuming to execute detection task B first and then detection task A needs to be T2. If T1<T2, the execution order can be determined as executing A first and then executing B.

In an embodiment of the present application, if the judgment result is that the execution end point of the currently to-be-executed detection task is different from the execution start point of the next-to-be-executed detection task, then according to the current to-be-executed The execution safety point and the execution start point of the detection task determine the first basic time consumed for execution; the execution end point of the current detection task to be executed and the execution safety point of the next detection task to be executed are determined and the remaining detections to be executed The second basic time consumed by the execution between tasks. Here, taking detection task A to detection task B as an example, if the execution end point of detection task A and the execution start point of detection task B are not the same point, the execution safety from the execution end point of A to B is consumed. Point time plus the time from the execution safety point of B to the execution start point of B. This period of time is used as the second basic time consumed by the execution of detection task A and then execution of detection task B. The original detection The execution safety point of task A to the execution start point of task A is regarded as the first basic time consumed for execution.

Following the above embodiment, according to the first basic time, the second basic time, the synchronous execution time, and the asynchronous execution time, all to-be-executed detection tasks are arranged into the task execution queue. Here, when the execution end point of the detection task A and the execution start point of the detection task B are not the same point, the total time required to execute the detection task A and then the detection task B is determined by the first basic time, The second basic time, the synchronous execution time corresponding to the detection task A and the detection task B, and the asynchronous execution time corresponding to the detection task A and the detection task B are determined; the consumption time is obtained according to the sequential execution between each two detection tasks to be executed Sort each detection task to be executed and put it into the task execution queue.

In yet another embodiment of the present application, if the judgment result is that the execution end point of the currently to-be-executed detection task is the same as the execution start point of the next-to-be-executed detection task, then according to the current The execution safety point and execution start point of the detection task to be executed determine the basic time consumed for execution. Here, taking the detection task A first and then the detection task B as an example, when the execution end point of the detection task A and the execution start point of the detection task B are the same point, then from the execution end point of the detection task A to the detection task The execution safety point of B and the time required from the execution safety point of detection task B to the execution start point of detection task B is 0. At this time, the basic time consumed by the execution required to execute A and then execute B is detection task A The execution safety point to the execution start point of detection task A.

In an embodiment of the present application, in step S14, the total execution consumption time of each detection task to be executed is determined according to the basic time, synchronous execution time, and asynchronous execution time of each detection task to be executed. ; According to the total execution consumption time of each detection task to be executed, the time length is arranged in ascending order, and then placed in the task execution queue after the arrangement. Here, the optimal task execution order is dynamically calculated by comparing the basic time consumed by execution, synchronous execution time, and asynchronous execution time, so as to achieve the minimum overall time consumption. For example, determine the total execution consumption time of the detection task A and then the detection task B, the total execution consumption time of the detection task A and then the detection task C, the total execution consumption time of the detection task B and then the detection task C, etc. , According to the total execution consumption time determined by the execution order between the detection tasks to be executed, all the detection tasks to be executed are arranged in ascending order, that is, the row with the shortest total execution consumption time is ranked first, and the row with the longest total execution consumption time Later, after the arrangement is completed, it is placed in the task execution queue, and all the detection tasks to be executed are executed in the order in the execution queue.

In an embodiment of the present application, in step S14, when determining the execution sequence of the detection tasks to be executed, the basic time, synchronous execution time, and asynchronous execution time consumed by the execution of multiple detection tasks to be executed may also be selected first. Sort the multiple to-be-executed detection tasks to obtain a sorted queue; insert the remaining to-be-executed detection tasks into the sorted queue in sequence according to a preset insertion method, and wait for the insertion of the last to-be-executed detection task to be completed , Get the task execution queue. Here, the preset insertion method is used to sort all the inspection tasks to be executed, thereby reducing the time complexity, the sorting process becomes a free solution method, from dynamic to static, and in-depth search is performed to determine the final sorting queue. Specifically, a plurality of detection tasks to be executed is selected first, and the selected detection tasks to be executed are sorted according to the basic time consumed by their execution, synchronous execution time, and asynchronous execution time. After the sorting is completed, a queue is formed, and then Insert other inspection tasks to be executed into the current queue one by one, and obtain the insertion position of the optimal solution according to the preset insertion method, so as to determine the new arrangement order, and obtain the new inspection task to be executed and insert it into the original execution The new execution queue after the queue.

Specifically, the preset insertion method includes: sequentially inserting the detection tasks to be inserted into the insertion sites determined by the existing detection tasks to be executed in the sorting queue, and obtaining a new sorting corresponding to each insertion site Queue; Calculate the cumulative total execution time length of all the detection tasks to be executed in the new sorting queue corresponding to each insertion site, wherein the total execution time length is consumed by the execution of the detection task to be executed The basic time, synchronous execution time and asynchronous execution time are determined. A new sorting queue corresponding to the shortest duration is selected according to all the accumulated total execution consumption time obtained by calculation, as the insertion result of inserting the detection task to be inserted into the sorting queue. Here, the insertion site is the position before and after the detection task to be executed in the queue. Assuming that the detection tasks to be executed (A1, A2, A3, and A4) form the optimal sorting queue, and the task execution order in the sorting queue is A1, A2, A3, and A4, then the to-be-executed detection task A5 is inserted in sequence The inserted positions are in front of A1, between A1 and A2, between A2 and A3, between A3 and A4, and after A4. After inserting into each position, a corresponding new execution queue is formed, and each new execution queue is calculated. The total execution consumption time required for all the detection tasks to be executed in the execution queue are executed. Finally, all the total execution consumption times are compared to determine the new execution queue corresponding to the shortest total execution consumption time, for example, A5 is inserted into A1 and The total execution time of the new execution queue formed between A2 is the shortest, and the execution sequence is A1, A5, A2, A3, A4, and then the remaining detection tasks to be executed are inserted in sequence according to the above insertion method, until all waiting The executed inspection tasks are arranged in order, and the final execution order of all the inspection tasks to be executed is determined.

In an embodiment of the present application, the method further includes: grouping all the detection tasks to be executed according to the current operation status; and determining the grouping according to the asynchronous execution time of each detection task to be executed in each group Execution consumption time; each group is sorted according to the execution consumption time of each group, and the to-be-executed detection tasks in all the groups are executed in sequence in the sorted order. Here, when sorting the execution order of all the detection tasks to be executed, you can also sort according to the length of the asynchronous execution time, and group all the existing detection tasks to be executed according to the current operation state, such as according to the system The maximum computing power is grouped. If 10 detection tasks can be processed at a time, each 10 detection tasks to be executed are divided into a group, and the asynchronous execution time of all the detection tasks to be executed in each group is determined, and then the determination The execution consumption time of the group, where the asynchronous execution time required to execute all the detection tasks in the group is the execution consumption time of the group, so that all the groups are sorted according to the execution consumption time of each group, such as The sorting order is group N1, group N2, group N3, and then the to-be-executed detection tasks in the N1 group are executed in turn, and then the to-be-executed detection tasks in the N2 group are executed. Among them, all the to-be-executed detection tasks in each group The order of execution can be determined according to the respective asynchronous execution time, or according to any combination of the corresponding basic time consumed by execution, synchronous execution time and asynchronous execution time; sorting by the length of asynchronous execution time can improve the operating efficiency of the system.

It should be noted that after step S14, when the detection task to be executed is executed according to the determined task execution queue, if each detection task is executed, it is determined whether a retry is required according to the execution result, and if so, the The currently executed detection task is put into the task execution queue again, and the execution sequence of all pending detection tasks in the task execution queue of the currently executed detection task is recalculated to ensure that the current task execution queue The execution order is the optimal execution result.

In addition, an embodiment of the present application also provides a computer-readable medium having computer-readable instructions stored thereon, and the computer-readable instructions can be executed by a processor to implement the foregoing detection task execution method.

In an embodiment of the present application, a device for detecting task execution is also provided, and the device includes:

One or more processors; and

For example, computer-readable instructions, when executed, cause the one or more processors:

Obviously, those skilled in the art can make various changes and modifications to the application without departing from the spirit and scope of the application. In this way, if these modifications and variations of this application fall within the scope of the claims of this application and their equivalent technologies, then this application is also intended to include these modifications and variations.

It should be noted that this application can be implemented in software and/or a combination of software and hardware. For example, it can be implemented using an application specific integrated circuit (ASIC), a general purpose computer or any other similar hardware device. In an embodiment, the software program of the present application may be executed by a processor to realize the steps or functions described above. Likewise, the software program (including related data structures) of the present application can be stored in a computer-readable recording medium, for example, RAM memory, magnetic or optical drives or floppy disks and similar devices. In addition, some steps or functions of the present application may be implemented by hardware, for example, as a circuit that cooperates with a processor to execute each step or function.

In addition, a part of this application can be applied as a computer program product, such as a computer program instruction, when it is executed by a computer, through the operation of the computer, the method and/or technical solution according to this application can be invoked or provided. The program instructions for calling the method of the present application may be stored in a fixed or removable recording medium, and/or be transmitted through a data stream in a broadcast or other signal-bearing medium, and/or be stored in accordance with the Said program instructions run in the working memory of the computer equipment. Here, an embodiment according to the present application includes a device that includes a memory for storing computer program instructions and a processor for executing the program instructions, wherein when the computer program instructions are executed by the processor, the device triggers The operation of the device is based on the aforementioned methods and/or technical solutions according to multiple embodiments of the present application.

For those skilled in the art, it is obvious that the present application is not limited to the details of the foregoing exemplary embodiments, and the present application can be implemented in other specific forms without departing from the spirit or basic characteristics of the application. Therefore, no matter from which point of view, the embodiments should be regarded as exemplary and non-limiting. The scope of this application is defined by the appended claims rather than the above description, and therefore it is intended to fall into the claims. All changes in the meaning and scope of the equivalent elements of are included in this application. Any reference signs in the claims should not be regarded as limiting the claims involved. In addition, it is obvious that the word "including" does not exclude other units or steps, and the singular does not exclude the plural. Words such as first and second are used to denote names, but do not denote any specific order.

Claims

A detection task execution method, characterized in that the method includes:

Acquiring related information of multiple to-be-executed detection tasks, where the related information includes an execution safety point, an execution start point, a detection time, and an execution end point;

Determine the synchronous detection information and the asynchronous detection information in the detection task to be executed;

Determine the basic time, synchronous execution time, and asynchronous execution time consumed by the execution of each detection task to be executed according to the related information of the detection task, the synchronous detection information, and the asynchronous detection information;

According to the basic time, synchronous execution time and asynchronous execution time consumed by the execution of each detection task to be executed, all the detection tasks to be executed are arranged into the task execution queue.
The method according to claim 1, wherein determining the synchronous detection information and the asynchronous detection information in the detection task to be executed comprises:

Acquiring the execution relationship between all to-be-executed detection tasks, where the execution relationship includes a synchronous execution relationship and an asynchronous execution relationship;

The synchronous detection information and the asynchronous detection information are determined according to the execution relationship, wherein the synchronous detection information includes a synchronous detection task and related information of the synchronous detection task, and the asynchronous detection information includes an asynchronous detection task As well as information about asynchronous detection tasks.
The method according to claim 2, characterized in that the basic time consumed by the execution of each detection task to be executed is determined according to the related information of the detection task, the information of the synchronous detection and the information of the asynchronous detection, Synchronous execution time and asynchronous execution time, including:

According to the related information of the detection task to be executed currently and the related information of the next detection task to be executed, it is determined whether the execution end point of the detection task to be executed currently is the same as the execution start point of the next detection task to be executed. At the same point, get the judgment result;

Determine the basic time consumed by the execution of the detection task currently to be executed according to the judgment result and the related information of the detection task currently to be executed, and repeat the above judgment process to determine the execution consumption of each detection task to be executed Basic time

Determining the synchronization execution time with any detection task to be executed in the synchronization execution relationship according to the detection time of the detection task currently to be executed and the synchronization detection information;

The asynchronous execution time between any detection task to be executed in the asynchronous execution relationship is determined according to the detection time of the detection task currently to be executed and the information of the asynchronous detection.
The method according to claim 3, wherein determining the basic time consumed by the execution of the detection task currently to be executed according to the judgment result and the related information of the detection task currently to be executed comprises:

If the judgment result is that the execution end point of the currently to-be-executed detection task is different from the execution start point of the next-to-be-executed detection task, then according to the execution safety point of the current to-be-executed detection task, The execution start point determines the first basic time consumed for execution;

According to the execution end point of the detection task currently to be executed and the execution safety point of the next detection task to be executed, the second basic time consumed between execution and the remaining detection task to be executed is determined.
The method according to claim 4, characterized in that, according to the basic time, synchronous execution time and asynchronous execution time consumed by the execution of each detection task to be executed, all the detection tasks to be executed are arranged into the task execution queue, include:

According to the first basic time, the second basic time, the synchronous execution time, and the asynchronous execution time, all to-be-executed detection tasks are arranged into a task execution queue.
The method according to claim 3, wherein determining the basic time of the currently to-be-detected task according to the judgment result and the related information of the current to-be-detected task comprises:

If the judgment result is that the execution end point of the currently to-be-executed detection task is the same as the execution start point of the next-to-be-executed detection task, then the execution safety point of the current to-be-executed detection task is , The execution start point determines the basic time consumed for execution.
The method according to claim 1, characterized in that, according to the basic time, synchronous execution time and asynchronous execution time consumed by the execution of each detection task to be executed, all the detection tasks to be executed are arranged into the task execution queue, include:

Determine the total execution consumption time of each detection task to be executed according to the basic time, synchronous execution time, and asynchronous execution time consumed by the execution of each detection task to be executed;

According to the total execution consumption time of each detection task to be executed, the time lengths are arranged in ascending order, and then they are placed in the task execution queue.
The method according to claim 1, characterized in that, according to the basic time, synchronous execution time and asynchronous execution time consumed by the execution of each detection task to be executed, all the detection tasks to be executed are arranged into the task execution queue, include:

Prioritize selection of the basic time, synchronous execution time, and asynchronous execution time consumed by the execution of multiple to-be-executed detection tasks to sort the multiple to-be-executed detection tasks to obtain a sorted queue;

The remaining detection tasks to be executed are sequentially inserted into the sorting queue according to a preset insertion manner, and the task execution queue is obtained after the insertion of the last detection task to be executed is completed.
The method according to claim 8, wherein the preset insertion manner comprises:

Insert the detection tasks to be inserted into the sorting queue in turn into the insertion sites determined by the existing detection tasks to be executed, and obtain a new sorting queue corresponding to each insertion site;

Calculate the cumulative total execution time length of all the detection tasks to be executed in the new sorting queue corresponding to each insertion site, where the total execution time length is determined by the basic amount consumed by the execution of the detection task to be executed. Time, synchronous execution time and asynchronous execution time are determined.

A new sorting queue corresponding to the shortest duration is selected according to all the accumulated total execution consumption time obtained by calculation, as the insertion result of inserting the detection task to be inserted into the sorting queue.
The method according to claim 1, wherein the method further comprises:

Group all the detection tasks to be executed according to the current operation status;

Determine the execution consumption time of each group according to the asynchronous execution time of each detection task to be executed in each group;

Each group is sorted according to the execution consumption time of each group, and the to-be-executed detection tasks in all the groups are sequentially executed in the sorted order.
A device for detecting task execution, characterized in that the device includes:

One or more processors; and

A memory storing computer-readable instructions, which when executed, cause the processor to perform the operation of the method according to any one of claims 1 to 10.
A computer-readable medium having computer-readable instructions stored thereon, and the computer-readable instructions can be executed by a processor to implement the method according to any one of claims 1 to 10.