一种可用于实时操作系统中的最高优先级任务选取算法  

An Algorithm for Getting the Highest Priority Task in a Real Time Operating System

作　　者：邢海峰[1,2] 王俊义[2] 

机构地区：[1]内蒙古财经学院计算机系,呼和浩特010075 [2]内蒙古大学计算机学院,呼和浩特010021

出　　处：《内蒙古大学学报（自然科学版）》2010年第2期217-222,共6页Journal of Inner Mongolia University：Natural Science Edition

摘　　要：提出的最高优先级任务选取算法可用在RTOS(RealTimeOperatingSystem)内核的任务管理模块设计中.本算法由四个部分构成.第一部分是就绪任务的管理方法,通过该方法可以把系统中处于就绪状态的任务分组管理起来.第二部分是从就绪表中得到最高优先级数的方法,使用该方法系统可以快速的从就绪表中得到最高优先级数.第三部分是使用最高优先级数得到最高优先级任务的方法,也就是实现最高优先级数到最高优先级任务控制块的映射.第四部分是给出管理256个优先级任务的方法.The algorithm for getting the highest priority task can be used for design of the task management model block in RTOS. The algorithm consists of four parts. The first part introduces the method of ready task management, by which all ready tasks in RTOS can be properly organized. The second part introduces how the highest priority number is got, by which the highest priority number can be got quickly from the ready table. The third part is the method by which the highest priority task can be found. It can build the relationship between the highest priority number and the highest priority task. The last part gives a method for implementing the management of 256 priority tasks.

关 键 词：任务优先级 就绪表 逆映射表 

分 类 号：TP316.2[自动化与计算机技术—计算机软件与理论]