计算机应用与软件Issue(2)：245-248,252,5.DOI:10.3969/j.issn.1000-386x.2014.02.066
一种改进的容错RM算法
AN IMPROVED FAULT-TOLERANCE RATE-MONOTONIC SCHEDULING ALGORITHM
李鹏 1郭兵 1李年琼2
作者信息
- 1. 四川大学计算机学院 四川 成都610045
- 2. 四川大学电气信息学院 四川 成都610045
- 折叠
摘要
Abstract
The applications of embedded real-time system are getting increasingly wider,and thereby it becomes the increasing need for having a stable,robust and fault-tolerant scheduling algorithm as the core of the system.In classic rate-monotonic (RM)algorithm presented by Liu and Layland,there is no fault tolerance.In this paper we use time domain error masking (TEM)method to improve classic RM algorithm, and develop RMF algorithm which can fix multiple transient faults in a planning cycle period.Based on the distribution of two worst faults,we analyse the sufficient and necessary conditions of schedulability of RMF ,and develop an algorithm SCHEDULABLE-RMF to check it.Experi-mental results show that under the condition of low system load the algorithm can effectively reduce the proportion of errors in schedulingoperation.关键词
实时系统/单调速率调度/容错/可调度性分析Key words
Real-time system/Rate-monotonic scheduling/Fault tolerance/Schedulability analysis分类
信息技术与安全科学引用本文复制引用
李鹏,郭兵,李年琼..一种改进的容错RM算法[J].计算机应用与软件,2014,(2):245-248,252,5.
