Author Login Editor-in-Chief Peer Review Editor Work Office Work

Computer Engineering

Previous Articles     Next Articles

Schedulability Test for Strictly Periodic Tasks on Uniprocessor Platform

CHEN Jinchao,DU Chenglie   

  1. (School of Computer Science,Northwestern Polytechnical University,Xi’an 710129,China)
  • Received:2015-09-28 Online:2016-05-15 Published:2016-05-13

单处理器平台下的严格周期任务可调度性判定

陈进朝,杜承烈   

  1. (西北工业大学计算机学院,西安 710129)
  • 作者简介:陈进朝(1987-),男,博士研究生,主研方向为分布式实时仿真系统;杜承烈,教授、博士生导师。
  • 基金资助:

    国家自然科学基金资助项目(61373120)。

Abstract:

Aiming at the problem of schedulability test for strictly periodic tasks in theoretical study of system scheduling,this paper researches the interference relationship between strictly periodic tasks in a real-time system,and presents an eigentask-based schedulability test method.It analyzes the time constraints of strictly periodic tasks running on a uniprocessor platform,calculates all free time,and provides a sufficient and necessary schedulability test condition by determining whether enough continuous free time is available for the task’s execution.Experimental results show that,compared with Eigen-mapping Task Assignment(EMTA) method,the proposed method can reduce the time consumption required for the test and improve the success ratio.It has better schedulability test performance.

Key words: strictly periodic task, schedulability test, uniprocessor, eigentask, real-time system, free time

摘要:

针对系统调度理论研究中的严格周期任务可调度性判定问题,从研究实时系统中严格周期任务之间的相互干涉关系出发,提出一种基于特征任务的可调度性判定方法。分析严格周期任务在单一处理器平台下无冲突运行的时间约束,计算任务所能使用的全部空余时间,进而界定连续空余时间是否满足任务执行的需要,得到一个可调度性判定的充要条件。实验结果表明,与特征映射任务分配方法相比,该方法能够减少判定时间,提高判定成功率,具有更优的可调度判定性能。

关键词: 严格周期任务, 可调度性判定, 单处理器, 特征任务, 实时系统, 空余时间

CLC Number: