A Modified Rate-Monotonic Algorithm for Scheduling Periodic Tasks with Different Importance in Embedded System

摘要：

It is the scheduler that decides the capability of the embedded system. For the classical rate-monotonic (RM) scheduling algorithm with priority determined only by the period, the deadline of long period tasks can not be guaranteed and the system resources can not be effectively utilized. Here, a new static priority scheduling algorithm called NPRM (A New Priority-driven Scheduler Based on RM) is proposed. In this algorithm, two parameters are added to the Task Control Block (TCB): One is the importance of the task, and the other is the laxity. The one which importance is higher only when its laxity is zero could preempt the running task. Our experiments suggest that the algorithm be capable of decreasing the deadline-missing ratio of the tasks and the CPU resource could be used more effectively. It is an efficient way of scheduling the real-time tasks; it is useful for the application in wireless broadband and mobile computing.

关键词： embedded system rate-monotonic, periodic tasks wireless broadband and mobile computing.

作者: Jiwen Dong Yang Zhang

作者单位: School of Information Science and Engineering,University of Jinan Jinan,250022,China

会议类型: 国际会议

会议名称: 2009 9th International Conference on Electronic Measurement & Instruments(第九届电子测量与仪器国际会议 ICEMI2009)

会议地点: 北京

会议语种:英文

页码: 3834-3837

在线出版日期: 2009-08-16（万方平台首次上网日期，不代表论文的发表时间）