计算机应用 ›› 2011, Vol. 31 ›› Issue (10): 2606-2608.DOI: 10.3724/SP.J.1087.2011.02606

• 先进计算 • 上一篇    下一篇

μC/OS-Ⅱ内核任务调度模块的扩展

尹作为1,郭兵1,沈艳2   

  1. 1.四川大学 计算机学院, 成都 610064
    2.成都信息工程学院 控制工程学院, 成都 610225
  • 收稿日期:2011-04-02 修回日期:2011-06-01 发布日期:2011-10-11 出版日期:2011-10-01
  • 通讯作者: 尹作为
  • 作者简介:尹作为(1986-),男,湖北仙桃人,硕士研究生,主要研究方向:嵌入式实时操作系统、SoC;郭兵(1970-),男,山东泰安人,教授,博士生导师,博士,CCF高级会员,主要研究方向:嵌入式实时系统、SoC、中间件;沈艳(1973-),女,湖南永州人,副教授,博士,主要研究方向:分布式测量系统、嵌入式系统、无线传感器网络、机器人。
  • 基金资助:

    国家863计划项目(2008AA01Z105)

μC/OS-Ⅱ| same priority task| round-robin scheduling| real-time| module expansion

YIN Zuo-wei1, GUO Bing1, SHEN Yan2   

  1. 1.College of Computer Science, Sichuan University, Chengdu Sichuan 610064, China
    2.School of Control Engineering, Chengdu University of Information Technology, Chengdu Sichuan 610225, China
  • Received:2011-04-02 Revised:2011-06-01 Online:2011-10-11 Published:2011-10-01

摘要: 针对μC/OS-Ⅱ不能支持同级任务调度的限制,提出一种基于时间片轮询调度的策略。该策略借用μC/OS-Ⅱ内核中的两个优先级任务,充当时钟源和轮询引擎,让同级任务在最低优先级任务下轮流运行。在不失实时性的前提下,让内核支持多达192个同级任务。实验及对比表明,该方案简单实用。

关键词: μC/OS-Ⅱ, 同级任务, 时间片轮询调度, 实时, 模块扩展

Abstract: Since uC/os-II can not provide the restriction on same priority tasks,a strategy was proposed base on round-robin algorithm scheduling .It borrowed two priority tasks in the kernel as the clock source and the polling engine, so that tasks with the same priority work under the lowest priority in turns. The method allows the kernel to support up to 192 tasks in the same priority without losing the real-time. The experiment and comparison indicated that this project was more simple and practical than the one we already have.

Key words: uc/os-ii, same priority task, round-robin algorithm scheduling, real-time, expansion module

中图分类号: