A Real-time Kernel Interrupt Management Mechanism Based On μC/OS-Ⅲ

In traditional embedded real-time kernel,events include interrupts and tasks.The kernel always schedules the highest priority task.Devices assign priority levels to interrupts and interrupts’ priorities are always higher than the tasks. In order to process interrupts in time and prevent interrupts from being lost,the embedded real-time kernel immediately process the interrupt after it occurred.But in this way,the low-priority interrupts have bad disturbance to high-priority tasks,and the fact that two kinds of events both exist in a kernel may make system schedule more complex.So later many kernels retreat interrupts as tasks.The way that tasks deal with high-priority interrupts will cost more time and low-priority interrupts have bad disturbance on high-priority tasks.Aiming at the problem mentioned above,a common priority allocation strategy is proposed.If interrupt is more than a task,its priority should be higher than task priority and should be scheduled immediately.Otherwise if the interrupt priority is lower than the task priority then the interrupt is scheduled by task.The result of the experiment and analysis of theory show that the new interrupt processing mechanism this paper proposed can reduce the response time of tasks and ensure that tasks can be scheduled effectively and predictable.