期刊文献+

Homology Priority Task Scheduling in μC/OS-Ⅱ Real-Time Kernel

Homology Priority Task Scheduling in μC/OS-Ⅱ Real-Time Kernel
下载PDF
导出
摘要 μC/OS-Ⅱ is an open source real-time kernel adopting priority preemptive schedule strategy. Aiming at the problem of μC/OS-Ⅱ failing to support homology priority tasks scheduling, an approach for solution is proposed. The basic idea is adding round-robin scheduling strategy in its original scheduler in order to schedule homology priority tasks through time slice roundrobin. Implementation approach is given in detail. Firstly, the Task Control Block (TCB) is extended. And then, a new priority index table is created, in which each index pointer points to a set of homology priority tasks. Eventually, on the basis of reconstructing μC/OS-Ⅱ real-time kernel, task scheduling module is rewritten. Otherwise, schedulability of homology task supported by modified kernel had been analyzed, and deadline formula of created homology tasks is given. By theoretical analysis and experiment verification, the modified kernel can support homology priority tasks scheduling, meanwhile, it also remains preemptive property of original μC/OS-Ⅱ. μC/OS-Ⅱ is an open source real-time kernel adopting priority preemptive schedule strategy. Aiming at the problem of μC/OS-Ⅱ failing to support homology priority tasks scheduling, an approach for solution is proposed. The basic idea is adding round-robin scheduling strategy in its original scheduler in order to schedule homology priority tasks through time slice roundrobin. Implementation approach is given in detail. Firstly, the Task Control Block (TCB) is extended. And then, a new priority index table is created, in which each index pointer points to a set of homology priority tasks. Eventually, on the basis of reconstructing μC/OS-Ⅱ real-time kernel, task scheduling module is rewritten. Otherwise, schedulability of homology task supported by modified kernel had been analyzed, and deadline formula of created homology tasks is given. By theoretical analysis and experiment verification, the modified kernel can support homology priority tasks scheduling, meanwhile, it also remains preemptive property of original μC/OS-Ⅱ.
出处 《Wuhan University Journal of Natural Sciences》 CAS 2007年第5期946-950,共5页 武汉大学学报(自然科学英文版)
基金 Supported by the "Chunhui" Plan of Ministry of Education of China (Z2005-2-11013)
关键词 μC/OS-Ⅱ real-time kernel homology priority task round-robin μC/OS-Ⅱ real-time kernel homology priority task round-robin
  • 相关文献

参考文献11

  • 1王济勇,林涛,王金东,韩光洁,赵海.EDF调度算法抢占行为的研究及其改进[J].电子学报,2004,32(1):64-68. 被引量:11
  • 2Labrosse J.Micro C/OS-Ⅱ The Real-Time Kernel[]..2002
  • 3Dick R P,,Lakshminarayana G,Raghunathan A, et al.Power Analysis of Embeded Operating Systems[].Proceedings of the th Conference on Design Automation.2000
  • 4Xie Changsheng,Ma Jinde,Huang Hao.Research on Task Scheduling Policies Based on μC/OS-Ⅱ[].Computer Engineering.2004
  • 5Zheng Zhonghan.Software Foundation for Real-Time System[]..2003
  • 6Michael B.Choosing An RTOS. Embedded Systems Pro- gramming. http://www.embedded.com showArticle.jhtml?articleID=9901203 . 2004
  • 7Labrosse J.μC/OS-Ⅱ Kernel Awareness[]..2004
  • 8Stankovic J A.Misconceptions about Real-Time Computing: A Serious Problem for Next-Generation Systems[].IEEE Computers.1988
  • 9Liu J W S.Real-Time Systems[]..2002
  • 10Wang Y C,Lin K.Implementing a General Real-Time Sched- uling Framework in the RED-Linux Real-Time Kernel[].Proceedings of the th IEEE Real-Time Systems.1999

二级参考文献9

  • 1[1]Krishna C M,Shin G K.Real-Time Systems [M].Columbus,OH:McGraw-Hill Companies,Inc.1997.73-80.
  • 2[2]Katcher D I,Arakawa H,Strosnider J K.Engineering and analysis of fixed priority schedulers [J].IEEE Transactions on Software Engineering,1993,19(9):920-934.
  • 3[3]Katcher D I.Engineering and analysis of real-time operating systems [D].Ph.D.Dissertation,Dept.of Electrical and Computer Engineering,Carnegie Mellon University,Pittsburgh,PA,August 1994.
  • 4[4]Liu C L,Layland J W.Scheduling algorithms for multiprogramming in a hard real time environment [J].Journal of the ACM,1973,20(1):44-61.
  • 5[5]Jeffay K,Stanat D F,Martel C U.On non-preemptive scheduling of periodic and sporadic tasks [A].Proceedings of the 12th IEEE Symposium on Real-Time Systems [C].San Antonio,Texas,IEEE Computer Society Press,December 1991.129-139.
  • 6[6]Secka A.Automatic debugging of a real-time system using analysis and prediction of various scheduling algorithm implementations [D].Dept.of Electrical and Computer Engineering,University of Maryland,College Park,MD,November 2000.
  • 7[7]Kettler K A,Katcher D I,Strosnider J K.A modeling methodology for real-time/multimedia operating systems [A].Proceedings of the Real-Time Technology and Applications Symposium [C].Chicago,Illinois,IEEE Computer Society Press,May 1995.
  • 8[8]Michalewica Z,Janikow C.Handling constraints in genetic algorithms [A].Proceedings of the fourth international conference on genetic algorithms [C].San Mateo,CA,Morgan Kaufmann Publishers,1991.151-157.
  • 9[9]GoldBerg D E,Deb K.A comparative analysis of selection schemes used in genetic algorithms [A].Foundations of Genetic Algorithms [C].San Mateo,CA,Morgan Kaufmann Publishers,1991.69-93.

共引文献10

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部