CN110515719A - A kind of method for scheduling task and relevant apparatus - Google Patents
A kind of method for scheduling task and relevant apparatus Download PDFInfo
- Publication number
- CN110515719A CN110515719A CN201910818241.XA CN201910818241A CN110515719A CN 110515719 A CN110515719 A CN 110515719A CN 201910818241 A CN201910818241 A CN 201910818241A CN 110515719 A CN110515719 A CN 110515719A
- Authority
- CN
- China
- Prior art keywords
- task
- count value
- execution period
- scheduling
- function
- 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
- 238000000034 method Methods 0.000 title claims abstract description 33
- 230000006870 function Effects 0.000 claims description 55
- 238000004590 computer program Methods 0.000 claims description 10
- 230000000694 effects Effects 0.000 abstract description 6
- 239000002699 waste material Substances 0.000 abstract description 3
- 238000010586 diagram Methods 0.000 description 4
- 238000005516 engineering process Methods 0.000 description 4
- 230000008859 change Effects 0.000 description 2
- 238000004891 communication Methods 0.000 description 2
- 230000006872 improvement Effects 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 238000013473 artificial intelligence Methods 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 239000000284 extract Substances 0.000 description 1
- 239000000203 mixture Substances 0.000 description 1
- 230000002093 peripheral effect Effects 0.000 description 1
- 230000008569 process Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 230000000750 progressive effect Effects 0.000 description 1
- 230000009467 reduction Effects 0.000 description 1
- 239000011800 void material Substances 0.000 description 1
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/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
- G06F2209/00—Indexing scheme relating to G06F9/00
- G06F2209/48—Indexing scheme relating to G06F9/48
- G06F2209/484—Precedence
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
This application discloses a kind of method for scheduling task, including configuring the execution period of each task and initializing to the count value of each task；Wherein, the execution period of the task of high priority is less than the execution period of the task of low priority；It calls task to check function according to predetermined period, to check the count value of task described in increases using the task, and judges whether the count value reaches the execution period；If the count value reaches the execution period, executes the task and reset the count value.The method for scheduling task can realize the efficient scheduling of task while reducing MCU resource occupation, and the time of cyclical function is avoided to waste, and improve system effectiveness.Disclosed herein as well is a kind of task scheduling apparatus, equipment and computer readable storage mediums, all have above-mentioned technical effect.
Description
Technical field
This application involves field of computer technology, in particular to a kind of method for scheduling task；Further relate to a kind of task schedule
Device, equipment and computer readable storage medium.
Background technique
With the rise of big data, cloud computing and artificial intelligence technology, requirement of the people to data calculating speed is more next
It is higher.In this context, the isomery accelerator card of CPU+FPGA+MCU is proposed, a part of data are put into FPGA and are calculated
Processing.It further, is liberation FPGA, by the observing and controlling part on board, such as observing and controlling board temperature, power consumption, FPGA temperature etc., by
MCU is realized.The main function of MCU includes logical by IIC (Inter-Integrated Circuit BUS, IC bus)
Communication interface is interacted with peripheral chip, extracts the information such as board temperature, FPGA temperature；Pass through SMBus (System Management
Bus, System Management Bus) (IIC) communication interface interacts with CPU, receives the instruction that CPU is issued, and it carries out instruction parsing and returns
Data needed for CPU.The function of the realization as needed for MCU is fairly simple, mainly based on observing and controlling, therefore accounts for reduce the resource of MCU
With, reduce cost, RTOS system is embedded in not in MCU, thus leads to not that efficiently multitask is scheduled and is managed.Especially
It executes each task according to the identical execution time, then undoubtedly will cause and follow in the case where each task priority is different
The time of ring function wastes.
Therefore, the efficient scheduling that task how is realized while reducing MCU resource occupation, avoids the time of cyclical function
Waste improves system effectiveness and has become those skilled in the art's technical problem urgently to be resolved.
Summary of the invention
The purpose of the application is to provide a kind of method for scheduling task, can realize and appoint while reducing MCU resource occupation
The efficient scheduling of business, avoids the time of cyclical function from wasting, and improves system effectiveness；The another object of the application is to provide a kind of appoint
Business dispatching device, equipment and computer readable storage medium, all have above-mentioned technical effect.
In order to solve the above technical problems, this application provides a kind of method for scheduling task, comprising:
It configures the execution period of each task and the count value of each task is initialized；Wherein, high priority
The task the execution period be less than low priority the task the execution period；
Task is called to check function according to predetermined period, to check the counting of task described in increases using the task
Value, and judge whether the count value reaches the execution period；
If the count value reaches the execution period, executes the task and reset the count value.
Optionally, the executions period of each task of the configuration and the count value of each task is initialized, packet
It includes:
The execution period of each task is configured and to each institute using task initialization function based on two-dimensional array
The count value for stating task is initialized；Wherein, the high byte of the two-dimensional array indicates the execution period of the task,
The low byte of the two-dimensional array indicates the count value of the task.
Optionally, the count value that task described in increases is checked using the task includes:
It is every that the primary task is called to check function, check that function adds the count value of the task using the task
One.
Optionally, it configures the execution period of each task and is also wrapped before being initialized to the count value of each task
It includes:
Judge whether the task ID of the task is greater than preset task total amount；
If the task ID of the task is greater than the preset task total amount, miscue is carried out.
In order to solve the above technical problems, present invention also provides a kind of task scheduling apparatus, comprising:
Configuration module, for configuring the execution period of each task and being initialized to the count value of each task；
Wherein, the execution period of the task of high priority is less than the execution period of the task of low priority；
Calling module, for calling task to check function according to predetermined period, to check increases using the task
The count value of the task, and judge whether the count value reaches the execution period；
Execution module executes the task and by the counting if reaching the execution period for the count value
Value is reset.
Optionally, the configuration module is specifically for configuring each described using task initialization function based on two-dimensional array
Business the execution period and the count value of each task is initialized；Wherein, the high byte of the two-dimensional array
Indicate the execution period of the task, the low byte of the two-dimensional array indicates the count value of the task.
Optionally, the calling module calls the primary task to check function specifically for every, is looked into using the task
See that the count value of the task is added one by function.
Optionally, further includes:
Judgment module, for judging whether the task ID of the task is greater than preset task total amount；
Cue module carries out miscue if the task ID for the task is greater than the preset task total amount.
In order to solve the above technical problems, present invention also provides a kind of task scheduling equipments, comprising:
Memory, for storing computer program；
Processor, the step of method for scheduling task as described above is realized when for executing the computer program.
In order to solve the above technical problems, the computer can present invention also provides a kind of computer readable storage medium
It reads storage medium and is stored with computer program, the computer program realizes task schedule as described above when being executed by processor
The step of method.
Method for scheduling task provided herein, including configuring the execution period of each task and to each task
Count value is initialized；Wherein, the execution period of the task of high priority is less than the task of low priority
The execution period；It calls task to check function according to predetermined period, is appointed described in increases with being checked using the task
The count value of business simultaneously judges whether the count value reaches the execution period；If the count value reaches the execution period,
It then executes the task and resets the count value.
As it can be seen that method for scheduling task provided herein, week is executed according to what the priority of each task configured each task
Phase, wherein the task of high priority executes execution period of the period less than the task of low priority.Further, appoint in calling
Function is checked in business, is checked the count value of each task of increases using task and is judged whether the count value of task reaches its execution
Period reaches after the task count value of low priority naturally, the count value of the task of high priority reaches it first executes the period
It executes the period, thus in the case where calling task checks the identical situation of number of function, the execution number of the task of high priority
It is greater than the execution number of the task of low priority, the effectively save time avoids the time of cyclical function from wasting, and improves system effect
Rate.And this method for scheduling task is applied to MCU, MCU no setting is required ROTS, that is, real-time system can realize the efficient tune of task
Degree, so as to be significantly reduced the occupancy to MCU resource.
Task scheduling apparatus, setting and computer readable storage medium provided herein, all has above-mentioned technology
Effect.
Detailed description of the invention
It in order to more clearly explain the technical solutions in the embodiments of the present application, below will be to institute in the prior art and embodiment
Attached drawing to be used is needed to be briefly described, it should be apparent that, the accompanying drawings in the following description is only some implementations of the application
Example, for those of ordinary skill in the art, without creative efforts, can also obtain according to these attached drawings
Obtain other attached drawings.
Fig. 1 is a kind of flow diagram of method for scheduling task provided by the embodiment of the present application；
Fig. 2 is a kind of schematic diagram of task scheduling apparatus provided by the embodiment of the present application；
Fig. 3 is a kind of schematic diagram of task scheduling equipment provided by the embodiment of the present application.
Specific embodiment
The core of the application is to provide a kind of method for scheduling task, can realize and appoint while reducing MCU resource occupation
The efficient scheduling of business, avoids the time of cyclical function from wasting, and improves system effectiveness；Another core of the application is to provide a kind of appoint
Business dispatching device, equipment and computer readable storage medium, all have above-mentioned technical effect.
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 flow diagram of method for scheduling task provided by the embodiment of the present application；With reference to
Shown in Fig. 1, which includes:
S101: it configures the execution period of each task and the count value of each task is initialized；Wherein, high priority
Task execute the period be less than low priority task the execution period；
Specifically, avoiding the time of cyclical function from wasting, the present embodiment to reduce the execution time of the task of low priority
In, for the task of different priorities, configure the different execution periods.Specifically, being carried out just after system electrification to each task
Beginningization, the execution period including configuring each task according to the priority of each task, specific value in combination with task priority
Carry out adaptable setting.Wherein, the execution period of the task of high priority is less than the execution period of the task of low priority, and
The execution period of the task of usual high priority can be set to a smaller value, it might even be possible to be set as zero.Low priority
The execution period of task can be set to a larger value, to realize that multiple poll just executes the primary task, reduction task is held
The purpose of row time.And initialize the corresponding count value of each task, the corresponding count value of each task can specifically be initialized
It is zero.
Wherein, in a kind of specific embodiment, the execution period of above-mentioned each task of configuration and the meter to each task
Numerical value can also include judging whether the task ID of task is greater than preset task total amount before being initialized；If the task ID of task
Greater than preset task total amount, then miscue is carried out.On the contrary, if the task ID of task is not more than preset task total amount, normally
The operation for executing the execution period of configuration task and the count value of task being initialized.
In addition, in a kind of specific embodiment, execution period of above-mentioned each task of configuration and to each task
Count value to carry out initialization may include configuring execution period of each task using task initialization function based on two-dimensional array
And the count value of each task is initialized；Wherein, the high byte of two-dimensional array indicates the execution period of task, two-dimemsional number
The low byte of group indicates the count value of task.
Specifically, pre-defining a two-dimensional array, the concrete form of the two-dimensional array can be Cycle_task [MAX_
Task_ID] [2], wherein MAX_Task_ID indicates task total amount.The high byte of two-dimensional array indicates the execution period of task,
Such as, [Task_ID] [1] Cycle_task, the low byte of two-dimensional array indicate the count value of corresponding task, e.g., Cycle_
task[Task_ID][0].Task_ID indicates that task ID, different tasks have different task IDs.
On the basis of defining two-dimensional array, further, configured respectively based on the two-dimensional array using task initialization function
The execution period of task and the count value of each task is initialized.Task initialization function specifically can be as follows:
void Task_Init(uint8_t Task_ID,uint8_t tm)
{
If(Task_ID>MAX_Task_ID)
{
return error；
}
Cycle_Task [Task_ID] [0]=0；
Cycle_Task [Task_ID] [1]=tm；
}
Specifically, i.e. Task_ID > MAX_Task_ID then returns to mistake and carries out mistake if task ID is greater than task total amount
It accidentally prompts, i.e. return error；If task ID is not more than task total amount, and the count value of the corresponding task of task ID is initial
The execution period assignment of the corresponding task of task ID is corresponding number by cancellation, i.e. Cycle_Task [Task_ID] [0]=0
Value, i.e. Cycle_Task [Task_ID] [1]=tm；Wherein, tm is to execute the period, and numerical value can carry out according to actual needs
Otherness setting, without limitation to this application.
Additionally, it is to be appreciated that step S101 can be only performed once upon power-up of the system, i.e., completion, which is matched, postpones without weight
The multiple operation for executing configuration.And when need modify configuration, such as increase task, change task the execution period when, then again into
Row configuration.
S102: task is called to check function according to predetermined period, to check the count value of increases task using task
And judges whether count value reaches and execute the period；
S103: it if count value, which reaches, executes the period, executes task and resets count value.
Specifically, writing while (1) cyclical function in advance, polling cycle, i.e., above-mentioned predetermined period, in while are set
(1) it during cyclical function operation, calls task to check function according to this predetermined period, checks that increases are appointed using task
The count value of business, and judge whether the count value of task reaches it and execute the period.The period is executed when the count value of task reaches it
When, it executes the task and resets the count value of the task.
Wherein, in a kind of specific embodiment, the above-mentioned count value that task described in increases is checked using task
It may include that one subtask of every calling checks function, check that the count value of task is added one by function using task.
Specifically, checking meter of the function by task using task when the present embodiment checks function using each calling task
Numerical value adds one mode to realize to carry out increment operation to the count value of task.Corresponding task checks that function can be as follows:
Wherein, Cycle_Task [i] [0] indicates the count value of i-th of task, and Cycle_Task [i] [1] is indicated i-th
The execution period of task.It calls and executes the primary task and check function then count is incremented by Cycle_Task [i] [0], and work as
Cycle_Task [i] [0] is greater than Cycle_Task [i] [1], i.e. when the count value of task reaches its execution period, executes this
It is engaged in corresponding mission function, i.e. execution Task_Function (i)；And the count value of the task is reset, i.e. execution Cycle_
Task [i] [0]=0；If Cycle_Task [i] [0] is not more than Cycle_Task [i] [1], i.e. the count value of task is not up to it
The period is executed, then exits task and checks function, waiting is called next time, until Cycle_Task [i] [0] is greater than Cycle_Task
When [i] [1], corresponding task is executed.
In conclusion method for scheduling task provided herein, configures holding for each task according to the priority of each task
The row period, wherein the task of high priority executes execution period of the period less than the task of low priority.Further, it is adjusting
Function is checked with task, checks the count value of each task of increases using task and judges whether the count value of task reaches it
The period is executed, naturally, the count value of the task of high priority reaches its first executes the period, after the task count value of low priority
Reach it and executes the period, thus in the case where calling task checks the identical situation of number of function, the execution of the task of high priority
Number is greater than the execution number of the task of low priority, and the effectively save time avoids the time of cyclical function from wasting, and improves system
System efficiency.And this method for scheduling task is applied to MCU, MCU no setting is required ROTS, that is, real-time system can realize the height of task
Effect scheduling, so as to be significantly reduced the occupancy to MCU resource.
Present invention also provides a kind of task scheduling apparatus, the device described below can be with method as described above phase
Mutually to should refer to.It please refers to shown in Fig. 2, which includes:
Configuration module 10, for configuring the execution period of each task and being carried out to the count value of each task initial
Change；Wherein, the execution period of the task of high priority is less than the execution period of the task of low priority；
Calling module 20, for calling task to check function according to predetermined period, to check that function is passed using the task
Increase the count value of the task and judges whether the count value reaches the execution period；
Execution module 30 executes the task and by the meter if reaching the execution period for the count value
Numerical value is reset.
On the basis of the above embodiments, as a kind of specific embodiment, configuration module 10 can be specifically used for being based on
Two-dimensional array configures the execution period of each task and the counting to each task using task initialization function
Value is initialized；Wherein, the high byte of the two-dimensional array indicates the execution period of the task, the two-dimensional array
Low byte indicate the count value of the task.
On the basis of the above embodiments, as a kind of specific embodiment, calling module 20 can be specifically used for every tune
Function is checked with the primary task, checks that the count value of the task is added one by function using the task.
On the basis of the above embodiments, as a kind of specific embodiment, can also include:
Judgment module, for judging whether the task ID of the task is greater than preset task total amount；
Cue module carries out miscue if the task ID for the task is greater than the preset task total amount.
Present invention also provides a kind of task scheduling equipments, comprising: memory 1 and processor 2；Wherein, memory 1 is used for
Store computer program；Processor 2 is for realizing following step when executing the computer program:
It configures the execution period of each task and the count value of each task is initialized；Wherein, high priority
The task the execution period be less than low priority the task the execution period；It is called according to predetermined period
Task checks function, to check the count value of task described in increases using the task, and whether judges the count value
Reach the execution period；If the count value reaches the execution period, the task and count value is clear is executed
Zero.
The embodiment of the above method is please referred to for the introduction of equipment provided herein, the application does not do superfluous herein
It states.
Present invention also provides a kind of computer readable storage medium, calculating is stored on the computer readable storage medium
Machine program, the computer program realize following step when being executed by processor:
It configures the execution period of each task and the count value of each task is initialized；Wherein, high priority
The task the execution period be less than low priority the task the execution period；It is called according to predetermined period
Task checks function, to check the count value of task described in increases using the task, and whether judges the count value
Reach the execution period；If the count value reaches the execution period, the task and count value is clear is executed
Zero.
The computer readable storage medium may include: USB flash disk, mobile hard disk, read-only memory (Read-Only
Memory, ROM), random access memory (Random Access Memory, RAM), magnetic or disk etc. is various to deposit
Store up the medium of program code.
Above method embodiment is please referred to for the introduction of computer readable storage medium provided by the present invention, the present invention
This will not be repeated here.
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 device disclosed in embodiment, set
For standby and computer readable storage medium, since it is corresponded to the methods disclosed in the examples, so the comparison of description is simple
Single, reference may be made to the description of the method.
Professional further appreciates that, unit described in conjunction with the examples disclosed in the embodiments of the present disclosure
And algorithm steps, can be realized with electronic hardware, computer software, or a combination of the two, in order to clearly demonstrate hardware and
The interchangeability of software generally describes each exemplary composition and step according to function in the above description.These
Function is implemented in hardware or software actually, the specific application and design constraint depending on technical solution.Profession
Technical staff can use different methods to achieve the described function each specific application, but this realization is not answered
Think beyond scope of the present application.
The step of method described in conjunction with the examples disclosed in this document or algorithm, can directly be held with hardware, processor
The combination of capable software module or the two is implemented.Software module can be placed in random access memory (RAM), memory, read-only deposit
Reservoir (ROM), electrically programmable ROM, electrically erasable programmable ROM, register, hard disk, moveable magnetic disc, CD-ROM or technology
In any other form of storage medium well known in field.
Method for scheduling task provided herein, device, equipment and computer readable storage medium are carried out above
It is discussed in detail.Specific examples are used herein to illustrate the principle and implementation manner of the present application, above embodiments
Explanation be merely used to help understand the present processes and its core concept.It should be pointed out that for the common of the art
For technical staff, 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 and modification also fall into the protection scope of the claim of this application.
Claims (10)
1. a kind of method for scheduling task characterized by comprising
It configures the execution period of each task and the count value of each task is initialized；Wherein, the institute of high priority
State task the execution period be less than low priority the task the execution period；
Task is called to check function according to predetermined period, to check the count value of task described in increases using the task,
And judge whether the count value reaches the execution period；
If the count value reaches the execution period, executes the task and reset the count value.
2. method for scheduling task according to claim 1, which is characterized in that the execution period of each task of the configuration and
The count value of each task is initialized, comprising:
The execution period of each task is configured and to each described using task initialization function based on two-dimensional array
The count value of business is initialized；Wherein, the high byte of the two-dimensional array indicates the execution period of the task, described
The low byte of two-dimensional array indicates the count value of the task.
3. method for scheduling task according to claim 2, which is characterized in that described to check increases using the task
The count value of the task includes:
It is every that the primary task is called to check function, check that the count value of the task is added one by function using the task.
4. method for scheduling task according to claim 1, which is characterized in that configure the execution period of each task and to each
Before the count value of the task is initialized further include:
Judge whether the task ID of the task is greater than preset task total amount；
If the task ID of the task is greater than the preset task total amount, miscue is carried out.
5. a kind of task scheduling apparatus characterized by comprising
Configuration module, for configuring the execution period of each task and being initialized to the count value of each task；Wherein,
The execution period of the task of high priority is less than the execution period of the task of low priority；
Calling module, for calling task to check function according to predetermined period, to be checked described in increases using the task
The count value of task, and judge whether the count value reaches the execution period；
Execution module executes the task and count value is clear if reaching the execution period for the count value
Zero.
6. task scheduling apparatus according to claim 5, which is characterized in that the configuration module is specifically used for based on two dimension
Array using task initialization function configure each task the execution period and to the count value of each task into
Row initialization；Wherein, the high byte of the two-dimensional array indicates the execution period of the task, the two-dimensional array it is low
The count value of task described in byte representation.
7. task scheduling apparatus according to claim 5, which is characterized in that the calling module is specifically used for every calling one
The secondary task checks function, checks that the count value of the task is added one by function using the task.
8. task scheduling apparatus according to claim 5, which is characterized in that further include:
Judgment module, for judging whether the task ID of the task is greater than preset task total amount；
Cue module carries out miscue if the task ID for the task is greater than the preset task total amount.
9. a kind of task scheduling equipment characterized by comprising
Memory, for storing computer program；
Processor realizes such as Claims 1-4 described in any item method for scheduling task when for executing the computer program
The step of.
10. a kind of computer readable storage medium, which is characterized in that the computer-readable recording medium storage has computer journey
Sequence realizes the step such as the described in any item method for scheduling task of Claims 1-4 when the computer program is executed by processor
Suddenly.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910818241.XA CN110515719A (en) | 2019-08-30 | 2019-08-30 | A kind of method for scheduling task and relevant apparatus |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910818241.XA CN110515719A (en) | 2019-08-30 | 2019-08-30 | A kind of method for scheduling task and relevant apparatus |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110515719A true CN110515719A (en) | 2019-11-29 |
Family
ID=68629872
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910818241.XA Pending CN110515719A (en) | 2019-08-30 | 2019-08-30 | A kind of method for scheduling task and relevant apparatus |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110515719A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111258733A (en) * | 2020-01-14 | 2020-06-09 | 明见（厦门）技术有限公司 | Embedded OS task scheduling method and device, terminal equipment and storage medium |
| CN112925631A (en) * | 2021-04-08 | 2021-06-08 | 上海科世达-华阳汽车电器有限公司 | Task scheduling method and device, electronic equipment and storage medium |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20030037091A1 (en) * | 2001-08-09 | 2003-02-20 | Kozo Nishimura | Task scheduling device |
| CN102222022A (en) * | 2011-07-15 | 2011-10-19 | 范示德汽车技术（上海）有限公司 | Real-time task scheduling method based on multicore processor |
| US20130227582A1 (en) * | 2007-03-07 | 2013-08-29 | International Business Machines Corporation | Prediction Based Priority Scheduling |
| CN103885881A (en) * | 2014-04-03 | 2014-06-25 | 北京航空航天大学 | High-real-time concurrent testing method based on multi-task mechanism of VxWorks system |
| CN109445939A (en) * | 2018-10-19 | 2019-03-08 | 积成电子股份有限公司 | A kind of dispatching method based on the soft real-time scheduling kernel for actively selling mechanism |
-
2019
- 2019-08-30 CN CN201910818241.XA patent/CN110515719A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20030037091A1 (en) * | 2001-08-09 | 2003-02-20 | Kozo Nishimura | Task scheduling device |
| US20130227582A1 (en) * | 2007-03-07 | 2013-08-29 | International Business Machines Corporation | Prediction Based Priority Scheduling |
| CN102222022A (en) * | 2011-07-15 | 2011-10-19 | 范示德汽车技术（上海）有限公司 | Real-time task scheduling method based on multicore processor |
| CN103885881A (en) * | 2014-04-03 | 2014-06-25 | 北京航空航天大学 | High-real-time concurrent testing method based on multi-task mechanism of VxWorks system |
| CN109445939A (en) * | 2018-10-19 | 2019-03-08 | 积成电子股份有限公司 | A kind of dispatching method based on the soft real-time scheduling kernel for actively selling mechanism |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111258733A (en) * | 2020-01-14 | 2020-06-09 | 明见（厦门）技术有限公司 | Embedded OS task scheduling method and device, terminal equipment and storage medium |
| CN112925631A (en) * | 2021-04-08 | 2021-06-08 | 上海科世达-华阳汽车电器有限公司 | Task scheduling method and device, electronic equipment and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10223165B2 (en) | Scheduling homogeneous and heterogeneous workloads with runtime elasticity in a parallel processing environment | |
| US8869159B2 (en) | Scheduling MapReduce jobs in the presence of priority classes | |
| Lin et al. | Scheduling scientific workflows elastically for cloud computing | |
| US8028286B2 (en) | Methods and apparatus for scheduling threads on multicore processors under fair distribution of cache and other shared resources of the processors | |
| US20100115526A1 (en) | Method and apparatus for allocating resources in a compute farm | |
| US10372479B2 (en) | Scheduling framework for tightly coupled jobs | |
| CN104580396A (en) | Task scheduling method, node and system | |
| CN111352736A (en) | Method and device for scheduling big data resources, server and storage medium | |
| CN110532100B (en) | Method, device, terminal and storage medium for scheduling resources | |
| EP2839370A1 (en) | Time slack application pipeline balancing for multi/many-core plcs | |
| CN110515719A (en) | A kind of method for scheduling task and relevant apparatus | |
| CN115543615A (en) | Resource allocation method and device, electronic equipment and storage medium | |
| EP4404539A1 (en) | Resource scheduling method, apparatus and system, device, medium, and program product | |
| CN109271236A (en) | A kind of method, apparatus of traffic scheduling, computer storage medium and terminal | |
| CN103164338B (en) | The analogy method of concurrent processing system and device | |
| CN116483546A (en) | Distributed training task scheduling method, device, equipment and storage medium | |
| CN113590289B (en) | Job scheduling method, system, device, computer equipment and storage medium | |
| Binns | A robust high-performance time partitioning algorithm: the digital engine operating system (DEOS) approach | |
| CN107391262B (en) | Job scheduling method and device | |
| CN109165027A (en) | VME operating system installation method, device, equipment and readable storage medium storing program for executing | |
| US11403143B2 (en) | DRR-based two stages IO scheduling algorithm for storage system with dynamic bandwidth regulation | |
| Kakkar | Scheduling techniques for operating systems for medical and IoT devices: A review | |
| CN112860446A (en) | Message distribution method | |
| US20130283288A1 (en) | System resource conserving method and operating system thereof | |
| CN115168057B (en) | Resource scheduling method and device based on k8s cluster |
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: 20191129 |