一种改进的实时操作系统的进程优先级检索算法

An Improved Algorithm of Process Priority Querying for RTOS

进程调度是影响操作系统实时性的重要因素之一,很多实时操作系统采用基于优先权的进程调度策略,其进程优先级检索算法多采用单级链表结构,时间复杂度通常为O(N),不能很好满足软件无线电系统对多任务实时调度的要求.本文通过对Linux2.6中新的进程优先级检索算法的描述,提出对该优先级检索算法的一种改进方法以适应软件无线电系统的要求,并分析了该方法时间复杂度和空间复杂度.

Process scheduling is an important factor which affects operating system g real -time performance. Many RTOS adopt process scheduling strategy based on priority. Normally, the time complexity of the process priority searching algorithms is 0 （N）, because the process storage of single-level link is used in the algorithm. It cant meet the requirements of SDR system for muhitask real - time scheduling well. ,An improved algorithm of process priority querying for adapting to the requirements of SDR system is proposed by describing and analyzing the process priority querying of the kernel of Linux 2.6. The analysis of its arithmetic complexity is also given in this paper.