摘要
基于截止期分析和响应时间分析可以对全局固定优先级实时调度算法进行可调度性判定。而传统方法在实时任务中带入作业,处理器无法满足实时任务的计算需求。为此,提出一种可调度性判定方法。通过区分实时任务在具有和没有带入作业时产生的干涉,考虑带入作业的个数与实时系统中处理器的个数相关。实验结果表明,该方法能够减少计算的干涉量,得到一个更紧密的可调度性判定条件,提高多处理器实时系统中通过可调度性判定的任务数量。
The schedulability can be determined based on deadline analysis and response time analysis for the global Fixed Priority（FP） real-time scheduling algorithm. The traditional method takes into account the real-time tasks with a carry-in job. The processor cannot meet the computing requirement of real-time tasks. So this paper proposes a schedulability method. The interference caused by the real time task is analyzed,which takes into account the number of jobs and the number of processors in real-time system. Experimental results show that the method can reduce the amount of interference,obtain a more compact schedulability criterion, and increases the number of tasks that can be passed by schedulability in multiprocessor real-time system.
出处
《计算机工程》
CAS
CSCD
北大核心
2017年第12期65-68,共4页
Computer Engineering
基金
国家自然科学基金(61572240)
关键词
实时系统
多处理器
全局调度
可调度性判定
干涉
real-time system
multiprocessor
global scheduling
schedulability determination
interference
