| 基于至少满足弱硬实时限制的调度算法 |
| |
| 引用本文： | 涂刚,阳富民,卢炎生.基于至少满足弱硬实时限制的调度算法[J].华中科技大学学报(自然科学版),2006,34(2):67-69. |
| |
| 作者姓名： | 涂刚 阳富民 卢炎生 |
| |
| 作者单位： | 华中科技大学,计算机科学与技术学院,湖北,武汉,430074 |
| |
| 摘 要： | 提出了一种用于保证实时周期任务满足“至少满足”弱硬实时限制的算法.针对以往算法的缺点,扩充了弱硬实时限制的性质,定义了下确界限制并给出求解法.下确界限制用于保证任务满足“至少满足”弱硬实时限制,是任务满足限制的下确界.下确界限制的求解法计算负责度较低,因此在该求解法的基础上设计了调度算法MAA,用于保证任务满足“至少满足”弱硬实时限制.
|
| 关 键 词： | 弱硬实时 特征序列 下确界限制 |
| 文章编号： | 1671-4512(2006)02-0067-03 |
| 收稿时间： | 03 16 2005 12:00AM |
| 修稿时间： | 2005年3月16日 |
Scheduling algorithms based on meet any weakly hard real-time constraint |
| |
| Tu Gang,Yang Fumin,Lu Yansheng.Scheduling algorithms based on meet any weakly hard real-time constraint[J].JOURNAL OF HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY.NATURE SCIENCE,2006,34(2):67-69. |
| |
| Authors: | Tu Gang Yang Fumin Lu Yansheng |
| |
| Abstract: | The algorithm for guaranteeing "meet row n in m" weakly hard real-time constraint was proposed.In consideration of the shortcomings of the previous algorithm,the property of weakly hard real-time constraints was analyzed and the definition of greatest lower bound of constraint and the corresponding calculation methods were put forward.The greatest lower bound of constraint was the bound of tasks for satisfying the constraint and can be used to guarantee the "meet row" weakly hard real-time constraint.The computation complexity of the greatest lower bound of constraint was reduced by the presented calculation methods.A scheduling algorithm for the constraint called meet any algorithm(MAA) was presented on the basis of the calculation methods. |
| |
| Keywords: | weakly hard real-time k-sequence greatest lower bound constraint |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
