|
|||||
|
|
| 基于有限优先级的动态调度算法 | |
| 引用本文： | 何福贵,王家礼. 基于有限优先级的动态调度算法[J]. 电子科技大学学报(社会科学版), 2007, 0(3) |
| 作者姓名： | 何福贵 王家礼 |
| 作者单位： | 西安电子科技大学机电工程学院 西安710071(何福贵)，北京工业大学 软件北京朝阳区100022(王家礼) |
| 基金项目： | 武器装备部电子测试技术重点实验室基金资助项目(51487010503dz104) |
| 摘 要： | 实时任务调度是实时系统中的关键问题,实时动态调度是实时调度的主要方面。当实时调度应用于实际的任务系统时,仅能使用有限的优先级数量。实时调度在理论分析时,都假设系统能够识别任意多的优先级。该文提出了在优先级数量有限的条件下的动态调度算法,给出了一个任务系统动态调度所需的最小优先级的数量的算法,并对算法的复杂性进行了分析。 |
| 关 键 词： | 动态调度 有限优先级数量 实时任务调度 |
Dynamic Scheduling Algorithm Based on Limited Number of Priority |
|
| HE Fu-gui,WANG Jia-li. Dynamic Scheduling Algorithm Based on Limited Number of Priority[J]. Journal of University of Electronic Science and Technology of China(Social Sciences Edition), 2007, 0(3) | |
| Authors: | HE Fu-gui WANG Jia-li |
| Affiliation: | HE Fu-gui1,WANG Jia-li2 |
| Abstract: | Real-time tasks scheduling is key problem in real-time system, real-time dynamic scheduling is main aspect of real-time scheduling. When real-time scheduling is used in practical system it may just use limited number of priority level. When real-time scheduling theory carry out theoretic analysis, all of them assume that there are unlimited number of priority level. The paper present the algorithm of dynamic real-time scheduling in the condition of limited priority level, and presents the minimum number of priority level that the tasks system schedules dynamically. Finally, the algorithm complexity is analyzed. |
| Keywords: | dynamic scheduling limited number of priority level real-time tasks scheduling |
| 本文献已被 CNKI 等数据库收录！ | |