CN114995981A - A parallel task scheduling method, system, storage medium and terminal - Google Patents

Abstract

The application provides a parallel task scheduling method, which comprises the following steps: acquiring a task to be executed, and determining the number of test environments of the task to be executed; the time consumption of task execution of each task to be executed is known; taking each test environment as a test queue, and determining the initial sequencing among the test queues; sequentially acquiring a current task to be executed with the longest time consumption by each test queue according to initial sequencing, determining current sequencing according to the sequence of the task execution time consumption corresponding to each current test queue from short to long, and sequentially acquiring a current task to be executed with the longest time consumption according to the current sequencing; and executing each task to be executed by utilizing the test queue. The method and the device can ensure that the total consumption of the tasks to be executed by each test queue is relatively balanced, ensure the resource utilization rate in the test process, reduce the time consumption of task execution and improve the task execution efficiency. The application also provides a parallel task scheduling system, a computer readable storage medium and a terminal, which have the beneficial effects.

Description

A parallel task scheduling method, system, storage medium and terminal

technical field

The present application relates to the field of network security, and in particular, to a parallel task scheduling method, system, storage medium and terminal.

Background technique

Today's mainstream automated testing frameworks lack scheduling strategy support for optimizing concurrent execution efficiency. Concurrent case execution usually reduces the time-consuming of case execution by adding more test environments. However, case execution without scheduling strategy planning is prone to the following problems: If the case executed by the case execution process is pushed from the outside at one time, the case escort effect on a single test environment will lead to a waste of global computing resources, that is, some test environments face the state of no task execution due to the completion of the assigned tasks in advance, but the actual On the whole, there are still cases that have not been implemented.

Therefore, how to improve the resource utilization rate during task scheduling is a technical problem that needs to be solved urgently by those skilled in the art.

SUMMARY OF THE INVENTION

The purpose of this application is to provide a parallel task scheduling method, a parallel task scheduling system, a computer-readable storage medium and a terminal, which can reduce the waste of computing resources and reduce the time consumption of concurrent execution.

In order to solve the above-mentioned technical problems, the present application provides a parallel task scheduling method, and the specific technical solutions are as follows:

Acquire the tasks to be executed, and determine the number of test environments of the tasks to be executed; wherein, the task execution time of each of the tasks to be executed is known;

Use each test environment as a test queue, and determine the initial ordering between the test queues;

Each of the test queues sequentially obtains a task to be executed with the longest current time-consuming according to the initial sorting, and determines the current sorting according to the current time-consuming order of the task execution time corresponding to each of the test queues from short to long, and according to the current sorting Obtain a task to be executed with the longest current time in turn;

Each of the to-be-executed tasks is executed by using the test queue.

Optionally, using the test queue to perform each of the to-be-executed tasks includes:

determining the respective corresponding test backgrounds of the test cohorts;

A test environment is configured according to the test background, and the to-be-executed tasks included in the corresponding test queue are executed in the test environment.

Optionally, determining the respective corresponding test backgrounds of the test queues includes:

When the number of the tasks to be executed meets the threshold, general configuration information of the tasks to be executed is extracted to obtain the test background.

Optionally, also include:

If there is a task dependency between the first test task and the second test task, and the first test task corresponds to the first execution time, and the second test task corresponds to the second execution time, the first test task and the second test task are time-consuming. The second test task is combined as the target task to be executed; the task execution time of the target task to be executed is the sum of the first execution time and the second execution time.

Optionally, if an unknown to-be-executed task with unknown task execution time is received, the method further includes:

If the number of the unknown tasks to be performed is greater than the number threshold, the unknown tasks to be performed are equally divided into the test queues according to the number of tasks;

If the number of the unknown to-be-executed tasks is less than the number threshold, the unknown to-be-executed tasks are added to the end of the test queue with the shortest total execution time of the current task.

Optionally, if the to-be-executed task includes several different test scenarios, it also includes:

In each of the test scenarios, a task to be executed adapted to the test scenario is selected to execute the parallel task scheduling method according to claim 1, and several test queues in each of the test scenarios are obtained; The number of test queues in the scene is the same;

The test queues in each of the test scenarios are sorted according to the time-consuming of task execution, and each of the test queues is sorted according to the time-consuming from longest to shortest in order to obtain the total time-consuming of task execution in the next test scenario after being combined with it. The shortest test queue gets a combined queue;

Using the combined queue as the test queue, re-execute the test queues according to the time-consuming order from long to short to obtain a test with the shortest total time-consuming task execution in the next test scenario after combination with it. The step of queuing, until all the test queues of the test scenarios are combined to obtain a scheduling queue;

The to-be-executed tasks are sequentially executed according to the scheduling queue.

The application also provides a parallel task scheduling system, including:

A task acquisition module, configured to acquire tasks to be executed, and determine the number of test environments for the tasks to be executed; wherein, the task execution time of each of the tasks to be executed is known;

a test queue generation module, used to use each test environment as a test queue, and to determine the initial order between the test queues;

The task scheduling module is used for each of the test queues to sequentially obtain a task to be executed with the longest current time consumption according to the initial sorting, and to determine the current sorting according to the order of the current time-consuming task execution corresponding to each of the test queues from short to long. , and sequentially obtain a task to be executed that takes the longest time currently according to the current sorting;

A task processing module, configured to execute each of the to-be-executed tasks by using the test queue.

Optionally, the task processing module includes:

A background determination unit, configured to determine the respective corresponding test backgrounds of the test queues;

An environment configuration unit, configured to configure a test environment according to the test background, and execute the to-be-executed task contained in the corresponding test queue in the test environment.

The present application also provides a computer-readable storage medium on which a computer program is stored, and when the computer program is executed by a processor, implements the steps of the above-described method.

The present application also provides a terminal, including a memory and a processor, wherein a computer program is stored in the memory, and the processor implements the steps of the above method when the computer program in the memory is invoked.

The present application provides a parallel task scheduling method, which includes: acquiring tasks to be executed, and determining the number of test environments for the tasks to be executed; wherein, the task execution time of each of the tasks to be executed is known; As a test queue, and determine the initial order between the test queues; each test queue sequentially obtains a task to be executed that takes the longest time according to the initial order, and executes the task according to the current task corresponding to each test queue The current order is determined in order of time-consuming from short to long, and a task to be executed that currently takes the longest time is sequentially acquired according to the current order; each of the to-be-executed tasks is executed by using the test queue.

In this application, by configuring the test queues, the test queues are obtained in sequence according to their existing total task execution time when each task to be executed is obtained, so as to ensure that the total time consumption of the to-be-executed tasks executed by each test queue is relatively balanced, ensuring that Resource utilization in the testing process reduces task execution time and improves task execution efficiency.

The present application also provides a parallel task scheduling system, a computer-readable storage medium and a terminal, which have the above-mentioned beneficial effects, and will not be repeated here.

Description of drawings

In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the following briefly introduces the accompanying drawings required for the description of the embodiments or the prior art. Obviously, the drawings in the following description are only It is an embodiment of the present application. For those of ordinary skill in the art, other drawings can also be obtained according to the provided drawings without any creative effort.

1 is a flowchart of a parallel task scheduling method provided by an embodiment of the present application;

FIG. 2 is a schematic diagram of a parallel task scheduling result provided by an embodiment of the present application;

3 is a schematic diagram of a parallel task scheduling delay result provided by an embodiment of the present application;

4 is a schematic structural diagram of two test scenarios and three test environments provided by an embodiment of the present application:

5 is a schematic diagram of generating a scheduling queue obtained by combining the test queues corresponding to FIG. 4 according to an embodiment of the present application;

FIG. 6 is a schematic structural diagram of a parallel task scheduling system provided by an embodiment of the present application;

FIG. 7 is a schematic structural diagram of a terminal according to an embodiment of the present application.

Detailed ways

In order to make the purposes, technical solutions and advantages of the embodiments of the present application clearer, the technical solutions in the embodiments of the present application will be described clearly and completely below with reference to the drawings in the embodiments of the present application. Obviously, the described embodiments It is a part of the embodiments of the present application, but not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by those of ordinary skill in the art without creative efforts shall fall within the protection scope of the present application.

Referring to FIG. 1, FIG. 1 is a flowchart of a parallel task scheduling method provided by an embodiment of the present application, and the method includes:

S101: Obtain a task to be executed, and determine the number of test environments for the task to be executed;

The purpose of this step is to obtain tasks to be executed, and the task execution time of each to-be-executed task is known. Generally speaking, for a task that is executed once, it is considered that its task execution time is known when it is executed next time. The task execution time is a relative reference time, not necessarily the exact time when the task to be executed is actually executed. Considering that there are differences in execution environments during task execution, in different task execution environments, there may be certain differences in task execution time consumption for the same task to be executed.

In addition, this step also needs to determine the number of test environments for the task to be executed, which is usually determined by the performance of the test equipment itself, and can be determined by those skilled in the art according to the device parameters of the test equipment. Since there is case escort in the automated testing process, that is, in a test environment, a case that consumes less resources has to wait because a case that consumes more resources is being executed, and automated test execution is non-preemptive and should not be executed in a test environment. Multiple test cases are executed simultaneously on a test environment, so the case escort effect occurs when planning to statically assign a series of case executions on a test environment. Therefore, for tasks to be executed that consume a lot of energy, the corresponding test environment should be prioritized.

As a preferred execution manner, when actually executing a task, there are often two or more tasks including task dependencies. If the tasks are pushed externally when executing tasks, it is easy to push tasks with task dependencies to different processes and environments for execution, resulting in large errors in the test results. For this reason, if there is a task dependency relationship between the first test task and the second test task, and the execution time of the two tasks is known, for example, the first test task corresponds to the first execution time, and the second test task corresponds to the second test task. In terms of execution time, the first test task and the second test task may be combined as the target to-be-executed task, and the task execution time of the target to-be-executed task is the sum of the first execution time and the second execution time. In other words, for tasks with task dependencies, as long as the execution time of the respective tasks is known, all tasks with task dependencies can be regarded as one to-be-executed task to be executed. It should be noted that if the task execution time of any of the test tasks is unknown, although it can still be combined or regarded as a pending task, the pending task should be treated as a pending task whose execution time is unknown.

S102: Use each test environment as a test queue, and determine an initial order between the test queues;

In this step, each test environment is used as a test queue, and the tasks to be executed in the test queue are executed in sequence. And in order to facilitate the execution of the subsequent steps, in this step, the sequence between the test queues needs to be determined, which is used for the subsequent steps to obtain the tasks to be executed.

S103: Each of the test queues sequentially obtains a task to be executed with the longest current time consumption according to the initial sorting, and determines the current sorting according to the order of the current time-consuming task execution time corresponding to each of the test queues from short to long, and according to the The current sorting obtains a task to be executed with the longest current time in turn;

In this step, each test queue needs to acquire tasks to be executed in sequence. Specifically, first, according to the order determined in the previous step, a task to be executed that currently takes the longest time is obtained in turn. After each test queue obtains a task to be executed once, according to the current task execution consumption of each test queue The current order is determined in the order from short to long, and a task to be executed that currently takes the longest time is obtained in sequence according to the current order. And so on, until all pending tasks are obtained. It can be seen that the longer the total execution time of the tasks to be executed currently obtained by the test queue, the shorter the execution time of the tasks to be executed next obtained. The time-consuming is relatively average, avoiding the waste of resources caused by the completion of some test queues first.

S104: Use the test queue to execute each of the tasks to be executed.

After the tasks to be executed in the test queue are determined, the tasks to be executed can be executed. It should be noted that step S103 is a description of the task acquisition method. During the actual task execution process, the task acquisition may be performed while executing the task, or each time a task is executed and completed, the next task to be executed is obtained in the above manner. Can.

It should also be noted that due to various accidents during the execution of the task to be executed, the task execution time exceeds its known task execution time. At this time, if each to-be-executed task is completed, the current task is obtained. Execute the task that takes the longest time to be executed, which can effectively reduce the problem of resource utilization decline caused by abnormal task execution.

As a preferred execution method of this step, when executing the tasks to be executed, the respective test backgrounds corresponding to the test queues may be determined first, so as to configure the test environment according to the test backgrounds, and execute the tasks to be executed contained in the corresponding test queues in the test environment. . There may be differences in test environments between different test queues. In order to reduce the impact of the task execution environment on the time-consuming task execution during task execution, you can configure the corresponding test environment for the test queue when performing this step. There is no limitation on how to determine the test background of the test queue. When the number of tasks to be executed meets the threshold, general configuration information of the tasks to be executed can be extracted as the test background. The threshold is not limited here, and may be three, five or even more, which can be specifically set by those skilled in the art.

Referring to FIG. 2, FIG. 2 is a schematic diagram of a parallel task scheduling result provided by an embodiment of the present application. There are currently 12 different tasks that are time-consuming to execute tasks. According to the method described in this embodiment, they can be divided into four The test queues are labeled as test queue 1, test queue 2, test queue 3 and test queue 4 in order, and sequentially obtain the task to be executed with the longest execution time of the current task, and then obtain 37 respectively (representing the time-consuming task execution, the following Synonyms), 31, 25, and 21, at this time, the test queue 4 with the shortest total time-consuming execution of the current test queue task preferentially obtains the task to be executed with the most time-consuming execution of the current task, that is, the task to be executed corresponding to 17, in the second After the round acquisition task is completed, the test queue 4 is still the test queue with the shortest total execution time of the current test queue task. Therefore, it can be seen that the to-be-executed task that takes the most time to execute the current task is obtained, that is, the to-be-executed task corresponding to 7. , the execution durations of test queue 1, test queue 2, test queue 3 and test queue 4 are 46, 44, 41, and 45, respectively, which achieves a relatively balanced execution duration among test queues, and also makes resource utilization relatively balanced.

In the process of task execution, if each to-be-executed task is completed, the task with the longest execution time of the current task is obtained. Even if a task execution abnormality causes the actual task execution time to be prolonged, the task scheduling can still be balanced. Referring to FIG. 3, FIG. 3 is a schematic diagram of a parallel task scheduling delay result provided by an embodiment of the present application. If the actual task execution time of the second task to be executed in the test queue 3 becomes 16, according to the order from short to long Sorting will cause the total task execution time of test queue 3 to change from the original second to the third when it acquires the to-be-executed task next time. When it is acquired for the third time, it can only obtain the pending task with a task execution time of 4. At this time, the execution durations of test queue 1, test queue 2, test queue 3, and test queue 4 are 46, 45, 45, and 45, respectively, which does not affect the realization of task scheduling balance.

In the embodiment of the present application, by configuring the test queues, the test queues are sequentially acquired according to their existing total task execution time when each task to be executed is acquired, so as to ensure that the total time consumption of the to-be-executed tasks executed by each test queue is relatively balanced. The resource utilization rate in the testing process is guaranteed, the time-consuming task execution is reduced, and the task execution efficiency is improved.

Based on the above embodiment, as a preferred embodiment, this embodiment deals with unknown tasks to be executed whose task execution time is unknown. The specific solution may include the following steps:

If the number of unknown to-be-executed tasks is greater than the number threshold, the unknown to-be-executed tasks are equally divided into test queues according to the number of tasks;

If the number of unknown to-be-executed tasks is less than the number threshold, the unknown to-be-executed tasks are added to the end of the test queue with the shortest total execution time of the current task.

In this embodiment, the unknown number of tasks to be executed needs to be dealt with accordingly. If the number is less than the number threshold, it can be directly added to the end of the test queue with the shortest total execution time of the current task for execution. If the number is greater than the number threshold, it will be distributed to the end of each test queue relatively evenly according to the number of test queues. The number threshold is not limited here, and can be specifically set by those skilled in the art according to the total number of tasks to be performed that need to be tested and the number of unknown tasks to be performed.

In the above embodiment, the tasks to be executed are considered to be based on the same or similar test scenarios, that is, the test scenarios for the tasks to be executed require similar or identical test scenarios. As a preferred embodiment, if the tasks to be executed include at least two different tests Scenarios, which also include:

S201: In each of the test scenarios, select a task to be executed adapted to the test scenario to execute the parallel task scheduling method according to claim 1, and obtain several test queues in each of the test scenarios; The number of test queues in the above test scenario is the same;

S202: Sort the test queues in each of the test scenarios according to the task execution time, and each of the test queues sequentially obtains a combined task execution total in the next test scenario according to the time-consuming in descending order. The shortest time-consuming test queue gets a combined queue;

S203: Use the combined queue as the test queue, and re-execute the test queues in order to obtain the shortest total time-consuming task execution in the next test scenario in order of the time-consuming sequence from longest to shortest The steps of the test queue, until all the test queues of the test scenarios are combined to obtain a scheduling queue;

S204: Execute the to-be-executed tasks in sequence according to the scheduling queue.

Although there are different test scenarios for the tasks to be executed, since the applied test devices are all the same, that is, the same devices are used to process the tasks to be executed, so in each test scenario, the number of test queues is the same.

According to the process of the above embodiment, test queues are generated for each test scenario, so that several test queues under different test scenarios can be obtained, and then the test queues under different test scenarios are combined or connected. The specific combination method depends on the sorting method of the test queues in the first test scenario according to the total time-consuming of task execution. When testing a test queue in a scenario, select the test queue with the shortest total task execution time when combined with it. On the contrary, if the test queues in the first test scenario are combined in order of execution time from short to long, then when combining the test queues in the next test scenario, the total time-consuming task execution will be the longest. Long test queue. After all test scenarios are combined, the scheduling queue is obtained.

It should be noted that the test scenarios in this embodiment are not equivalent to the test environments in the above-mentioned embodiments, and the test environments in the above-mentioned embodiments can be regarded as different processes under the same test scenario, and the automation of tasks to be executed can be realized in parallel. implement.

This embodiment can realize the balanced use of global resources when tasks to be executed are scheduled by different test scenarios. In a preferred execution method, a dedicated test service can be configured in each test queue, and the test service obtains the task to be executed with the longest current task time from the service that manages the test task. Execution is a single-queue multi-processor model. Under this model, according to the longest task priority strategy described above, the load balance on each test environment can be guaranteed to maximize resource utilization.

Referring to FIG. 4 and FIG. 5 , FIG. 4 is a schematic structural diagram of a dual test scenario and three test environments provided by an embodiment of the present application, and FIG. 5 is a schematic diagram of scheduling queue generation obtained by applying an embodiment of the present application to combine the test queues corresponding to FIG. 4 , in FIG. 4, two test scenarios are included, namely, test scenario 1 and test scenario 2, including 6 tasks to be executed, and three test queues can be obtained according to the steps of the above embodiment. Similarly, test scenario 2 can also be obtained. There are three test queues, and test queues 1-1, 1-2 and 1-3 are in the order of task execution time from short to long, then test queue 1-1 should be combined with the longest task execution time in test scenario 2. The test queue, that is, the test queue 2-1, meets the requirement that the combined task execution takes the longest time. Finally, the three scheduling queues shown in FIG. 5 can be obtained, and the time consumption of each scheduling queue is 29, which realizes the maximum utilization of global resources.

Referring to FIG. 6, FIG. 6 is a schematic structural diagram of a parallel task scheduling system provided by an embodiment of the application. The parallel task scheduling system disclosed in this embodiment and the parallel task scheduling method described above can be compared with each other. Provide a parallel task scheduling system, including:

A task acquisition module, configured to acquire tasks to be executed, and determine the number of test environments for the tasks to be executed; wherein, the task execution time of each of the tasks to be executed is known;

a test queue generation module, used to use each test environment as a test queue, and to determine the initial order between the test queues;

The task scheduling module is used for each of the test queues to sequentially obtain a task to be executed with the longest current time consumption according to the initial sorting, and to determine the current sorting according to the order of the current time-consuming task execution corresponding to each of the test queues from short to long. , and sequentially obtain a task to be executed that takes the longest time currently according to the current sorting;

A task processing module, configured to execute each of the to-be-executed tasks by using the test queue.

Based on the above embodiment, as a preferred embodiment, the task processing module includes:

A background determination unit, configured to determine the respective corresponding test backgrounds of the test queues;

An environment configuration unit, configured to configure a test environment according to the test background, and execute the to-be-executed task contained in the corresponding test queue in the test environment.

Based on the above embodiment, as a preferred embodiment, the background determination unit is a unit configured to extract the general configuration information of the to-be-executed tasks to obtain the test background when the number of the to-be-executed tasks meets a threshold.

Based on the above embodiment, as a preferred embodiment, it also includes:

The task merging module is used for, if there is a task dependency relationship between the first test task and the second test task, and the first test task corresponds to the first execution time-consuming, and the second test task corresponds to the second execution time-consuming, The first test task and the second test task are combined as the target to-be-executed task; the task execution time of the target to-be-executed task is the sum of the first execution time and the second execution time.

Based on the above embodiment, as a preferred embodiment, it also includes:

The unknown task scheduling module is configured to divide the unknown tasks to be executed equally according to the number of tasks if the number of the unknown tasks to be executed is greater than the number threshold when receiving the unknown tasks to be executed whose task execution time is unknown. test queue;

If the number of the unknown to-be-executed tasks is less than the number threshold, the unknown to-be-executed tasks are added to the end of the test queue with the shortest total execution time of the current task.

Based on the above embodiment, as a preferred embodiment, it also includes:

Global scheduling mode, used to perform the following steps:

If the to-be-executed task includes several different test scenarios, in each of the test scenarios, select the to-be-executed task adapted to the test scenario to execute the parallel task scheduling method described above, and obtain the test scenarios in each of the test scenarios. Several test queues; wherein, the number of test queues in each of the test scenarios is the same;

The test queues in each of the test scenarios are sorted according to the time-consuming of task execution, and each of the test queues is sorted according to the time-consuming from longest to shortest in order to obtain the total time-consuming of task execution in the next test scenario after being combined with it. The shortest test queue gets a combined queue;

Using the combined queue as the test queue, re-execute the test queues according to the time-consuming order from long to short to obtain a test with the shortest total time-consuming task execution in the next test scenario after combination with it. The step of queuing, until all the test queues of the test scenarios are combined to obtain a scheduling queue;

The to-be-executed tasks are sequentially executed according to the scheduling queue.

The present application also provides a computer-readable storage medium on which a computer program is stored, and when the computer program is executed, the steps of the methods provided in the above embodiments can be implemented. The storage medium may include: U disk, removable hard disk, read-only memory (Read-Only Memory, ROM), random access memory (Random Access Memory, RAM), magnetic disk or optical disk and other media that can store program codes.

The present application also provides a terminal, which may include a memory and a processor, where a computer program is stored in the memory, and when the processor calls the computer program in the memory, the steps of the methods provided in the above embodiments can be implemented . Of course, the terminal may also include various network interfaces, power supplies and other components. Referring to FIG. 7 , FIG. 7 is a schematic structural diagram of a terminal according to an embodiment of the present application. The terminal in this embodiment may include: a processor 2101 and a memory 2102 .

Optionally, the terminal may further include a communication interface 2103 , an input unit 2104 , a display 2105 and a communication bus 2106 .

The processor 2101 , the memory 2102 , the communication interface 2103 , the input unit 2104 , and the display 2105 all complete the communication with each other through the communication bus 2106 .

In this embodiment of the present application, the processor 2101 may be a central processing unit (Central Processing Unit, CPU), an application-specific integrated circuit, a digital signal processor, an off-the-shelf programmable gate array, or other programmable logic devices.

The processor may invoke programs stored in memory 2102. Specifically, the processor may perform the operations performed by the terminal in the above embodiments.

The memory 2102 is used to store one or more programs, and the programs may include program codes, and the program codes include computer operation instructions. In this embodiment of the present application, the memory at least stores a program for realizing the following functions:

Acquire the tasks to be executed, and determine the number of test environments of the tasks to be executed; wherein, the task execution time of each of the tasks to be executed is known;

Use each test environment as a test queue, and determine the initial ordering between the test queues;

Each of the test queues sequentially obtains a task to be executed with the longest current time-consuming according to the initial sorting, and determines the current sorting according to the current time-consuming order of the task execution time corresponding to each of the test queues from short to long, and according to the current sorting Obtain a task to be executed with the longest current time in turn;

Each of the to-be-executed tasks is executed by using the test queue.

In a possible implementation manner, the memory 2102 may include a stored program area and a stored data area, wherein the stored program area may store an operating system, an application program required for at least one function, and the like; data created during use.

Additionally, memory 2102 may include high-speed random access memory, and may also include non-volatile memory, such as at least one magnetic disk storage device or other volatile solid-state storage device.

The communication interface 2103 may be an interface of a communication module, such as an interface of a GSM module.

The present application may also include a display 2105 and an input unit 2104, among others.

The structure of the terminal shown in FIG. 7 does not constitute a limitation on the terminal in this embodiment of the present application. In practical applications, the terminal may include more or less components than those shown in FIG. 7 , or combine some components.

The various embodiments in the specification are described in a progressive manner, and each embodiment focuses on the differences from other embodiments, and the same and similar parts between the various embodiments can be referred to each other. For the system provided by the embodiment, since it corresponds to the method provided by the embodiment, the description is relatively simple, and the relevant part can be referred to the description of the method.

Specific examples are used herein to illustrate the principles and implementations of the present application, and the descriptions of the above embodiments are only used to help understand the methods and core ideas of the present application. It should be pointed out that for those of ordinary skill in the art, without departing from the principles of the present application, several improvements and modifications can also be made to the present application, and these improvements and modifications also fall within the protection scope of the claims of the present application.

It should also be noted that, in this specification, relational terms such as first and second, etc. are only used to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply these entities or operations. There is no such actual relationship or sequence between operations. Moreover, the terms "comprising", "comprising" or any other variation thereof are intended to encompass a non-exclusive inclusion such that a process, method, article or device that includes a list of elements includes not only those elements, but also includes not explicitly listed or other elements inherent to such a process, method, article or apparatus. Without further limitation, an element qualified by the phrase "comprising a..." does not preclude the presence of additional identical elements in a process, method, article or apparatus that includes the element.

Claims (10)

1. a parallel task scheduling method, is characterized in that, comprises: Acquire the tasks to be executed, and determine the number of test environments of the tasks to be executed; wherein, the task execution time of each of the tasks to be executed is known; Use each test environment as a test queue, and determine the initial ordering between the test queues; Each of the test queues sequentially obtains a task to be executed with the longest current time-consuming according to the initial sorting, and determines the current sorting according to the current time-consuming order of the task execution time corresponding to each of the test queues from short to long, and according to the current sorting Obtain a task to be executed with the longest current time in turn; Each of the to-be-executed tasks is executed by using the test queue. 2. The parallel task scheduling method according to claim 1, wherein, using the test queue to execute each of the tasks to be executed comprises: determining the respective corresponding test backgrounds of the test cohorts; A test environment is configured according to the test background, and the to-be-executed tasks included in the corresponding test queue are executed in the test environment. 3. The parallel task scheduling method according to claim 2, wherein determining the respective corresponding test backgrounds of the test queues comprises: When the number of the tasks to be executed meets the threshold, general configuration information of the tasks to be executed is extracted to obtain the test background. 4. The parallel task scheduling method according to claim 1, further comprising: If there is a task dependency between the first test task and the second test task, and the first test task corresponds to the first execution time, and the second test task corresponds to the second execution time, the first test task and the second test task are time-consuming. The second test task is combined as the target task to be executed; the task execution time of the target task to be executed is the sum of the first execution time and the second execution time. 5. parallel task scheduling method according to claim 1, is characterized in that, if receiving the unknown task to be executed that the task execution time-consuming is unknown, also comprises: If the number of the unknown tasks to be performed is greater than the number threshold, the unknown tasks to be performed are equally divided into the test queues according to the number of tasks; If the number of the unknown to-be-executed tasks is less than the number threshold, the unknown to-be-executed tasks are added to the end of the test queue with the shortest total execution time of the current task. 6. The parallel task scheduling method according to claim 2 or 3, wherein if the task to be executed includes several different test scenarios, the method further comprises: In each of the test scenarios, a task to be executed adapted to the test scenario is selected to execute the parallel task scheduling method according to claim 1, and several test queues in each of the test scenarios are obtained; The number of test queues in the scenario is the same; The test queues in each of the test scenarios are sorted according to the time-consuming of task execution, and each of the test queues is sorted according to the time-consuming from longest to shortest in order to obtain the total time-consuming of task execution in the next test scenario after being combined with it. The shortest test queue gets a combined queue; Using the combined queue as the test queue, re-execute the test queues according to the time-consuming order from long to short to obtain a test with the shortest total time-consuming task execution in the next test scenario after combination with it. The step of queuing, until all the test queues of the test scenarios are combined to obtain a scheduling queue; The to-be-executed tasks are sequentially executed according to the scheduling queue. 7. A parallel task scheduling system, comprising: A task acquisition module, configured to acquire tasks to be executed, and determine the number of test environments for the tasks to be executed; wherein, the task execution time of each of the tasks to be executed is known; a test queue generation module, used to use each test environment as a test queue, and to determine the initial order between the test queues; The task scheduling module is used for each of the test queues to sequentially obtain a task to be executed with the longest current time consumption according to the initial sorting, and to determine the current sorting according to the order of the current time-consuming task execution corresponding to each of the test queues from short to long. , and sequentially obtain a task to be executed that takes the longest time currently according to the current sorting; A task processing module, configured to execute each of the to-be-executed tasks by using the test queue. 8. The parallel task scheduling system according to claim 7, wherein the task processing module comprises: A background determination unit, configured to determine the respective corresponding test backgrounds of the test queues; An environment configuration unit, configured to configure a test environment according to the test background, and execute the to-be-executed task contained in the corresponding test queue in the test environment. 9. A computer-readable storage medium on which a computer program is stored, characterized in that, when the computer program is executed by a processor, the steps of the parallel task scheduling method according to any one of claims 1-6 are implemented. 10. A terminal, comprising a memory and a processor, wherein a computer program is stored in the memory, and when the processor calls the computer program in the memory, the implementation of any one of claims 1-6 is realized The steps of the parallel task scheduling method.

Images