μC/O S-Ⅱ中最高优先级查找算法分析

Analysis of Preferential Algorithm in μC/OS-Ⅱ

μC/OS-Ⅱ内核是采用占先式调度方式的实时内核,保证最高优先级任务一旦进入就绪态,就能立刻得到CPU的使用权,减少系统响应时间,从而保证系统实时性。文中阐述μC/OS-Ⅱ内核如何通过查表法快速找出就绪态中优先级最高的任务,并详细分析了就绪态中最高优先级任务调度方法和查找算法,最后给出了相应的例子。

In order to reduce the response time, μC/OS-Ⅱ kernel with preemptive scheduler guarantees that the task of highest priority can access the CPU first as soon as it is ready. This paper explains the process of how μC/OS-Ⅱ kernel gets the highest priority task rapidly and accurately from numerous tasks by look-up table, and analyzes the scheduling method and look-up algorithm with examples.