CN109343960A - A kind of method for scheduling task of linux system, system and relevant apparatus - Google Patents
A kind of method for scheduling task of linux system, system and relevant apparatus Download PDFInfo
- Publication number
- CN109343960A CN109343960A CN201811189057.5A CN201811189057A CN109343960A CN 109343960 A CN109343960 A CN 109343960A CN 201811189057 A CN201811189057 A CN 201811189057A CN 109343960 A CN109343960 A CN 109343960A
- Authority
- CN
- China
- Prior art keywords
- task
- real time
- scheduling
- linux system
- time
- 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
Classifications
-
- 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
- G06F9/5038—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 considering the execution order of a plurality of tasks, e.g. taking priority or time dependency constraints into consideration
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Debugging And Monitoring (AREA)
Abstract
The method for scheduling task of a kind of linux system provided herein, comprising: determine the execution demand class of task；If task is hard real time task, for task setting slack time, and according to slack time using Priority-driven Scheduling Algorithm to task progress task schedule.If task is soft real time task or un-real time job, task schedule is carried out to task using robin scheduling algorithm.Task is divided into three classes according to the real-time of task, realizes corresponding two task queues of three generic tasks.The task namely hard real time task that can guarantee emergency execution can be completed within defined slack time, improve the dispatching efficiency for hard real time task, the task schedule performance of linux system improved, to meet the embedded demand of linux system.The application also provides the task scheduling system, computer readable storage medium and a kind of terminal of a kind of linux system, has above-mentioned beneficial effect.
Description
Technical field
This application involves software systems field, in particular to a kind of method for scheduling task of linux system, system, one kind
Computer readable storage medium and a kind of terminal.
Background technique
Recent years, daily life, Industry Control, military affairs, in terms of, embedded system suffers from very
It is widely applied.Embedded system mainly has at present: Windows CE, VxWorks, QNX etc., they all have preferable real-time
Property, system reliability, task processing randomness the advantages that, but their price is generally higher.And built-in Linux is non-with its
Often cheap price, can greatly reduce cost, be increasingly becoming the first choice of embedded OS.But as general behaviour
The Linux for making system will be applied in built-in field, it is necessary to since it is in the technology barrier of real-time application field to Linux
Kernel makees necessary improvement.Most of all, present linux system lacks effective task schedule to meet embedded need
It asks.Therefore how the technical issues of embedded Linux system realizes task schedule room those skilled in the art's urgent need to resolve.
Summary of the invention
The purpose of the application is to provide a kind of method for scheduling task of linux system, system, a kind of computer-readable storage
Medium and a kind of terminal solve the problems, such as that the task schedule in existing linux system is difficult to meet embedded demand.
In order to solve the above technical problems, the application provides a kind of method for scheduling task of linux system, specific technical solution
It is as follows:
After the task that detects enters the linux system, the execution demand class of the task is determined；It is described to execute need
Seeking classification includes hard real time task, soft real time task and un-real time job；
If the task is the hard real time task, for the task setting slack time, and according to it is described loose when
Between using Priority-driven Scheduling Algorithm to the task carry out task schedule.
If the task is the soft real time task or the un-real time job, using robin scheduling algorithm to the task
Carry out task schedule.
Wherein it is determined that the execution demand class of the task includes:
The execution of the task is determined according to the value of policy in the task_struct attribute in the linux system
Demand class.
Wherein, further includes:
If there are traps for the linux system, judges whether there is the hard real time task and need to be implemented；
If so, first carrying out the hard real time task after first half of the traps executes, then execute described
The latter half of traps.
Wherein, before the task enters the linux system, further includes:
It improves the kernel timing parameters frequency of the linux system or improves the resolution ratio of system clock.
The application also provides a kind of task scheduling system of linux system, comprising:
Determining module, for determining the execution demand class of the task after task that detects enters the linux system
Not；The execution demand class includes hard real time task, soft real time task and un-real time job；
First scheduler module, if being the hard real time task for the task, for the task setting slack time,
And task schedule is carried out to the task using Priority-driven Scheduling Algorithm according to the slack time.
Second scheduler module, if being the soft real time task or the un-real time job for the task, using rotation
Dispatching algorithm carries out task schedule to the task.
Wherein, the determining module includes:
Determination unit, for determining institute according to the value of policy in the task_struct attribute in the linux system
State the execution demand class of task.
Wherein, further includes:
Judgment module judges whether there is the hard real time task needs if there are traps for the linux system
It executes；
Sequence execution module when being judged as YES for the judgment module, executes knot in the first half of the traps
Shu Hou first carries out the hard real time task, then executes the latter half of the traps.
Wherein, further includes:
Timing optimization module, for improving the kernel timing parameters frequency of the linux system or improving system clock
Resolution ratio.
The application also provides a kind of computer readable storage medium, is stored thereon with computer program, the computer journey
The step of method for scheduling task as described above is realized when sequence is executed by processor.
The application also provides a kind of terminal, including memory and processor, has computer program in the memory, institute
State the step of realizing method for scheduling task as described above when processor calls the computer program in the memory.
The method for scheduling task of a kind of linux system provided herein, comprising: described in entering when the task that detects
After linux system, the execution demand class of the task is determined；The execution demand class include hard real time task, it is soft in real time
Task and un-real time job；If the task is the hard real time task, for the task setting slack time, and according to institute
Slack time is stated using Priority-driven Scheduling Algorithm to task progress task schedule.If the task be the soft real time task or
The un-real time job carries out task schedule to the task using robin scheduling algorithm.
Task is divided into three classes, i.e. hard real time task, soft real time task and non-reality according to the real-time of task by the application
When task, realize corresponding two task queues of three generic tasks.It can guarantee the task namely hard real time task that emergency executes
It can be completed within defined slack time, improve the dispatching efficiency for hard real time task, improve the task tune of linux system
Performance is spent, to meet the embedded demand of linux system.The application also provide a kind of linux system task scheduling system,
Computer readable storage medium and a kind of terminal have above-mentioned beneficial effect, and details are not described herein again.
Detailed description of the invention
In order to illustrate the technical solutions in the embodiments of the present application or in the prior art more clearly, to embodiment or will show below
There is attached drawing needed in technical description to be briefly described, it should be apparent that, the accompanying drawings in the following description is only this
The embodiment of application for those of ordinary skill in the art without creative efforts, can also basis
The attached drawing of offer obtains other attached drawings.
Fig. 1 is a kind of flow chart of the method for scheduling task of linux system provided by the embodiment of the present application；
Fig. 2 is a kind of task scheduling system structural schematic diagram of linux system provided by the embodiment of the present application.
Specific embodiment
To keep the purposes, technical schemes and advantages of the embodiment of the present application clearer, below in conjunction with the embodiment of the present application
In attached drawing, the technical scheme in the embodiment of the application is clearly and completely described, it is clear that described embodiment is
Some embodiments of the present application, instead of all the embodiments.Based on the embodiment in the application, those of ordinary skill in the art
Every other embodiment obtained without making creative work, shall fall in the protection scope of this application.
Referring to FIG. 1, Fig. 1 is a kind of process of the method for scheduling task of linux system provided by the embodiment of the present application
Figure, the method for scheduling task include:
S101: after the task that detects enters the linux system, the execution demand class of the task is determined；
Be not construed as limiting herein for how to detect that task enters linux system, usually by new task when, the new task
It can be waited processed automatically into task queue.
This step is intended to divide task, according to execute demand class be divided into hard real time task, it is soft in real time
Task and un-real time job.Hard real time task requires system to ensure the execution time under task execution worst case, i.e., must expire
Otherwise the deadline of the response time of sufficient real-time event will cause fatal mistake.Soft real time task refers in statistical significance
It is real-time, general entire throughput is big or Whole Response speed is fast, but cannot be guaranteed that particular task is completed in designated period of time.It is non-
Requirement of the real-time task to system response time is then lower.
Herein for how to determine that the execution demand class of task is not construed as limiting.It preferably, can be according to the Linux system
The value of policy determines the execution demand class of the task in task_struct attribute in system.It is, of course, also possible to there is it
He determines method, such as reads the real-time list etc. of default setting.
The purpose for dividing task category is respectively adopted at different dispatching methods for different real time tasks
Reason.
S102: if the task is the hard real time task, for the task setting slack time, and according to the pine
Relaxation time utilization Priority-driven Scheduling Algorithm carries out task schedule to the task.
If task is hard real time task, that is, it must satisfy the deadline of the response time of real-time event, at this time in system
In be each task setting slack time, the setting method of slack time is not construed as limiting herein.Preferably, the pine of task
The off period that the relaxation time is equal to task subtracts task execution time, current time, it may be assumed that laxity=deadline-current_
time-CPU_time_needed, System Priority execute the task with minimum slack time.In other words, system is according to relaxation
The sequence of time from short to long executes hard real time task.
In order to which the time limit of strict guarantee hard real time task requires, the linux kernel real-time scheduler in the present embodiment is used
Priority scheduling algorithm, i.e., to hard real time task using minimum slack time Priority-driven Scheduling Algorithm MLF (Minimum-
Laxity-First Scheduling Algorithm).Priority-driven Scheduling Algorithm is exactly the relaxation according to each task of ready queue
Time distributes priority, and slack time the smallest task has highest priority.
S103: if the task is the soft real time task or the un-real time job, using robin scheduling algorithm to institute
It states task and carries out task schedule.
If task is not hard real time task, execution priority is for hard real time task without so high.At this time
Soft real time task or un-real time job can be scheduled using robin scheduling algorithm.Robin scheduling algorithm first by it is all just
The queue of thread lines up a ready queue by FCFS (First Come First Served prerequisite variable) strategy, is then
System setting regular hour piece, distributes timeslice to head of the queue operation every time.If this job run terminates, even if timeslice is useless
It is complete, this operation is also removed from queue at once, and distribute new timeslice to next operation；If job slots is finished not
There is end of run, then this operation is rejoined into ready queue tail portion and wait scheduling.
It should be noted that can be adjusted using robin scheduling algorithm is unified to all tasks other than hard real time task
Degree, naturally it is also possible to which certain priority orders are set between soft real time task and un-real time job.Appoint in real time for soft
The timeslice of business setting will generally be longer than un-real time job, or soft real time task is enabled to be introduced into system, in this way according to FCFS plan
When omiting layout task schedule queue (namely " ready queue " above), soft real time task can be first carried out.
Especially, it should be noted that have no fixed ordinal relation between S102 and S103, execution that can be as shown in Figure 1
Ordinal relation, this is because the scheduling of priority processing hard real time task.It may be performed simultaneously between actually S102 and S103, very
It can be executed to S103 prior to S102.
Based on the present embodiment, in order to improve the real-time of Linux, MLF scheduler can be designed, and using it as can load
Module is added in linux kernel, needs to modify kernel accordingly in the implementation.Three generic tasks in operating status are put
Enter two queues, hard real time task is put into hard_real_queue queue, using MLF dispatching algorithm, it is soft in real time and non real-time
Business is put into non_real_queue queue (idle task also wherein), uses robin scheduling algorithm.
Based on the above embodiment, as preferred embodiment, further includes:
If there are traps for the linux system, judges whether there is the hard real time task and need to be implemented；
If so, first carrying out the hard real time task after first half of the traps executes, then execute described
The latter half of traps.
It should be noted that traps processing is divided into two parts by kernel: first half (top half) and latter half
(bottom half), this content well known in the art, therefore not to repeat here.
Whether the queue where needing to judge hard real time task before judging whether there is the processing of traps needs is empty, if
It is not sky, even if there are the latter halfs of traps to need to handle, also first dispatches hard real time task and put into operation, when strong
Just to remove the latter half of processing interruption under conditions of sky, (latter half because of traps is not strong for queue where task
When task it is urgent).Finally, illustrating only have soft real-time or non real-time task to deposit in system if existed without hard real time task
?.The dispatching efficiency of hard real time task can be significantly improved in this way, and when there is no hard real time task, system performance does not become
Change.
Based on the above embodiment, as preferred embodiment, before the task enters the linux system, further includes:
It improves the kernel timing parameters frequency of the linux system or improves the resolution ratio of system clock.
Accurate timing is necessary to real-time scheduler correct operation, and scheduler usually requires that at the time of one specific
Carry out task switching, the mistake of timing will lead to the scheduling away from plan, cause task Release Jitter.When standard Linux system
Clock precision is too coarse, clock interrupt cycle 10ms, is not able to satisfy in specific Embedded Application field for response time essence
The requirement of degree.
Therefore, based on the above embodiment, can also by refine scheduler timer granularity to improve task schedule efficiency,
Meet embedded demand.The method that two ways can solve timer granularity problem is provided herein:
First is that timer granularity is refined by the initial value for directly modifying kernel timing parameters HZ, it such as will be interior in standard Linux
Core timing parameters HZ is changed to 10000, then timer granularity can achieve 100us, although this mode will increase some overheads,
But under strong periodical environment, the setting of timer need to only be initialized once, ensure that treatment effeciency to a certain extent.
Second is that being improved by being programmed to programmable Interrupt timer 8254 or advanced programmable interrupt controller
Linux clock mechanisms, to improve the resolution ratio of its clock, the fine granularity for making the coarseness timer of Millisecond become Microsecond grade is fixed
When device.
It is, of course, also possible to there are other to improve the kernel timing parameters frequency of linux system or improve the resolution of system clock
The method of rate, a different citing limits herein.
Based on the above embodiment, as preferred embodiment, raising task schedule can also be seized by realization task
Efficiency.
Standard Linux kernel is not preemptible, leads to biggish delay, enhance kernel seizes performance, can be improved
Responding ability of the system kernel to real-time task.Currently, there are two types of method modification linux kernel with improve real-time task seize it is non-
The ability of real-time task: first is that increasing the method for preemption point in kernel；It can preemptive type second is that being directly transformed into linux kernel
Kernel.
It is that some preemption points are inserted into linux kernel that point methods are seized in insertion, is seized when a system calling is gone to
When point, if there is the real-time process of higher priority is waiting operation, then the kernel process for being carrying out system calling will
The control of CPU can be handed to the real-time process for waiting operation；If the real-time process of higher priority does not wait, when
Preceding process will continue to execute, and the increased expense of system is only to detect schedule flag at this time.
It is the chance for generating traffic control device, contracting by the basic thought that linux kernel is transformed into preemptible kernel method
The time interval run to scheduling function occurs for short task.It is macro to keep away that the method needs to modify the spin lock in Linux source code
Exempt to compete, and introducing the new count signal that one is referred to as seized lock counter (PLC) wherein allows kernel code to seize, when
When it is 0, allow to seize；When it is any value greater than 0, forbid seizing.
The embodiment of the present application improves the task scheduling capability of linux system from the angle of the enhancing kernel property seized.
A kind of task scheduling system of linux system provided by the embodiments of the present application is introduced below, is described below
Task scheduling system can correspond to each other reference with a kind of above-described method for scheduling task of linux system.
Referring to fig. 2, Fig. 2 is a kind of task scheduling system structural representation of linux system provided by the embodiment of the present application
Figure, the task scheduling system include:
Determining module 100, for after the task that detects enters the linux system, determine the task to execute need
Seek classification；The execution demand class includes hard real time task, soft real time task and un-real time job；
First scheduler module 200, if being the hard real time task for the task, when relaxing for the task setting
Between, and task schedule is carried out to the task using Priority-driven Scheduling Algorithm according to the slack time.
Second scheduler module 300, if being the soft real time task or the un-real time job for the task, using wheel
Turn dispatching algorithm and task schedule is carried out to the task.
Based on the above embodiment, as preferred embodiment, the determining module 100 may include:
Determination unit, for determining institute according to the value of policy in the task_struct attribute in the linux system
State the execution demand class of task.
Based on the above embodiment, as preferred embodiment, which can also include:
Judgment module judges whether there is the hard real time task needs if there are traps for the linux system
It executes；
Sequence execution module when being judged as YES for the judgment module, executes knot in the first half of the traps
Shu Hou first carries out the hard real time task, then executes the latter half of the traps.
Based on the above embodiment, as preferred embodiment, which can also include:
Timing optimization module, for improving the kernel timing parameters frequency of the linux system or improving system clock
Resolution ratio.
Present invention also provides a kind of computer readable storage mediums, have computer program thereon, the computer program
The step of being performed the method for scheduling task that a kind of linux system provided by above-described embodiment may be implemented.The storage is situated between
Matter may include: USB flash disk, mobile hard disk, read-only memory (Read-Only Memory, ROM), random access memory
The various media that can store program code such as (Random Access Memory, RAM), magnetic or disk.
Present invention also provides a kind of terminals, may include memory and processor, have computer in the memory
When the processor calls the computer program in the memory, one kind provided by above-described embodiment is may be implemented in program
The step of method for scheduling task of linux system.Certain terminal can also include various network interfaces, the components such as power supply.
Each embodiment is described in a progressive manner in specification, the highlights of each of the examples are with other realities
The difference of example is applied, the same or similar parts in each embodiment may refer to each other.For embodiment provide system and
Speech, since it is corresponding with the method that embodiment provides, so being described relatively simple, related place is referring to method part illustration
?.
Specific examples are used herein to illustrate the principle and implementation manner of the present application, and above embodiments are said
It is bright to be merely used to help understand the present processes and its core concept.It should be pointed out that for the ordinary skill of the art
For personnel, under the premise of not departing from the application principle, can also to the application, some improvement and modification can also be carried out, these improvement
It is also fallen into the protection scope of the claim of this application with modification.
It should also be noted that, in the present specification, relational terms such as first and second and the like be used merely to by
One entity or operation are distinguished with another entity or operation, without necessarily requiring or implying these entities or operation
Between there are any actual relationship or orders.Moreover, the terms "include", "comprise" or its any other variant meaning
Covering non-exclusive inclusion, so that the process, method, article or equipment for including a series of elements not only includes that
A little elements, but also including other elements that are not explicitly listed, or further include for this process, method, article or
The intrinsic element of equipment.In the absence of more restrictions, the element limited by sentence "including a ...", is not arranged
Except there is also other identical elements in the process, method, article or apparatus that includes the element.
Claims (10)
1. a kind of method for scheduling task of linux system characterized by comprising
After the task that detects enters the linux system, the execution demand class of the task is determined；The execution demand class
It Bao Kuo not hard real time task, soft real time task and un-real time job；
If the task is the hard real time task, for the task setting slack time, and according to the slack time benefit
Task schedule is carried out to the task with Priority-driven Scheduling Algorithm；
If the task is the soft real time task or the un-real time job, the task is carried out using robin scheduling algorithm
Task schedule.
2. method for scheduling task according to claim 1, which is characterized in that determine the execution demand class packet of the task
It includes:
The execution demand of the task is determined according to the value of policy in the task_struct attribute in the linux system
Classification.
3. method for scheduling task according to claim 1, which is characterized in that further include:
If there are traps for the linux system, judges whether there is the hard real time task and need to be implemented；
If so, the traps first half execute after, first carry out the hard real time task, then execute it is described it is soft in
Disconnected latter half.
4. method for scheduling task according to claim 1, which is characterized in that enter the linux system in the task
Before, further includes:
It improves the kernel timing parameters frequency of the linux system or improves the resolution ratio of system clock.
5. a kind of task scheduling system of linux system characterized by comprising
Determining module, for determining the execution demand class of the task after task that detects enters the linux system；
The execution demand class includes hard real time task, soft real time task and un-real time job；
First scheduler module, if being the hard real time task for the task, for the task setting slack time, and root
Task schedule is carried out to the task using Priority-driven Scheduling Algorithm according to the slack time；
Second scheduler module, if being the soft real time task or the un-real time job for the task, using robin scheduling
Algorithm carries out task schedule to the task.
6. task scheduling system according to claim 5, which is characterized in that the determining module includes:
Determination unit determines described appoint for the value according to policy in the task_struct attribute in the linux system
The execution demand class of business.
7. task scheduling system according to claim 5, which is characterized in that further include:
Judgment module judges whether there is the hard real time task needs and holds if there are traps for the linux system
Row；
Sequence execution module, when being judged as YES for the judgment module, after the first half of the traps executes,
The hard real time task is first carried out, then executes the latter half of the traps.
8. task scheduling system according to claim 5, which is characterized in that further include:
Timing optimization module, for improving the kernel timing parameters frequency of the linux system or improving the resolution of system clock
Rate.
9. a kind of computer readable storage medium, is stored thereon with computer program, which is characterized in that the computer program quilt
The step of processor realizes method for scheduling task according to any one of claims 1-4 when executing.
10. a kind of terminal, which is characterized in that including memory and processor, there is computer program in the memory, it is described
Processor realizes method for scheduling task according to any one of claims 1-4 when calling the computer program in the memory
The step of.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811189057.5A CN109343960A (en) | 2018-10-12 | 2018-10-12 | A kind of method for scheduling task of linux system, system and relevant apparatus |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811189057.5A CN109343960A (en) | 2018-10-12 | 2018-10-12 | A kind of method for scheduling task of linux system, system and relevant apparatus |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109343960A true CN109343960A (en) | 2019-02-15 |
Family
ID=65309204
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811189057.5A Pending CN109343960A (en) | 2018-10-12 | 2018-10-12 | A kind of method for scheduling task of linux system, system and relevant apparatus |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109343960A (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110825506A (en) * | 2019-10-31 | 2020-02-21 | 湖南智领通信科技有限公司 | Task scheduling method and device of embedded operating system and storage medium |
| CN111897637A (en) * | 2020-07-15 | 2020-11-06 | 重庆紫光华山智安科技有限公司 | Job scheduling method, device, host and storage medium |
| CN112804295A (en) * | 2020-12-24 | 2021-05-14 | 宝能(广州)汽车研究院有限公司 | Vehicle OTA server, load balancing method thereof and computer-readable storage medium |
| CN115981829A (en) * | 2023-03-20 | 2023-04-18 | 睿至科技集团有限公司 | Scheduling method and system in Internet of things |
| CN117149441A (en) * | 2023-10-27 | 2023-12-01 | 南京齐芯半导体有限公司 | Task scheduling optimization method applied to IoT |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102323895A (en) * | 2011-09-02 | 2012-01-18 | 广东中大讯通软件科技有限公司 | Real-time scheduling method of embedded operating system based on STB (Set Top Box) |
| CN105373425A (en) * | 2015-10-28 | 2016-03-02 | 浪潮(北京)电子信息产业有限公司 | Method and device for performance optimization of embedded Linux system |
-
2018
- 2018-10-12 CN CN201811189057.5A patent/CN109343960A/en active Pending
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102323895A (en) * | 2011-09-02 | 2012-01-18 | 广东中大讯通软件科技有限公司 | Real-time scheduling method of embedded operating system based on STB (Set Top Box) |
| CN105373425A (en) * | 2015-10-28 | 2016-03-02 | 浪潮(北京)电子信息产业有限公司 | Method and device for performance optimization of embedded Linux system |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110825506A (en) * | 2019-10-31 | 2020-02-21 | 湖南智领通信科技有限公司 | Task scheduling method and device of embedded operating system and storage medium |
| CN111897637A (en) * | 2020-07-15 | 2020-11-06 | 重庆紫光华山智安科技有限公司 | Job scheduling method, device, host and storage medium |
| CN111897637B (en) * | 2020-07-15 | 2022-08-19 | 重庆紫光华山智安科技有限公司 | Job scheduling method, device, host and storage medium |
| CN112804295A (en) * | 2020-12-24 | 2021-05-14 | 宝能(广州)汽车研究院有限公司 | Vehicle OTA server, load balancing method thereof and computer-readable storage medium |
| CN115981829A (en) * | 2023-03-20 | 2023-04-18 | 睿至科技集团有限公司 | Scheduling method and system in Internet of things |
| CN117149441A (en) * | 2023-10-27 | 2023-12-01 | 南京齐芯半导体有限公司 | Task scheduling optimization method applied to IoT |
| CN117149441B (en) * | 2023-10-27 | 2024-01-05 | 南京齐芯半导体有限公司 | Task scheduling optimization method applied to IoT |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109343960A (en) | A kind of method for scheduling task of linux system, system and relevant apparatus | |
| US7925869B2 (en) | Instruction-level multithreading according to a predetermined fixed schedule in an embedded processor using zero-time context switching | |
| US8397235B2 (en) | User tolerance based scheduling method for aperiodic real-time tasks | |
| Brandenburg et al. | Real-time resource-sharing under clustered scheduling: Mutex, reader-writer, and k-exclusion locks | |
| CN102043667A (en) | Task scheduling method for embedded operating system | |
| US10248463B2 (en) | Apparatus and method for managing a plurality of threads in an operating system | |
| CN102541642B (en) | Task management method for enhancing real-time performance | |
| US10467054B2 (en) | Resource management method and system, and computer storage medium | |
| CN104199730A (en) | Single-thread multi-task processing method based on synchronous I/O multiplexing mechanism | |
| CN105373425A (en) | Method and device for performance optimization of embedded Linux system | |
| CN102323895A (en) | Real-time scheduling method of embedded operating system based on STB (Set Top Box) | |
| KR20090120970A (en) | A method of interrupt scheduling | |
| EP2587374A1 (en) | Multi-core system and scheduling method | |
| CN109656716B (en) | Slurm job scheduling method and system | |
| WO2023165485A1 (en) | Scheduling method and computer system | |
| US20190317827A1 (en) | Method and apparatus for managing kernel services in multi-core system | |
| CN114035926A (en) | Application thread scheduling method and device, storage medium and electronic equipment | |
| JP2009048358A (en) | Information processor and scheduling method | |
| JP2667575B2 (en) | Task scheduling method | |
| CN115981829B (en) | Scheduling method and system in Internet of things | |
| TWI463406B (en) | Real-time interrupt handling system with preempt function and method thereof | |
| CN116893893B (en) | Virtual machine scheduling method and device, electronic equipment and storage medium | |
| US11461134B2 (en) | Apparatus and method for deferral scheduling of tasks for operating system on multi-core processor | |
| US20230305872A1 (en) | Efficient central processing unit overcommit for virtual machines with symmetric multi-processing | |
| CN114185666A (en) | Scheduling management method for periodic scheduling thread in time-sharing system |
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: 20190215 |