| 一种实时操作系统的进程优先级检索算法研究 |
| |
| 引用本文： | 刘波,陈卓.一种实时操作系统的进程优先级检索算法研究[J].计算机工程与应用,2005,41(19):38-40. |
| |
| 作者姓名： | 刘波 陈卓 |
| |
| 作者单位： | 重庆工商大学计算机学院,重庆,400020;重庆大学计算机学院,重庆,400044 |
| |
| 基金项目： | 重庆市应用基础重点研究项目(编号:03-8084)资助 |
| |
| 摘 要： | 进程调度是影响操作系统实时性的一个重要的因素,而很多主流操作系统(如:Linux)都是采用基于优先权的进程调度算法,该调度算法就是遍历就绪队列中的所有进程,找出优先级最高的进程,并交给处理器执行。通常情况下,该算法的时间复杂度为O(n),而这样的时间复杂度不能很好地满足实时系统的要求。该文将对一种新的进程优先级检索方法进行研究分析,并给出该方法时间复杂度的分析过程。
|
| 关 键 词： | 进程调度 实时系统 优先级检索 Linux2.6 |
| 文章编号： | 1002-8331-(2005)19-0038-03 |
Research on a Querying Process Scheduling Algorithm Based on Priority of Real-time Operation System |
| |
| Liu Bo,Chen Zhuo.Research on a Querying Process Scheduling Algorithm Based on Priority of Real-time Operation System[J].Computer Engineering and Applications,2005,41(19):38-40. |
| |
| Authors: | Liu Bo Chen Zhuo |
| |
| Affiliation: | Liu Bo1 Chen Zhuo21 |
| |
| Abstract: | Process scheduling is an important factor which affects operating system's real-time performance.Many main-stream operating systems(such as Linux) adopt process scheduling algorithm based on priority.The algorithm goes through all tasks of ready queue and finds out the task with highest priority and the CPU runs the task.Normally,this algorithm's time complexity is O(n),so it can't satisfy real-time well.This paper researches and analyses a new taskpriority searching method.The analysis process of its time complexity is also given in this paper. |
| |
| Keywords: | process scheduling real time system querying process scheduling Linux2 6 |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
