CN111143210A - Test task scheduling method and system - Google Patents
Test task scheduling method and system Download PDFInfo
- Publication number
- CN111143210A CN111143210A CN201911341425.8A CN201911341425A CN111143210A CN 111143210 A CN111143210 A CN 111143210A CN 201911341425 A CN201911341425 A CN 201911341425A CN 111143210 A CN111143210 A CN 111143210A
- Authority
- CN
- China
- Prior art keywords
- tested
- tasks
- task
- time
- module
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000012360 testing method Methods 0.000 title claims abstract description 71
- 238000000034 method Methods 0.000 title claims abstract description 27
- 238000012163 sequencing technique Methods 0.000 claims abstract description 9
- 238000011156 evaluation Methods 0.000 description 6
- 238000011056 performance test Methods 0.000 description 4
- 230000008569 process Effects 0.000 description 4
- 238000010586 diagram Methods 0.000 description 3
- 238000004422 calculation algorithm Methods 0.000 description 2
- 238000012790 confirmation Methods 0.000 description 2
- 238000005034 decoration Methods 0.000 description 2
- 230000007774 longterm Effects 0.000 description 2
- 230000007246 mechanism Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 230000006870 function Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/36—Preventing errors by testing or debugging software
- G06F11/3668—Software testing
- G06F11/3672—Test management
- G06F11/3688—Test management for test execution, e.g. scheduling of test suites
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/48—Program initiating; Program switching, e.g. by interrupt
- G06F9/4806—Task transfer initiation or dispatching
- G06F9/4843—Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
- G06F9/4881—Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
- G06F9/5027—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Software Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Computer Hardware Design (AREA)
- Quality & Reliability (AREA)
- Test And Diagnosis Of Digital Computers (AREA)
Abstract
The application provides a test task scheduling method, wherein the method comprises the following steps: scoring the tasks to be tested, which are not met by the required press machine resources, according to a specific rule and sequencing the tasks according to the scores; enabling the sequenced tasks to be tested to enter a backup queue, and waiting for allocation of the press machine resources; and when the waiting time of any task to be tested from the creation time is greater than or equal to a preset time value, directly acquiring the press resource released after the moment by any task to be tested.
Description
Technical Field
The application relates to the technical field of computers, in particular to a test task scheduling method and system.
Background
As computer software is applied more and more widely, the performance requirements on the computer software are higher and higher, and before the software product is on line, the performance of the software product is usually required to be tested. The performance test is a process of simulating concurrent user requests by a certain means, testing the maximum processing capacity and stable operation capacity of the system, and finding out a performance bottleneck, thereby improving the overall processing capacity of the system. The performance test needs to simulate the concurrent request of a user, so the concurrent request can be generated by means of some pressure-generating tools which may run in a Windows/Linux system, so one or more Windows/Linux machines are usually adopted as the pressure machine, and in one performance test, the number of the input pressure machines is the pressure machine resource.
When the performance test is carried out, the resource scheduling of the press machine for the test task is involved. In the prior art, the task scheduling adopts a combination of a first-come-first-serve algorithm (FIFO) and a greedy algorithm. The FIFO is the task which selects the most advanced queue from the queue to execute each time, and the press resource is not released until the task is completed. And meanwhile, a greedy strategy is combined, namely when the resource demand of the press machine which is queued at the front in the task queue is greater than the resource demand of the press machine which is queued at the back, and the demand of the latter is less than or equal to the number of idle press machines, the latter is called preferentially.
However, the prior art has the following problems: for a certain test task, when the required press resource is not satisfied, the press resource waits for a long time until the condition is satisfied and is scheduled to be executed, so that certain test tasks cannot be reasonably executed.
Disclosure of Invention
The application provides a test task scheduling method and a test task scheduling system, and the requirement of flexibly allocating the priority of an execution sequence is realized by taking the waiting time of a test task and the required press machine resource as the basis in the execution process of the test task. Therefore, the resource utilization is optimized, and the problem that a test task with large resource demand on the press machine is not executed after long-term waiting is avoided. The technical scheme adopted by the application is as follows:
in a first aspect, a method for scheduling a test task is provided, where the method includes:
scoring the tasks to be tested, which are not met by the required press machine resources, according to a specific rule and sequencing the tasks according to the scores;
enabling the sequenced tasks to be tested to enter a backup queue, and waiting for allocation of the press machine resources;
and when the waiting time of any task to be tested from the creation time is greater than or equal to a preset time value, directly acquiring the press resource released after the moment by any task to be tested.
Preferably, in the test task scheduling method, if the waiting time of the task to be tested from the creation time is less than the predetermined time value, the press resources released after the time are used for sequentially executing the tasks to be tested in the back-up queue.
Preferably, in the test task scheduling method, for any one of the tasks to be tested whose waiting time from creation time is greater than or equal to the predetermined time value, it is determined whether press resources meet requirements, and if so, the any one of the tasks to be tested enters an execution queue; if not, the newly released press resource is continuously waited and preferentially acquired.
Preferably, in the test task scheduling method, the specific rule may be set according to a system level and a transaction type and according to a certain weight.
In a second aspect, a test task scheduling system is provided, which includes: the system comprises a scoring module, a scheduling module and a locking module, wherein:
the scoring module is used for scoring the tasks to be tested, which are not met by the required press machine resources, according to a specific rule and sequencing the tasks according to scores;
the scheduling module enables the sequenced tasks to be tested to enter a backup queue to wait for allocation of the press machine resources;
and the locking module is used for directly acquiring the press machine resource released after the moment by any task to be tested when the waiting time of the task to be tested from the creation time is greater than or equal to a preset time value.
Preferably, in the above test task scheduling system, the test task scheduling system further includes a first time window module, where the first time window module is configured to: and if the waiting time of the task to be tested from the creation time is less than the preset time value, the press machine resources released after the moment are used for sequentially executing the tasks to be tested in the backup queue.
Preferably, in the above test task scheduling system, the test task scheduling system further includes a second time window module, where the second time window module is configured to: judging whether the press machine resources meet the requirements or not for any task to be tested with the waiting time greater than or equal to the preset time value from the creation time, and if so, enabling any task to be tested to enter an execution queue; if not, the newly released press resource is continuously waited and preferentially acquired.
Preferably, in the above test task scheduling system, the test task scheduling system further includes a rule setting module, and the rule setting module is configured to: the specific rule can be set according to a certain weight according to the system grade and the transaction type.
Compared with the prior art that aiming at a certain test task, when required press machine resources are not met, the test task scheduling method and the test task scheduling system wait for a long time until the conditions are met and are scheduled to be executed. Therefore, the resource utilization is optimized, and the problem that a test task with large resource demand on the press machine is not executed after long-term waiting is avoided.
Additional aspects and advantages of the present application will be set forth in part in the description which follows and, in part, will be obvious from the description, or may be learned by practice of the present application.
Drawings
The foregoing and/or additional aspects and advantages of the present application will become apparent and readily appreciated from the following description of the embodiments, taken in conjunction with the accompanying drawings of which:
fig. 1 is a service flow chart of a test task scheduling method according to an embodiment of the present application;
FIG. 2 is a block diagram of a test task scheduling system according to an embodiment of the present disclosure;
fig. 3 is a scoring schematic diagram of a test task scheduling method according to an embodiment of the present application;
fig. 4 is a flowchart illustrating a test task request execution process of a test task scheduling method according to an embodiment of the present application;
fig. 5 is a task scheduling diagram of a test task scheduling system according to an embodiment of the present application.
Detailed Description
Reference will now be made in detail to the embodiments of the present application, examples of which are illustrated in the accompanying drawings, wherein like or similar reference numerals refer to the same or similar elements or elements having the same or similar function throughout. The embodiments described below with reference to the drawings are exemplary only for the purpose of explaining the present application and are not to be construed as limiting the present application.
As used herein, the singular forms "a", "an" and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise. It will be further understood that the terms "comprises" and/or "comprising," when used in this specification, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof. As used herein, the term "and/or" includes all or any element and all combinations of one or more of the associated listed items.
To make the objects, technical solutions and advantages of the present application more clear, embodiments of the present application will be described in further detail below with reference to the accompanying drawings.
The following describes the technical solutions of the present application and how to solve the above technical problems with specific embodiments. The following several specific embodiments may be combined with each other, and details of the same or similar concepts or processes may not be repeated in some embodiments. Embodiments of the present application will be described below with reference to the accompanying drawings.
Example one
The embodiment of the application provides a test task scheduling method, which comprises the following steps:
step one, scoring the tasks to be tested, of which the required press machine resources are not met, according to a specific rule and sequencing the tasks according to scores.
Specifically, as shown in fig. 3 to 5, when the test task sends out an execution request, the system first determines whether the requirement of the number of the presses can be met, and if yes, directly executes the request; and if the confirmation result is negative, introducing the scheduling model of the application. First, a standardized scoring mechanism for test tasks is introduced. When the number of presses, i.e. resources, is not met, each test task may be scored according to a specific rule. For example, the scores may be obtained by scoring according to parameters such as system level (a + type system, a type system, B type system, C type system), transaction type (dynamic account type system), script attribute (Java type script/C language type script), and summing up the scores to obtain the score of each task, where the higher the score is, the higher the priority is. And the test tasks are sorted according to the priority and then put into a backup queue to wait for the allocation of the press machine resources.
The following scoring rules criteria are shown by way of example below:
class A + system (20), class A system (15), class B system (10), class C system (5)
Transaction of dynamic account type (10), other types (5)
Java class script (5), C language class script (2)
FIG. 3 is an illustration of the example showing the evaluation of scores for test tasks according to the example criteria, the test tasks being ordered by priority.
It should be noted that the evaluation parameters used by different systems are different, and are only examples, and any method that uses other evaluation parameters to perform the scoring in the manner of the present embodiment should be included in the scope of the present embodiment.
And step two, enabling the sequenced tasks to be tested to enter a backup queue to wait for allocation of the press machine resources.
Specifically, the test tasks are placed into a backup queue after being prioritized according to the scoring criteria. And when new press machine resources are released, the test tasks sequentially acquire the required press machine resources according to the sequencing of the backup queue.
And step three, when the waiting time of any task to be tested from the creation time is greater than or equal to a preset time value, the task to be tested directly acquires the press machine resources released after the moment.
Specifically, the test tasks sequentially acquire the required press resources according to the step two, but at the moment, the problem that some test tasks need to wait for a long time because other test tasks with higher priority levels are more or occupy too much press resources still exists. Therefore, introducing a predation time window value, namely setting a preset time value (predation time window value) for each test task, and when the waiting time of any task to be tested from the creation time is greater than or equal to the preset time value, raising the priority of any task to be tested to the highest, directly acquiring the press resource released after the moment, and continuously locking other newly released press resources until the press resource required by the test task is met, thereby entering an execution queue.
Example two
In another embodiment of the present invention, on the basis of the test task scheduling method in the first embodiment, if the waiting time of the task to be tested from the creation time is less than the predetermined time value, the press resources released after the time are used for sequentially executing the tasks to be tested in the backup queue. Judging whether the press machine resources meet the requirements or not for any task to be tested with the waiting time greater than or equal to the preset time value from the creation time, and if so, enabling any task to be tested to enter an execution queue; if not, the newly released press resource is continuously waited and preferentially acquired.
EXAMPLE III
As shown in fig. 2, there is provided a test task scheduling system, including: the system comprises a scoring module, a scheduling module and a locking module, wherein:
and the scoring module is used for scoring the tasks to be tested, which are not met by the required press machine resources, according to a specific rule and sequencing the tasks according to the scores.
Specifically, as shown in fig. 3 to 5, when the test task sends out an execution request, the system first determines whether the requirement of the number of the presses can be met, and if yes, directly executes the request; and if the confirmation result is negative, introducing the scheduling model of the application. Firstly, a scoring module is used for introducing a standardized scoring mechanism of a test task. When the number of the pressing machines, namely the resources, is not met, each test task can be scored by the scoring module according to a specific rule. For example, the scores may be obtained by scoring according to parameters such as system level (a + type system, a type system, B type system, C type system), transaction type (dynamic account type system), script attribute (Java type script/C language type script), and summing up the scores to obtain the score of each task, where the higher the score is, the higher the priority is. And the test tasks are sorted according to the priority and then put into a backup queue to wait for the allocation of the press machine resources.
The following scoring rules criteria are shown by way of example below:
class A + system (20), class A system (15), class B system (10), class C system (5)
Transaction of dynamic account type (10), other types (5)
Java class script (5), C language class script (2)
FIG. 3 is an illustration of the example showing the evaluation of scores for test tasks according to the example criteria, the test tasks being ordered by priority.
It should be noted that the evaluation parameters used by different systems are different, and are only examples, and any method that uses other evaluation parameters to perform the scoring in the manner of the present embodiment should be included in the scope of the present embodiment.
And the scheduling module is used for enabling the sequenced tasks to be tested to enter a backup queue and waiting for allocating the resources of the press machine.
Specifically, the test tasks are placed into a backup queue after being prioritized according to the scoring criteria. The scheduling module performs scheduling as follows: and when new press machine resources are released, the test tasks sequentially acquire the required press machine resources according to the sequencing of the backup queue.
And the locking module is used for directly acquiring the press machine resource released after the moment when the waiting time of any task to be tested from the creation time is greater than or equal to a preset time value.
Specifically, the test tasks sequentially acquire the required press resources as described above, but at this time, there still exists a problem that some test tasks need to wait for a long time because other test tasks with higher priority levels are more or occupy too much press resources. Therefore, a predation time window value is introduced by the locking module, namely a preset time value (predation time window value) is set for each test task, when the waiting time of any task to be tested from the creation time is greater than or equal to the preset time value, the priority of any task to be tested is increased to be the highest, the press resource released after the moment is directly obtained, other newly released press resources are continuously locked until the press resource required by the test task is met, and then the press resource enters an execution queue.
Example four
In another embodiment of the present invention, on the basis of the test task scheduling system of the third embodiment, the test task scheduling system further includes a first time window module, where the first time window module is configured to: and if the waiting time of the task to be tested from the creation time is less than the preset time value, the press machine resources released after the moment are used for sequentially executing the tasks to be tested in the backup queue. The test task scheduling system may further include a second time window module, where the second time window module is configured to: judging whether the press machine resources meet the requirements or not for any task to be tested with the waiting time greater than or equal to the preset time value from the creation time, and if so, enabling any task to be tested to enter an execution queue; if not, the newly released press resource is continuously waited and preferentially acquired. The test task scheduling system may further include a rule setting module, and the rule setting module is configured to: the specific rule can be set according to a certain weight according to the system grade and the transaction type.
It should be understood that, although the steps in the flowcharts of the figures are shown in order as indicated by the arrows, the steps are not necessarily performed in order as indicated by the arrows. The steps are not performed in the exact order shown and may be performed in other orders unless explicitly stated herein. Moreover, at least a portion of the steps in the flow chart of the figure may include multiple sub-steps or multiple stages, which are not necessarily performed at the same time, but may be performed at different times, which are not necessarily performed in sequence, but may be performed alternately or alternately with other steps or at least a portion of the sub-steps or stages of other steps.
The foregoing is only a partial embodiment of the present application, and it should be noted that, for those skilled in the art, various modifications and decorations can be made without departing from the principle of the present application, and these modifications and decorations should also be regarded as the protection scope of the present application.
Claims (8)
1. A method for scheduling a test task is characterized by comprising the following steps:
scoring the tasks to be tested, which are not met by the required press machine resources, according to a specific rule and sequencing the tasks according to the scores;
enabling the sequenced tasks to be tested to enter a backup queue, and waiting for allocation of the press machine resources;
and when the waiting time of any task to be tested from the creation time is greater than or equal to a preset time value, directly acquiring the press resource released after the moment by any task to be tested.
2. The method as claimed in claim 1, wherein if the waiting time of any one of the tasks to be tested from the creation time is less than the predetermined time value, the press resources released after the time are used for executing the tasks to be tested in the back-up queue in sequence.
3. The method for scheduling the test tasks according to claim 1, wherein for any one of the tasks to be tested, the waiting time from the creation time is greater than or equal to the preset time value, whether the press resources meet the requirements is judged, and if the requirement is met, the any one of the tasks to be tested is enabled to enter an execution queue; if not, the newly released press resource is continuously waited and preferentially acquired.
4. The method as claimed in claim 1, wherein the specific rule is set according to a system level and a transaction type and a certain weight.
5. A test task scheduling system, the test task scheduling system comprising: the system comprises a scoring module, a scheduling module and a locking module, wherein:
the scoring module is used for scoring the tasks to be tested, which are not met by the required press machine resources, according to a specific rule and sequencing the tasks according to scores;
the scheduling module enables the sequenced tasks to be tested to enter a backup queue to wait for allocation of the press machine resources;
and the locking module is used for directly acquiring the press machine resource released after the moment by any task to be tested when the waiting time of the task to be tested from the creation time is greater than or equal to a preset time value.
6. The system according to claim 5, wherein the system further comprises a first time window module, the first time window module is configured to: if the waiting time of any task to be tested from the creation time is less than the preset time value, the press machine resources released after the time are used for sequentially executing the tasks to be tested in the backup queue.
7. The system according to claim 5, wherein the system further comprises a second time window module, and the second time window module is configured to: judging whether the press machine resources meet the requirements or not for any task to be tested with the waiting time greater than or equal to the preset time value from the creation time, and if so, enabling any task to be tested to enter an execution queue; if not, the newly released press resource is continuously waited and preferentially acquired.
8. The system according to claim 5, further comprising a rule setting module, said rule setting module is configured to: the specific rule can be set according to a certain weight according to the system grade and the transaction type.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911341425.8A CN111143210A (en) | 2019-12-24 | 2019-12-24 | Test task scheduling method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911341425.8A CN111143210A (en) | 2019-12-24 | 2019-12-24 | Test task scheduling method and system |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN111143210A true CN111143210A (en) | 2020-05-12 |
Family
ID=70519496
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911341425.8A Pending CN111143210A (en) | 2019-12-24 | 2019-12-24 | Test task scheduling method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111143210A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112527503A (en) * | 2020-12-16 | 2021-03-19 | 北京地平线信息技术有限公司 | Management method and management device for deep learning training task |
| CN115827498A (en) * | 2023-02-20 | 2023-03-21 | 创云融达信息技术(天津)股份有限公司 | Pressure test distribution method and system for software program |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20120266023A1 (en) * | 2011-04-12 | 2012-10-18 | Brown Julian M | Prioritization and assignment manager for an integrated testing platform |
| CN106991044A (en) * | 2017-03-22 | 2017-07-28 | 记忆科技(深圳)有限公司 | A kind of test case scheduling and distribution method suitable for distributed test system |
| CN107992362A (en) * | 2016-10-27 | 2018-05-04 | 北京京东尚科信息技术有限公司 | The method, apparatus and system of automated performance testing |
| CN109783214A (en) * | 2018-12-29 | 2019-05-21 | 广州供电局有限公司 | Task schedule control system |
| CN110163469A (en) * | 2019-04-02 | 2019-08-23 | 北京云迹科技有限公司 | Scheduler task sort method and device |
-
2019
- 2019-12-24 CN CN201911341425.8A patent/CN111143210A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20120266023A1 (en) * | 2011-04-12 | 2012-10-18 | Brown Julian M | Prioritization and assignment manager for an integrated testing platform |
| CN107992362A (en) * | 2016-10-27 | 2018-05-04 | 北京京东尚科信息技术有限公司 | The method, apparatus and system of automated performance testing |
| CN106991044A (en) * | 2017-03-22 | 2017-07-28 | 记忆科技(深圳)有限公司 | A kind of test case scheduling and distribution method suitable for distributed test system |
| CN109783214A (en) * | 2018-12-29 | 2019-05-21 | 广州供电局有限公司 | Task schedule control system |
| CN110163469A (en) * | 2019-04-02 | 2019-08-23 | 北京云迹科技有限公司 | Scheduler task sort method and device |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112527503A (en) * | 2020-12-16 | 2021-03-19 | 北京地平线信息技术有限公司 | Management method and management device for deep learning training task |
| CN115827498A (en) * | 2023-02-20 | 2023-03-21 | 创云融达信息技术(天津)股份有限公司 | Pressure test distribution method and system for software program |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106802826B (en) | Service processing method and device based on thread pool | |
| US9852005B2 (en) | Multi-core processor systems and methods for assigning tasks in a multi-core processor system | |
| CN109992403B (en) | Optimization method and device for multi-tenant resource scheduling, terminal equipment and storage medium | |
| CN106919449B (en) | Scheduling control method of computing task and electronic equipment | |
| US8572621B2 (en) | Selection of server for relocation of application program based on largest number of algorithms with identical output using selected server resource criteria | |
| CN112363821A (en) | Computing resource scheduling method and device and computer equipment | |
| CN106775948B (en) | Cloud task scheduling method and device based on priority | |
| US20110131579A1 (en) | Batch job multiplex processing method | |
| CN111143210A (en) | Test task scheduling method and system | |
| CN111274021A (en) | GPU cluster task scheduling and distributing method | |
| CN111506406A (en) | Workflow scheduling method, device and system and computer readable storage medium | |
| CN106775975B (en) | Process scheduling method and device | |
| CN113010286A (en) | Parallel task scheduling method and device, computer equipment and storage medium | |
| CN114816709A (en) | Task scheduling method, device, server and readable storage medium | |
| CN111355751A (en) | Task scheduling method and device | |
| CN109189581B (en) | Job scheduling method and device | |
| CN110413393B (en) | Cluster resource management method and device, computer cluster and readable storage medium | |
| CN108845870B (en) | Probabilistic real-time task scheduling method based on pWCET shaping | |
| CN111143063A (en) | Task resource reservation method and device | |
| CN113051064A (en) | Task scheduling method, device, equipment and storage medium | |
| CN116360922A (en) | Cluster resource scheduling method, device, computer equipment and storage medium | |
| CN105955816A (en) | Event scheduling method and device | |
| CN111708799B (en) | Spark task processing method and device, electronic equipment and storage medium | |
| GB2504812A (en) | Load balancing in a SAP (RTM) system for processors allocated to data intervals based on system load | |
| CN111352710B (en) | Process management method and device, computing equipment and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20200512 |