CN115981829A - Scheduling method and system in Internet of things - Google Patents
Scheduling method and system in Internet of things Download PDFInfo
- Publication number
- CN115981829A CN115981829A CN202310266694.2A CN202310266694A CN115981829A CN 115981829 A CN115981829 A CN 115981829A CN 202310266694 A CN202310266694 A CN 202310266694A CN 115981829 A CN115981829 A CN 115981829A
- Authority
- CN
- China
- Prior art keywords
- task
- scheduling
- time
- tasks
- real
- 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.)
- Granted
Links
Images
Classifications
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02P—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS
- Y02P90/00—Enabling technologies with a potential contribution to greenhouse gas [GHG] emissions mitigation
- Y02P90/30—Computing systems specially adapted for manufacturing
Landscapes
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The application discloses a scheduling method and a scheduling system in the Internet of things, wherein the scheduling method in the Internet of things specifically comprises the following substeps: determining a task type; dividing tasks to be scheduled into task sets according to different types of the tasks; judging whether the task set meets the scheduling condition; if the scheduling condition is met, determining the scheduling priority of the task set; scheduling the tasks according to the scheduling priority of the task set; in response to completing the task scheduling, a scheduling review is performed after a specified time. The scheduling method provided by the application can distinguish the task types, so that different scheduling execution can be performed on different types of tasks, the scheduling cost is saved, scheduling review can be performed after scheduling, the scheduling in the execution specified time period is judged again, and the scheduling can be ensured to run continuously.
Description
Technical Field
The application relates to the field of data processing, in particular to a scheduling method and system in the Internet of things.
Background
With the advance of computer information processes, the real-time scheduling of processors in the internet of things is an important research direction at present, wherein the scheduling solves the problem that a plurality of tasks occupy the same processor at the same time through a reasonable resource allocation strategy, ensures that all real-time tasks are finished in a specified time, and simultaneously requires the tasks to be executed according to a specific sequence when the processors perform scheduling.
However, in the current scheduling process, good division and differentiation of tasks are not always considered, so that all tasks which are not classified are stacked together for processing, and the scheduling mode wastes hardware or software resources greatly.
Therefore, how to provide an effective scheduling method is an urgent problem to be solved by those skilled in the art.
Disclosure of Invention
The application provides a scheduling method in the Internet of things, which specifically comprises the following substeps: determining a task type; dividing tasks to be scheduled into task sets according to different types of the tasks; judging whether the task set meets the scheduling condition; if the scheduling condition is met, determining the scheduling priority of the task set; scheduling the tasks according to the scheduling priority of the task set; in response to completing the task scheduling, a scheduling review is performed after a specified time.
As above, tasks are divided into real-time tasks and non-real-time tasks.
As above, wherein a set of tasks is defined
，
Wherein
Each task in the real-time task set is represented, and the task is a real-time task or a non-real-time task.
As above, wherein determining the scheduling priority of the set of tasks comprises determining the scheduling priority of real-time tasks or non-real-time tasks.
The method for scheduling task sets according to the above, wherein the scheduling priority of the task sets is determined according to the deadline and the slack time of the real-time task or the non-real-time task.
A scheduling system in the Internet of things specifically comprises a type determining unit, a dividing unit, a judging unit, a priority determining unit, a scheduling unit and a rechecking unit; the type determining unit is used for determining the task type; the dividing unit is used for dividing the tasks to be scheduled into task sets according to different types of the tasks; the judging unit is used for judging whether the task set meets the scheduling condition; the priority determining unit is used for determining the scheduling priority of the task set if the scheduling condition is met; the scheduling unit is used for scheduling the tasks according to the scheduling priority of the task set; and the rechecking unit is used for scheduling and rechecking after the specified time.
As above, wherein the type determination unit divides the tasks into real-time tasks and non-real-time tasks.
As above, wherein the partition unit defines a task set
，/>
Wherein
Each task in the real-time task set is represented, and the task is a real-time task or a non-real-time task.
As above, wherein the priority determining unit determines the scheduling priority of the set of tasks comprises determining the priority of real-time tasks or non-real-time tasks.
As above, wherein the priority determining unit determines the scheduling priority based on the deadline and the slack time of the real-time task or the non-real-time task.
The application has the following beneficial effects:
the scheduling method provided by the application can distinguish the task types, so that different scheduling execution can be performed on different types of tasks, the scheduling cost is saved, scheduling review can be performed after scheduling, the scheduling in the execution specified time period is judged again, and the scheduling can be ensured to run continuously.
Drawings
In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the description below are only some embodiments described in the present application, and other drawings can be obtained by those skilled in the art according to these drawings.
Fig. 1 is a flowchart of a scheduling method in the internet of things provided according to an embodiment of the present application;
fig. 2 is a structural diagram of a scheduling system in the internet of things according to an embodiment of the present application;
Detailed Description
The technical solutions in the embodiments of the present application are clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are some, but not all, embodiments of the present application. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
Example one
As shown in fig. 1, the scheduling method in the internet of things provided by the present application specifically includes the following steps:
step S110: the task type is determined.
Wherein tasks are divided into real-time tasks and non-real-time tasks. The real-time tasks and the non-real-time tasks comprise data packets needing to be operated and scheduled.
The real-time task has a certain time limitation, namely the task needs to be processed immediately after being received. The non-real-time task has no requirement on the time limit, but the response time to the task is still required to be increased as much as possible in order to improve the scheduling efficiency.
The basic attributes of the real-time task and the non-real-time task comprise:
and (3) task period: refers to a time interval in which one task is continuously performed twice. If the value is constant, it is a real-time task, and if the execution of the task is irregular, variable and unstable, it is an aperiodic task.
Time limit: the output time is the latest tolerable output time for ensuring that the task can normally run and complete, and is also called deadline, and the time is preset before the task is executed.
Response time: the method refers to the time from the arrival of a task to the end of the execution of the task, and specifically comprises three parts: latency, execution time and blocking time, i.e. the time it takes for a task to queue, execute, and be blocked from the entire process.
Execution time: is the time required for the real-time task to monopolize the processor.
Relaxation time: the time is a time for which the task waits when the task meets the time limit.
Further, the real-time tasks and the non-real-time tasks are further processed, the real-time tasks and the non-real-time tasks are divided into a main version and an auxiliary version, the main version and the auxiliary version comprise data packets needing to be operated in the tasks, and the main version and the auxiliary version can represent the tasks. Wherein the packets contained in the primary and secondary versions are the same.
Step S120: and dividing the tasks to be scheduled into task sets according to different types of the tasks.
Wherein tasks to be scheduled are divided into task sets.
In particular, a set of tasks is defined
，
Wherein
Each task in the set of real-time tasks is represented, which may be a real-time task or a non-real-time task.
Wherein the task
Is defined as a six-membered group->
P is the period of the task, d is the time limit of the task, and P = d. />
Is the master version of the task, is asserted>
Is a minor version of the task; a is the time when the task reaches the system, and V is the slack time of the task.
Wherein a processor set is defined
，
Processor with a memory having a plurality of memory cells
Defined as a triple pick>
In which>
Is based on the processor->
Performance of, representing the information andthe processing capability of the data->
Indicates an assignment to +>
Utilization of the master version of the task of->
Indicates assignment to ÷>
The sum of the utilization of the primary version and the secondary version.
Wherein
The greater the value of (a), the more powerful the processor is at processing the data carried in the primary and secondary versions, where
Wherein->
Represents the execution time of a task in a standard processor, <' > or>
Indicating that the task is in the processor->
The execution time of (1).
The standard processor is used for simulating and executing the tasks in advance before the tasks are formally executed. Specifically, the task is put into a simulated processor (the simulated processor is a standard processor) to perform simulated drilling from the arrival to the completion of the task, so that the performance of the real processor is measured when the formal operation is judged according to the parameter.
Step S130: and judging whether the task set meets the scheduling condition.
If the scheduling condition is satisfied, step S140 is executed. Otherwise, the flow exits.
The specific conditions for judging whether the task set meets the scheduling are as follows:
wherein
Indicates that the task is->
In a processor>
On execution time->
Represents performing a task>
A time limit is set.
If the above condition is satisfied, step S140 is executed. Otherwise, the process is exited.
Step S140: the scheduling priority of the task set is determined.
The determining the scheduling priority of the task set specifically includes determining the scheduling priority of each task in the task set. The task is a real-time task or a non-real-time task, namely, each real-time task or non-real-time task in the task set is subjected to scheduling priority determination.
Wherein the present embodiment determines the priority of the task mainly according to the deadline and the slack time in the task attribute.
Wherein the earlier the deadline of the task is, the shorter the slack time is, the higher the priority is. If the deadline and the slack time of the task are the same, the priority is determined according to the time of first reaching the task set, namely, the earlier the task collected into the task set has higher priority.
Step S150: and performing task scheduling according to the scheduling priority of the task set.
The step S150 specifically includes the following sub-steps:
step S1501: and preferentially selecting the tasks with high scheduling priority from the task set and judging the types of the tasks.
Specifically, if the task is a real-time task, step S1502 is executed.
If the task is a non-real-time task, step S1503 is executed.
Step S1502: the primary and secondary versions of the real-time task are scheduled to run in the same processor.
The processor runs the primary version and the secondary version at the same time, and stops running the secondary version when running of the primary version is finished.
The method can ensure the fastest response of the real-time task, and if the main version operates abnormally, the auxiliary version also operates, so that the whole normal operation of the task can be ensured.
Step S1503: the primary and secondary versions of the non-real time task are scheduled to run in the same processor.
And putting the main version and the auxiliary version in the real-time task into a preset running queue for running, and taking out the main version or the auxiliary version from the running queue by the processor for running.
The rules for scheduling the main version and the auxiliary version of the non-real-time task to the same processor to run are as follows: and when an error occurs in the execution process of the main version, the auxiliary version enters the running queue to be ready for running.
By preferentially operating the primary version, the secondary version is operated when the primary version is abnormal, which can reduce the time redundancy of the secondary version.
Step S160: in response to completing the task scheduling, a scheduling review is performed after a specified time.
Specifically, it is determined whether the set of tasks can still be scheduled after a specified time.
Wherein since the processing power of the processor may gradually decrease as the tasks are continuously processed, it may be determined after a specified time whether the set of tasks may still be scheduled.
Wherein, whether the task set meets the conditions is judged:
wherein
Indicates that the task is->
Execution time in a standard processor, < > based on the execution time>
Indicates that the task is->
Is at the processor->
Is performed in->
Represents a constant value that the task was set upon execution, and->
Wherein, the setting can be specifically carried out according to the execution condition of the task, specifically, the setting can be carried out according to the 'appointed time', the longer the appointed time is, the larger the numerical value is, otherwise, the smaller the numerical value is, and the more the judgment is>
Indicates a time limit for executing the task, and->
Is shown in the processor
In the case of operating the master version, ->
Is indicated in a processor>
Operation assistant plateIn this case.
If the scheduling can be carried out, the tasks are continuously taken out from the task set for scheduling, otherwise, the scheduling is suspended.
Through the scheduling rechecking, the scheduling in the execution specified time period can be judged again, and the continuous operation of the scheduling is ensured.
Example two
As shown in fig. 2, a scheduling system in the internet of things provided by the present application specifically includes: a type determining unit 210, a dividing unit 220, a judging unit 230, a priority determining unit 240, a scheduling unit 250, and a reviewing unit 260.
Wherein the type determining unit 210 is configured to determine the task type.
Wherein the tasks are divided into real-time tasks and non-real-time tasks. The real-time tasks and the non-real-time tasks comprise data packets needing to be operated and scheduled.
The real-time task has a certain time limitation, namely the task needs to be processed immediately after being received. The non-real-time task has no requirement on time limitation, but in order to improve the scheduling efficiency, the response time to the task is still required to be improved as much as possible.
The basic attributes of the real-time task and the non-real-time task comprise:
and (3) task period: refers to a time interval in which one task is continuously performed twice. If the value is constant, it is a real-time task, and if the execution of the task is irregular, variable and unstable, it is an aperiodic task.
Time limit: the output time is the latest tolerable output time for ensuring that the task can normally run and complete, and is also called deadline, and the time is preset before the task is executed.
Response time: the method refers to the time from the arrival of a task to the end of the execution of the task, and specifically comprises three parts: latency, execution time and blocking time, i.e. the time it takes for a task to queue, execute, and be blocked from the entire process.
Execution time: is the time required for the real-time task to monopolize the processor.
Relaxation time: the time is the waiting time of the task when the task meets the time limit value.
Further, the real-time tasks and the non-real-time tasks are further processed, the real-time tasks and the non-real-time tasks are divided into a main version and an auxiliary version, the main version and the auxiliary version comprise data packets needing to be operated in the tasks, and the main version and the auxiliary version can represent the tasks. Wherein the packets contained in the primary and secondary versions are the same.
The dividing unit 220 is connected to the type determining unit 210, and is configured to divide the tasks that need to be scheduled into task sets according to different types of the tasks.
Wherein the tasks to be scheduled are divided into task sets.
In particular, a set of tasks is defined
，
Wherein
Represents each task in a real-time task set, which may be a real-time task or a non-real-time task, wherein the task->
Is defined as a six-membered group->
P is the period of the task, d is the time limit of the task, and P = d. />
Is the master version of the task, is asserted>
Is a minor version of the task; a is the time for the task to reach the system and V is the slack time of the task.
Wherein a processor set is defined
，
Processor with a memory having a plurality of memory cells
Defined as a triple pick>
Wherein->
Is a processor>
Performance of (2), indicating its processing capability for information and dataForce->
Indicates assignment to ÷>
Utilization of the master version of the task of->
Indicates assignment to ÷>
The sum of the utilization of the primary version and the secondary version.
Wherein
The greater the value of (a), the more powerful the processor is at processing the data carried in the primary and secondary versions, where
Wherein->
Representing the execution time of a task in a standard processor, in conjunction with a processor based on a processor model>
Indicating that the task is in the processor->
The execution time of (2).
The standard processor is used for simulating and executing the tasks in advance before the tasks are formally executed. Specifically, the task is put into a simulated processor (the simulated processor is a standard processor) to perform simulated drilling from the arrival to the completion of the task, so that the performance of the real processor is measured when the formal operation is judged according to the parameter.
The judging unit 230 is connected to the dividing unit 220, and is configured to judge whether the task set satisfies a scheduling condition.
The specific conditions for judging whether the task set meets the scheduling are as follows:
wherein
Indicates that the task is->
Is at the processor->
On execution time->
Indicating a time limit for executing the task.
If the above condition is satisfied, the process proceeds to the priority determining unit 240. Otherwise, the process is exited.
The priority determining unit 240 is connected to the determining unit 230, and is configured to determine a scheduling priority of the task set if the scheduling condition is satisfied.
The determining the scheduling priority of the task set specifically includes determining the scheduling priority of each task in the task set.
Wherein the present embodiment determines the priority of the task mainly according to the deadline and the slack time in the task attribute.
Wherein the earlier the deadline of the task is, the shorter the slack time is, the higher the priority is. If the deadline of the task is the same as the slack time of the task, the priority is determined according to the time of first arriving the task set, namely, the earlier the task collected in the task set has higher priority.
The scheduling unit 250 is connected to the priority determining unit 240, and is configured to perform task scheduling according to the scheduling priority of the task set.
The scheduling unit 250 specifically executes the following steps:
and preferentially selecting the tasks with high priority from the task set and judging the types of the tasks.
And if the task is a real-time task, scheduling the main version and the auxiliary version of the real-time task to the same processor for running.
The processor runs the primary version and the secondary version at the same time, and when the running of the primary version is finished, the running of the secondary version is stopped.
The method can ensure the fastest response of the real-time task, and if the main version operates abnormally, the auxiliary version also operates, so that the overall normal operation of the task can be ensured.
And if the task is a non-real-time task, scheduling the main version and the auxiliary version of the non-real-time task to the same processor for running.
The main version and the auxiliary version in the real-time task are put into a preset running queue to be ready to run, and the processor takes out the main version or the auxiliary version from the running queue to run.
The rules for scheduling the primary version and the secondary version of the non-real-time task to the same processor for operation are as follows: and when an error occurs in the execution process of the main version, the auxiliary version enters the running queue to be ready for running.
By preferentially operating the primary version, the secondary version is operated when the primary version is abnormal, which can reduce the time redundancy of the secondary version.
The review unit 260 is connected to the scheduling unit 250 for performing scheduling review after a specified time.
Specifically, it is determined whether the set of tasks can still be scheduled after a specified time.
Wherein since the processing power of the processor may gradually decrease as the tasks are continuously processed, it may be determined after a specified time whether the set of tasks may still be scheduled.
Due to the performance of the processor
Then, whether the task set meets the condition is judged:
wherein
Indicates that the task is->
Execution time in a standard processor>
Representing a task>
Is at the processor->
Is performed in->
Represents a constant value that the task was set upon execution, and->
Wherein the setting can be performed according to the execution condition of the task, specifically according to the 'specified time', the numerical value is larger when the specified time is longer, and the numerical value is smaller when the specified time is shorter, and the value is based on the numerical value>
Indicates a time limit for executing the task, and->
Is shown in the processor
In the case of operating the master version, ->
Is indicated in the processor->
The case of running a side version.
If the task can be scheduled, the task is continuously taken out from the task set for scheduling, otherwise, the scheduling is suspended.
The application has the following beneficial effects:
the scheduling method provided by the application can distinguish the task types, so that different types of tasks are scheduled and executed, the scheduling cost is saved, scheduling review can be performed after scheduling, scheduling in the execution designated time period is judged again, and the scheduling can be continuously operated.
Although the present application has been described with reference to examples, which are intended to be illustrative only and not to be limiting of the application, changes, additions and/or deletions may be made to the embodiments without departing from the scope of the application.
The above description is only for the specific embodiments of the present application, but the scope of the present application is not limited thereto, and any person skilled in the art can easily conceive of the changes or substitutions within the technical scope of the present application, and shall be covered by the scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.
Claims (10)
1. A scheduling method in the Internet of things is characterized by comprising the following substeps:
determining a task type;
dividing tasks to be scheduled into task sets according to different types of the tasks;
judging whether the task set meets the scheduling condition;
if the scheduling condition is met, determining the scheduling priority of the task set;
scheduling the tasks according to the scheduling priority of the task set;
in response to completing the task scheduling, a scheduling review is performed after a specified time.
2. The scheduling method in the internet of things of claim 1 wherein the tasks are divided into real-time tasks and non-real-time tasks.
3. The method of scheduling in the internet of things of claim 2 wherein a set of tasks is defined
，
Wherein
Each task in the task set is represented, and the task is a real-time task or a non-real-time task.
4. The method of scheduling in an internet of things of claim 3 wherein determining a scheduling priority for a set of tasks comprises determining a scheduling priority for a real-time task or a non-real-time task.
5. The scheduling method of claim 4 wherein the scheduling priority is determined according to deadlines and slack times of real-time tasks or non-real-time tasks.
6. The scheduling system in the Internet of things is characterized by specifically comprising a type determining unit, a dividing unit, a judging unit, a priority determining unit, a scheduling unit and a rechecking unit;
the type determining unit is used for determining the task type;
the dividing unit is used for dividing the tasks to be scheduled into task sets according to different types of the tasks;
the judging unit is used for judging whether the task set meets the scheduling condition;
the priority determining unit is used for determining the scheduling priority of the task set if the scheduling condition is met;
the scheduling unit is used for scheduling the tasks according to the scheduling priority of the task set;
and the rechecking unit is used for scheduling and rechecking after the specified time.
7. The scheduling system of claim 6 wherein the type determining unit classifies the tasks as real-time tasks and non-real-time tasks.
8. The internet of things scheduling system of claim 7 wherein the partitioning unit defines a set of tasks
，
Wherein
Each task in the real-time task set is represented, and the task is a real-time task or a non-real-time task.
9. The internet of things scheduling system of claim 8 wherein the priority determining unit determining the scheduling priority of the set of tasks includes determining the priority of real-time tasks or non-real-time tasks.
10. The scheduling system in the internet of things of claim 9 wherein the priority determining unit determines the scheduling priority according to deadlines and slack times of real-time tasks or non-real-time tasks.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310266694.2A CN115981829B (en) | 2023-03-20 | 2023-03-20 | Scheduling method and system in Internet of things |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310266694.2A CN115981829B (en) | 2023-03-20 | 2023-03-20 | Scheduling method and system in Internet of things |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115981829A true CN115981829A (en) | 2023-04-18 |
| CN115981829B CN115981829B (en) | 2023-08-01 |
Family
ID=85972574
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310266694.2A Active CN115981829B (en) | 2023-03-20 | 2023-03-20 | Scheduling method and system in Internet of things |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115981829B (en) |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2011059777A (en) * | 2009-09-07 | 2011-03-24 | Toshiba Corp | Task scheduling method and multi-core system |
| CN107193649A (en) * | 2017-05-25 | 2017-09-22 | 深信服科技股份有限公司 | A kind of method for scheduling task and device based on NUMA system |
| CN109343960A (en) * | 2018-10-12 | 2019-02-15 | 郑州云海信息技术有限公司 | A kind of method for scheduling task of linux system, system and relevant apparatus |
| US20190114202A1 (en) * | 2017-10-13 | 2019-04-18 | Beijing Baidu Netcom Science And Technology Co., Ltd. | Task scheduling method and apparatus of artificial intelligence heterogeneous hardware, device and readable medium |
| CN112416606A (en) * | 2020-12-16 | 2021-02-26 | 苏州挚途科技有限公司 | Task scheduling method and device and electronic equipment |
| CN113886034A (en) * | 2021-09-09 | 2022-01-04 | 深圳奥哲网络科技有限公司 | Task scheduling method, system, electronic device and storage medium |
| CN114185674A (en) * | 2021-12-10 | 2022-03-15 | 广东电网有限责任公司江门供电局 | CPU task real-time scheduling method, device, equipment and storage medium |
-
2023
- 2023-03-20 CN CN202310266694.2A patent/CN115981829B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2011059777A (en) * | 2009-09-07 | 2011-03-24 | Toshiba Corp | Task scheduling method and multi-core system |
| CN107193649A (en) * | 2017-05-25 | 2017-09-22 | 深信服科技股份有限公司 | A kind of method for scheduling task and device based on NUMA system |
| US20190114202A1 (en) * | 2017-10-13 | 2019-04-18 | Beijing Baidu Netcom Science And Technology Co., Ltd. | Task scheduling method and apparatus of artificial intelligence heterogeneous hardware, device and readable medium |
| CN109343960A (en) * | 2018-10-12 | 2019-02-15 | 郑州云海信息技术有限公司 | A kind of method for scheduling task of linux system, system and relevant apparatus |
| CN112416606A (en) * | 2020-12-16 | 2021-02-26 | 苏州挚途科技有限公司 | Task scheduling method and device and electronic equipment |
| CN113886034A (en) * | 2021-09-09 | 2022-01-04 | 深圳奥哲网络科技有限公司 | Task scheduling method, system, electronic device and storage medium |
| CN114185674A (en) * | 2021-12-10 | 2022-03-15 | 广东电网有限责任公司江门供电局 | CPU task real-time scheduling method, device, equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115981829B (en) | 2023-08-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106802826B (en) | Service processing method and device based on thread pool | |
| JP4694595B2 (en) | Sleep queue management | |
| TW201737078A (en) | Task-resource scheduling method and device | |
| US20150295970A1 (en) | Method and device for augmenting and releasing capacity of computing resources in real-time stream computing system | |
| US20100088706A1 (en) | User Tolerance Based Scheduling Method for Aperiodic Real-Time Tasks | |
| CN109992403B (en) | Optimization method and device for multi-tenant resource scheduling, terminal equipment and storage medium | |
| CA2849565A1 (en) | Method, apparatus, and system for scheduling processor core in multiprocessor core system | |
| WO2017080276A1 (en) | Resource management method and system, and computer storage medium | |
| Baruah et al. | An extended fixed priority scheme for mixed criticality systems | |
| CN114579285B (en) | Task running system and method and computing device | |
| CN115454589A (en) | Task scheduling method and device and Kubernetes scheduler | |
| CN109614210B (en) | Storm big data energy-saving scheduling method based on energy consumption perception | |
| Zhang et al. | Sensitivity analysis for edf scheduled arbitrary deadline real-time systems | |
| CN115981829A (en) | Scheduling method and system in Internet of things | |
| CN112579271A (en) | Real-time task scheduling method, module, terminal and storage medium for non-real-time operating system | |
| Leng et al. | Co-scheduling aperiodic real-time tasks with end-to-end firm and soft deadlines in two-stage systems | |
| CN111176847B (en) | Method and device for optimizing performance of big data cluster on physical core ultra-multithreading server | |
| CN110990139B (en) | SMP scheduling method and system based on RTOS | |
| CN108845870B (en) | Probabilistic real-time task scheduling method based on pWCET shaping | |
| CN114816703A (en) | Task processing method, device, equipment and medium | |
| Murad et al. | Priority based fair scheduling: Enhancing efficiency in cloud job distribution | |
| Aida et al. | Performance enhancement of scheduling algorithm in heterogeneous distributed computing systems | |
| CN111694661B (en) | Coroutine-based optimization method and system for execution efficiency of computing program | |
| Zhang et al. | An improved speculative strategy for heterogeneous spark cluster | |
| CN116893893B (en) | Virtual machine scheduling method and device, electronic 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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |