一种基于μC/OS-Ⅱ的多任务优先级调度新算法

A NEW PRIORITY SCHEDULING ALGORITHM FOR MULTITASK BASE ON μC/OS-Ⅱ

摘要: 提出了一种全新的多任务优先级调度算法，它保留了现有调度算法的时间确定性和实时性的优点，还使其空间复杂度与支持的任务数无关. 系统最多支持的任务数不仅可以轻松地从现有的64个增加到256个，根据实际需要还可以更多.

Abstract: A new algorithm is presented to solve the problem,which reserves the time ascertainment and real-time characteristics of the current scheduling algorithm, and both the space complexity is independent of the number of tasks supported. So it is easy to let the number of tasks increase from 64 to 256 or more.