实时系统优先级位图调度算法的改进

Improvement of the scheduler algorithm based on priority bitmap in real-time system

实时操作系统要求具有速度快和可预测性的特点,必须保证实时任务在要求的时间内完成。本文在描述了优先级位图调度算法的机制后,然后针对其在支持任务数量,所需数据空间和存在多个相同优先级任务的处理方面,提出改进方法。

The real-time operating system request the speed tobe quick and the characteristic may be forecast,the real- timeduty must completed in the request time. This paper describes the theory of the scheduler algorithm based on priority bitmap, then it presents an improvement for the scheduler algorithm at the priority levels, the data storage and the tasks in the same level.