CN100351793C - Task scheduling method for embedded real-time operation system supporting OSEK standard - Google Patents
Task scheduling method for embedded real-time operation system supporting OSEK standard Download PDFInfo
- Publication number
- CN100351793C CN100351793C CNB2005100607354A CN200510060735A CN100351793C CN 100351793 C CN100351793 C CN 100351793C CN B2005100607354 A CNB2005100607354 A CN B2005100607354A CN 200510060735 A CN200510060735 A CN 200510060735A CN 100351793 C CN100351793 C CN 100351793C
- Authority
- CN
- China
- Prior art keywords
- task
- scheduling
- state
- running environment
- priority
- 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.)
- Expired - Fee Related
Links
Images
Abstract
The present invention relates to an optimization method for supporting the task dispatching of an OSEK standard embedded operating system. The realization steps are as follows: 1), various dispatching and switching conditions are analyzed according to task states; 2), a scheduling process can be divided into the following four steps: 2.1), a task with the highest priority is looked in ready tasks; 2.2), the operating environment of the current operating task is preserved; 2.3), CPU carries out the pointer evaluation, namely, the occupation of the CPU is exchanged; 2.4), the operating environment of the task with the highest priority is restored; 3), a strategy is optimized, scheduled and divided into four scheduling strategies according to the covering situations of the four steps of the scheduling process; 4), different scheduling strategies are selected according to different actual scheduling conditions when the task is operated, and the time T consumed by the scheduling of each condition is different according to the different strategies are selected. The present invention has the advantages that a special scheduling strategy is adopted aiming at each scheduling point, the switching time of the task is obviously reduced under a plurality of conditions, and the time performance of a real-time operating system is optimized.
Description
Technical field
The present invention relates to the embedded real-time operating system technology, mainly is a kind of task scheduling optimization method of embedded OS of the OSEK of support standard.
Background technology
Along with the fast development of software and hardware technology, embedded OS has been applied to every field, control automatically, traffic, Aero-Space or the like.Embedded real-time operating system (Real-Time Operating System is called for short RTOS) wants strictness to satisfy affairs and time relation with the different of maximum between other common systems exactly.Such as control section, the automobile electric control system of main equipment, the real time operating system that all requires to be adopted can respond fast, dispatches fast, deals with the various situations very harsh to time requirement.
Task scheduling is a part most crucial in the embedded real-time operating system, most critical, and dispatching efficiency directly has influence on the real-time performance of RTOS.Weigh the technology of a RTOS, most important index is exactly task T switching time of scheduling
S
The structure that occupation rate is the real-time micro-kernels of multitask than higher commercial real time operating system great majority on the market, but the preemption scheduling strategy that is based on priority of employing.On various scheduling situations, call the switching that same function is finished the work.The real-time task scheduling method that the uC/OS-II of open source code provides adopts scheduling function OSSched () to finish.In OSSched (), find the task of limit priority earlier, finish the process that actual task is switched with macro call OS_TASK_SW by the soft interruption of system then, the running environment that is suspended task is pressed into storehouse, and the running environment of the higher priority task of moving is later recovered from storehouse.
This is the work that the most complicated task switch instances need be done in fact, be that current moving of task is interrupted, need to preserve the running environment of current task, switch to originally moving of a task again, the running environment that the needs recovery is original is preserved and the environment that resumes operation has occupied the most of the time that whole task is switched.To some simple dispatching points,, preserve and the process of the environment that resumes operation is all wasted as finishing this situation of task that current task is reruned and just activated.This is to mean that task finished its function because end task, and do not need to preserve its running environment, and activating of task has brought into operation just, does not also have former running environment.This also adopts uniform dispatching with regard to the state of not considering institute's task switching has been described, will certainly influence the dispatching efficiency of embedded real-time operating system greatly.
Summary of the invention
The objective of the invention is at above-mentioned defective, a kind of task scheduling optimization method of embedded OS of the OSEK of support standard is provided.
The present invention solves the scheme that its technical matters adopts: the task switching state of supporting the operating system of OSEK standard by labor, segment different dispatching point situations, adopt special-purpose scheduling strategy at every kind of dispatching point, make the task switching time of obviously minimizing as a rule, optimize the time performance of real time operating system greatly.
Performing step of the present invention is as follows:
1), analyze all kinds of scheduling switch instances according to task status:
1.1), in the OSEK standard according to the difference of task status classification, system is divided into two kinds of situations of BCC1 (basic task), ECC1 (expansion task); Wherein the task status among the BCC1 comprises three kinds of situations: operation, ready, hang up, the task status among the ECC1 comprises four kinds of situations: operation, ready, wait for, hang up.The present invention is subdivided into intermediate state and initial state with task ready state wherein, promptly to be task run enter ready state to intermediate state after half incident of being seized or waiting for takes place, the ready state that initial state is task task directly enters when hang-up is activated into ready state or system start-up;
1.2), the scheduling situation under BCC1 is divided into following three kinds:
Scheduling situation 1: the current task end of run enters suspended state, and the high-priority task that is about to operation is an initial state; Need not preserve current task running environment, directly carry out operation such as pointer assignment after, can move back one high-priority task;
Scheduling situation 2: the current task end of run enters suspended state, and the high-priority task that is about to operation is an intermediate state; Need not preserve current task running environment, carry out operation such as pointer assignment after, recover the running environment of back one high-priority task, rerun;
Scheduling situation 3: current task is seized enters ready state, and the high priority that is about to operation is an initial state; Preserve current task running environment, carry out to move high-priority task after the operation such as pointer assignment.
1.3), the scheduling situation under ECC1, except that above-mentioned 1.2), add following three kinds again:
Scheduling situation 4: current task enters waiting status, and the high-priority task that is about to operation is an intermediate state; Preserve current task running environment, carry out operation such as pointer assignment after, recover the running environment of back one high-priority task, rerun;
Scheduling situation 5: current task enters waiting status, and the high-priority task that is about to operation is an initial state; Preserve current task running environment, carry out to move high-priority task after the operation such as pointer assignment;
Scheduling situation 6: current task is seized enters ready state, and the high-priority task that is about to operation is an intermediate state, and this task is to have entered intermediate state because the incident of its wait has taken place; Preserve current task running environment, carry out operation such as pointer assignment after, recover the running environment of high-priority task, rerun;
2), can be divided into following four steps to scheduling process:
2.1), in ready task, find the task of limit priority;
2.2), preserve the running environment of current operation task;
2.3), carry out CPU and take pointer assignment, promptly exchange the CPU right of possession corporeal right;
2.4), recover the running environment of limit priority task;
3, according to the coverage condition to four steps of scheduling process, the Optimization Dispatching strategy is divided into following four classes:
3.1), scheduling strategy A: simple scenario, only do the scheduling process step 2.1), 2.3);
3.2), scheduling strategy B: generalized case, only do the scheduling process step 2.1), 2.2), 2.3);
3.3), scheduling strategy C: generalized case, only do the scheduling process step 2.1), 2.3), 2.4);
3.4), scheduling strategy D: complex situations, do whole scheduling process steps 2.1), 2.2), 2.3), 2.4);
The difference of actual schedule situation during 4, according to task run, select different scheduling strategies for use: the dispatching office consumed time T of every kind of situation is different different according to selected strategy, the T of D correspondence
SDAt most, the T of A correspondence
SAMinimum, the T of B and C correspondence
SB, T
SCBe intermediate value.
Remarkable advantage of the present invention:
The task of the dispatching method of unified function is made as T switching time
S, from analytically seeing intuitively, it is few that Optimization Dispatching strategy of the present invention relates to process, has the clear superiority on following scheduling time, significantly optimized the performance of system call:
T
SA＜T
S，
T
SB＜T
S，
T
SC＜T
S，
And T
SDAnd T
SRemain basically stable.
Description of drawings
Fig. 1 BCC1 basic task state transition graph;
BCC1 basic task state transition graph after Fig. 2 refinement of the present invention;
Fig. 3 ECC1 expansion task status transition diagram;
ECC1 expansion task status transition diagram after Fig. 4 refinement of the present invention;
Fig. 5 embodiments of the invention 1;
Fig. 6 embodiments of the invention 2;
Embodiment
Below in conjunction with accompanying drawing and two embodiment invention is described further.The task scheduling optimization method of the embedded OS of this support OSEK standard, performing step is as follows:
One, anatomizes all kinds of scheduling switch instances according to task status.
According to the difference of task status classification, system is divided into two kinds of situations of BCC1 (basic task), ECC1 (expansion task) in the OSEK standard.
According to the OSEK standard, the task status among the BCC1 comprises three kinds of situations: operation, ready, hang-up.The task of running status is meant the task of the current CPU of taking, the task of ready state be carried out operation prepare, only etc. CPU time task or move half back by other task preemption, again in the task of waiting for CPU time, the task of suspended state be voluntarily end of run or just produced and etc. task to be activated.
Task status among the ECC1 comprises four kinds of situations: operation, ready, wait for, hang up.Waiting status is that task is waited for the state that a certain incident takes place.The situation of other three kinds of states and BCC1 is the same.
The basic task state exchange relation of BCC1 as shown in Figure 1.The ready attitude of task can be subdivided into intermediate state, initial state again.Promptly to be task run enter ready state to intermediate state after half is seized, the ready state that initial state is task task directly enters when hang-up is activated into ready state or system start-up.BCC1 task status transformational relation after the refinement as shown in Figure 2.
Therefore, scheduling situation under BCC1 can be divided into following several: (RunningTask represents the task of current operation, the limit priority task that the HighestTask representative has been found, PCPUCur represents the current pointer that takies the task of CPU, PCPUCur points to RunningTask before the scheduling)
Scheduling situation 1:RunningTask end of run enters suspended state, and HighestTask is an initial state.
Need not preserve RunningTask running environment, directly carry out the operation such as assignment (PCPUCur is pointed to HighestTask) of PCPUCur after, can move the HighestTask task body.This is the simplest situation, only does the assignment of pointer, need not preserve and also need not recover relevant running environment.
Scheduling situation 2:RunningTask end of run enters suspended state, and HighestTask is an intermediate state.
Need not preserve RunningTask running environment, carry out the operation such as assignment of PCPUCur after, recover the running environment of original HighestTask, continue operation.This is a generalized case, needs the assignment of pointer, recovers relevant running environment, need not preserve current running environment.
Scheduling situation 3:RunningTask is seized enters ready state, and HighestTask is an initial state.
Preserve RunningTask running environment, carry out to move the HighestTask task body after the operations such as assignment of PCPUCur.This also is more general situation, needs the assignment of pointer, needs to preserve current running environment, but need not recover original running environment.
Expansion task status transformational relation as shown in Figure 3 under the ECC1 situation.Similar with BCC1, the ready attitude of task is divided into intermediate state, initial state.But intermediate state is seized except task and is caused, and also may be that this task enters ready state because being in the incident of its wait of task of waiting status has taken place, and this ready state also belongs to intermediate state.ECC1 task status transformational relation after the refinement as shown in Figure 4.
Because increased waiting status, can know after the analysis that except existing four kinds of scheduling situations under the BCC1, ECC1 also has other three kinds of situations:
Scheduling situation 4:RunningTask enters waiting status, and HighestTask is an intermediate state.
Preserve RunningTask running environment, carry out the operations such as assignment of PCPUCur after, recover the running environment of original HighestTask, continue operation.The most complicated scheduling situation that Here it is, is preserved current running environment, is recovered three kinds of operations of original running environment and all need at pointer assignment.
Scheduling situation 5:RunningTask enters waiting status, and HighestTask is an initial state.
Preserve RunningTask running environment, carry out the operations such as assignment of PCPUCur after, directly move function body, the operation of the environment that do not need to resume operation.This is the same with scheduling situation 3 on the complicated operation degree.
Scheduling situation 6:RunningTask is seized enters ready state, and HighestTask is an intermediate state, and HighestTask has entered intermediate state because the incident of its wait has taken place.
Preserve RunningTask running environment, carry out the operations such as assignment of PCPUCur after, recover the running environment of original HighestTask, continue operation.This is the same with scheduling situation 4 on the complicated operation degree, also is complicated situation.
Two, the scheduling process segmentation
Analyze and comprehensive all kinds of situations, scheduling process can be divided into following four steps:
1. the task (HighestTask) that finds limit priority in ready task prepares to switch (steps necessary)
2. preserve the running environment (optional step) of current operation task (RunningTask)
3. carry out the pointer assignment of PCPUCur, promptly exchange the CPU right of possession corporeal right (steps necessary)
4. recover the running environment (optional step) of limit priority task (HighestTask)
Three, scheduling strategy is classified.
According to coverage condition, scheduling strategy is divided into following four classes to four steps of scheduling process:
Scheduling strategy A: simple scenario, only do 1,3 of scheduling process step.
Scheduling strategy B: generalized case, only do 1,2,3 of scheduling process step.
Scheduling strategy C: generalized case, only do 1,3,4 of scheduling process step.
Scheduling strategy D: complex situations, do 1,2,3,4 of whole scheduling process steps.
The difference of actual schedule situation is selected the scheduling strategy of optimization for use during four, according to task run.
The dispatching office consumed time T of every kind of situation is different different according to selected strategy, the T of D correspondence
SDAt most, the T of A correspondence
SAMinimum, the T of B and C correspondence
SB, T
SCBe intermediate value.
Embodiment 1: as shown in Figure 5.Operating system under the BCC1 state adopts full preempt-mode.Have three basic tasks, P1, P2, P3, priority is arranged from high to low, and promptly P1 priority is the highest, and P2 takes second place, and P3 priority is minimum.
T0 system start-up constantly, this moment, task P1 hung up, and P2, P3 are ready, the high and operation earlier of P2 priority, P3 is in the initial state in the ready state.To t1 constantly, scheduling for the first time takes place, current task P2 end of run, the high-priority task P3 operation of initial state, this belongs to the simplest scheduling situation, adopts the scheduling strategy A after optimizing.
P3 moves always, activates P1 up to it.Because P1 priority is higher than P3, then P3 is seized, and scheduling for the second time takes place t2 constantly, and P3 enters the intermediate state of ready state, the P1 operation.Because P3 not operation does not finish, so need preserve its context environmental when being seized, P1 directly is activated and enters ready state from hanging up, so adopt scheduling strategy B.
P1 runs to end always, and t3 takes place to dispatch for the third time constantly, has only P3 in the current ready task, and P3 obtains CPU and operation.Because P1 enters suspended state behind the end of run, so do not need to preserve its running environment.And P3 to be intermediate state from ready state bring into operation, so need to recover its running environment, therefore adopt scheduling strategy C.
The operating system of the Optimization Dispatching strategy after contrast operation on the CME555 development board is adopted the uniform dispatching function and adopted the present invention, CPU is MPC555, frequency 40MHz.On logic analyser, adopt the sample frequency of 100M, it is as shown in table 1 below respectively switching time that test obtains each task constantly:
| Scheduling constantly | Task switching time (us) during the uniform dispatching function | Behind the Optimization Dispatching strategy | Contrast effect | |
| Task switching time (us) | Scheduling strategy | |||
| t1 | 7.5 | 1 | A | T SASignificantly less than T S |
| t2 | 7.5 | 4.5 | B | T SBBe significantly less than T S |
| t3 | 7.5 | 4.5 | C | T SCBe significantly less than T S |
Table 1
Embodiment 2: on the basis of embodiment 1, embodiment 2 again.As shown in Figure 6.Embodiment 2 is the operating system under the ECC1 state, adopts full preempt-mode.Have three basic tasks, P4, P5, P6, priority is arranged from high to low, and promptly P4 priority is the highest, and P5 takes second place, and P6 priority is minimum.Simple for what illustrate, the scheduling situation of 2 outstanding " wait " states of example.
T0 system start-up constantly, this moment, task P4 hung up, and P5, P6 are all ready, the highest and operation earlier of P5 priority, this moment, P6 was in the initial state in the ready state.To t1 constantly, scheduling for the first time takes place in the P5 end of run, and the t1 of P6 operation and example 1 is constantly similar, adopts scheduling strategy A.
P6 moves always, activates P4 up to it.Because P4 priority is higher than P6, then P6 is seized, and scheduling for the second time takes place t2 constantly, and P6 enters the intermediate state of ready state, the P4 operation.Constantly similar with the t2 of example 1, adopt scheduling strategy B.
P4 moves always, up to its waiting event 1.Be that scheduling for the second time takes place t3 constantly, P4 enters waiting status, the P6 operation.Because P4 be enter waiting status and not operation finish, so need to preserve its running environment, P6 is that intermediate state from ready attitude enters operation simultaneously, the environment that also needs to resume operation is so adopt scheduling strategy D, the most complicated scheduling situation that Here it is.
P6 moves always, is provided with incident 1 up to it.P4 then enters the intermediate state of ready attitude because the incident of waiting for 1 takes place.Because P4 priority height, then scheduling for the third time just takes place in t4 constantly, and P6 is seized the intermediate state that enters ready state, the P4 operation.Because P6 running environment needs to preserve, P4 enters operation again from the intermediate state that waiting status enters ready state, need to recover its running environment, and also be again the most complicated scheduling situation, adopt scheduling strategy D.
The same operating system that on the CME555 development board, contrasts operation employing uniform dispatching function and adopt Optimization Dispatching strategy of the present invention.
It is as shown in table 2 below respectively switching time that test obtains each task constantly:
| Scheduling constantly | Task switching time (us) during the uniform dispatching function | Behind the Optimization Dispatching strategy | Contrast effect | |
| Task switching time (us) | Scheduling strategy | |||
| t1 | 7.5 | 1 | A | T SASignificantly less than T S |
| t2 | 7.5 | 4.5 | B | T SBBe significantly less than T S |
| t3 | 7.5 | 7.8 | D | T SDAnd T SRemain basically stable |
| t4 | 7.5 | 7.8 | D | T SDAnd T SRemain basically stable |
Table 2
Claims (4)
1, a kind of task scheduling optimization method of supporting the embedded OS of OSEK standard, it is characterized in that: performing step is as follows:
1), analyze all kinds of scheduling switch instances according to task status:
1.1), in the OSEK standard according to the difference of task status classification, system is divided into BCC1, promptly basic task, ECC1 promptly expand two kinds of situations of task; Wherein the task status among the BCC1 comprises three kinds of situations: operation, ready, hang up, the task status among the ECC1 comprises four kinds of situations: operation, ready, wait for, hang up; The ready state of task is subdivided into intermediate state and initial state, promptly to be task run enter ready state to intermediate state after half incident of being seized or waiting for takes place, the ready state that initial state is task task directly enters when hang-up is activated into ready state or system start-up;
1.2), the scheduling situation under BCC1 is divided into following three kinds:
Scheduling situation 1: the current task end of run enters suspended state, and the high-priority task that is about to operation is an initial state; Need not preserve current task running environment, directly carry out pointer assignment operation after, can move back one high-priority task;
Scheduling situation 2: the current task end of run enters suspended state, and the high-priority task that is about to operation is an intermediate state; Need not preserve current task running environment, carry out pointer assignment operation after, recover the running environment of back one high-priority task, rerun;
Scheduling situation 3: current task is seized enters ready state, and the high priority that is about to operation is an initial state; Preserve current task running environment, carry out to move high-priority task after the pointer assignment operation.
1.3), the scheduling situation under ECC1, except that above-mentioned 1.2), add following three kinds again:
Scheduling situation 4: current task enters waiting status, and the high-priority task that is about to operation is an intermediate state; Preserve current task running environment, carry out the pointer assignment operation after, recover the running environment of back one high-priority task, rerun;
Scheduling situation 5: current task enters waiting status, and the high-priority task that is about to operation is an initial state; Preserve current task running environment, carry out to move high-priority task after the pointer assignment operation;
Scheduling situation 6: current task is seized enters ready state, the high-priority task that is about to operation is an intermediate state, and this task is to have entered intermediate state because the incident of its wait has taken place, preserve current task running environment, after carrying out the pointer assignment operation, recover the running environment of high-priority task, rerun;
2), scheduling process is divided into following four steps:
2.1), in ready task, find the task of limit priority;
2.2), preserve the running environment of current operation task;
2.3), carry out CPU and take pointer assignment, promptly exchange the CPU right of possession corporeal right;
2.4), recover the running environment of limit priority task;
3), according to the coverage condition of four steps of scheduling process, the Optimization Dispatching strategy is divided into following four classes:
3.1), scheduling strategy A: simple scenario, only do the scheduling process step 2.1), 2.3);
3.2), scheduling strategy B: generalized case, only do the scheduling process step 2.1), 2.2), 2.3);
3.3), scheduling strategy C: generalized case, only do the scheduling process step 2.1), 2.3), 2.4);
3.4), scheduling strategy D: complex situations, do whole scheduling process steps 2.1), 2.2), 2.3), 2.4);
4), the difference of actual schedule situation during according to task run, select different scheduling strategies for use: the dispatching office consumed time T of every kind of situation is different different according to selected strategy, the T of D correspondence
SDAt most, the T of A correspondence
SAMinimum, the T of B and C correspondence
SB, T
SCBe intermediate value.
2, the task scheduling optimization method of the embedded OS of support according to claim 1 OSEK standard is characterized in that: the state of task be divided into operation, ready, hang up, four kinds of waits; The task of running status is meant the task of the current CPU of taking, the task of ready state be carried out operation prepare, only etc. CPU time task or move half back by other task preemption, again in the task of waiting for CPU time, the task of suspended state be voluntarily end of run or just produced and etc. task to be activated; The task of waiting status is the task of waiting for that a certain incident takes place; Ready state is subdivided into intermediate state and initial state again; The task of attitude and initial state is different to the environment requirement of resuming operation because mediate, and these two kinds of different states were optimized when scheduling strategy switched at task; For the task of initial state, directly remove the step of the environment that resumes operation, thereby reduce the time of scheduling, improve performance.
3, the task scheduling optimization method of the embedded OS of support OSEK standard according to claim 1, it is characterized in that: operating system adopts the mode of seizing entirely, so the task switching point does not occur over just after the task run end, when also occurring in the task preemption low priority task of high priority; These two kinds of scheduling situations also are different to the requirement that whether needs to preserve current operation task running environment; When task run finishes to dispatch, because finished all operations, so do not need to preserve its running environment; And being seized of task is not also finished all operations, needs to continue in due course operation, so system need preserve running environment for it.
4, the task scheduling optimization method of the embedded OS of support OSEK standard according to claim 1 is characterized in that: OSEK standard code, the task status under the ECC1 operating system have a kind of waiting status that is; Task enters waiting status because waiting for the generation of some incidents, initiatively abandons CPU, and follow-up reforwarding row takes place waiting event; Wait for the scheduling that takes place because of task, the task of entering waiting status is not finished all operations yet, need continue operation after the incident of waiting for takes place, so system also will preserve running environment for it.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2005100607354A CN100351793C (en) | 2005-09-12 | 2005-09-12 | Task scheduling method for embedded real-time operation system supporting OSEK standard |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2005100607354A CN100351793C (en) | 2005-09-12 | 2005-09-12 | Task scheduling method for embedded real-time operation system supporting OSEK standard |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1737764A CN1737764A (en) | 2006-02-22 |
| CN100351793C true CN100351793C (en) | 2007-11-28 |
Family
ID=36080567
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2005100607354A Expired - Fee Related CN100351793C (en) | 2005-09-12 | 2005-09-12 | Task scheduling method for embedded real-time operation system supporting OSEK standard |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100351793C (en) |
Families Citing this family (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100465857C (en) * | 2006-10-12 | 2009-03-04 | 浙江大学 | Simplifying method facing to embedded system low-power consumption real time task scheduling |
| CN100416463C (en) * | 2006-10-12 | 2008-09-03 | 浙江大学 | Low power consumption real time task parameter model dispatching method facing embedded system |
| CN101290588B (en) * | 2008-03-07 | 2010-06-16 | 重庆邮电大学 | Micro-embedded real time task scheduling device and scheduling method |
| CN101547149B (en) * | 2009-04-20 | 2013-06-19 | 浙江大学 | Dynamic scheduling method for OSEK COM messages based on CAN network |
| CN102013191B (en) * | 2010-09-02 | 2012-10-03 | 东北师范大学 | Intelligent teaching aid used for operation system experiment teaching |
| CN102043668B (en) * | 2010-12-10 | 2013-05-22 | 成电汽车电子产业园(昆山)有限公司 | Method for activating task in embedded real-time operating system for multiple times |
| CN102801551B (en) * | 2012-03-14 | 2014-09-24 | 中国汽车技术研究中心 | Open systems and the corresponding interfaces for automotive electronics (OSEK) network management-based controller area network (CAN) management method |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20010034751A1 (en) * | 2000-04-21 | 2001-10-25 | Shinichiro Eto | Real-time OS simulator |
| CN1529233A (en) * | 2003-10-17 | 2004-09-15 | 清华大学 | Binary chop type task dispatching method for embedding real-time operating system |
-
2005
- 2005-09-12 CN CNB2005100607354A patent/CN100351793C/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20010034751A1 (en) * | 2000-04-21 | 2001-10-25 | Shinichiro Eto | Real-time OS simulator |
| CN1529233A (en) * | 2003-10-17 | 2004-09-15 | 清华大学 | Binary chop type task dispatching method for embedding real-time operating system |
Non-Patent Citations (3)
| Title |
|---|
| 基于OSEK规范的嵌入式实时操作系统研究 张宝民，孙晓民.计算机应用研究，第4期 2004 * |
| 基于QTE的嵌入式Linux中文环境解决方案 吴伟清，王磊，吴朝晖.计算机工程，第31卷第2期 2005 * |
| 清华OSEK车用嵌入式实时操作系统设计 张宝民，孙晓民.计算机工程与设计，第25卷第5期 2004 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN1737764A (en) | 2006-02-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN100351793C (en) | Task scheduling method for embedded real-time operation system supporting OSEK standard | |
| US20130283286A1 (en) | Apparatus and method for resource allocation in clustered computing environment | |
| CN1308825C (en) | System and method for CPI load balancing in SMT processors | |
| CN103365726B (en) | A kind of method for managing resource towards GPU cluster and system | |
| CN1790270A (en) | Java virtual machine implementation method supporting multi-process | |
| CN101051280A (en) | Intelligent card embedded operation system and its control method | |
| CN1945540A (en) | System and method for CPI scheduling on SMT processors | |
| WO2013165450A1 (en) | Process scheduling using scheduling graph to minimize managed elements | |
| US20130167152A1 (en) | Multi-core-based computing apparatus having hierarchical scheduler and hierarchical scheduling method | |
| CN1825286A (en) | Threading realizing and threading state transition method for embedded SRAM operating system | |
| CN100337207C (en) | Detection method of signal quantization deadlock | |
| CN101963922A (en) | Task processing method and device | |
| CN112084140B (en) | Fine granularity stream data processing method and system in heterogeneous system | |
| CN101980147B (en) | Multithreaded processor and instruction execution and synchronization method thereof | |
| CN1975676A (en) | Multi-node computer system and method for monitoring capability | |
| CN112882828A (en) | Upgrade processor management and scheduling method based on SLURM job scheduling system | |
| CN100336346C (en) | Consumption control method of parallel computing trunking power supply | |
| CN1687901A (en) | Real time task dispatching method based on interrupt | |
| CN103677959A (en) | Virtual machine cluster migration method and system based on multicast | |
| CN114661460A (en) | AI framework two-stage parallel acceleration method for heterogeneous many-core processor | |
| CN1851652A (en) | Method for realizing process priority-level round robin scheduling for embedded SRAM operating system | |
| CN102012844A (en) | Chip multi-processor (CMP) system-oriented thread scheduling method | |
| CN112579287A (en) | Cloud arrangement system and method based on read-write separation and automatic expansion | |
| CN1851651A (en) | Method for realizing process priority scheduling for embedded SRAM operating system | |
| CN111190704A (en) | Task classification processing method based on big data processing framework |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20071128 Termination date: 20170912 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |