固定优先级调度的线性近似分析方法  

Linear approximate analysis approach of fixed priority scheduling

作　　者：莫铁强[1] 彭浩[1] 

机构地区：[1]湖南涉外经济学院计算机科学与技术系,长沙410205

出　　处：《计算机工程与应用》2010年第16期78-80,142,共4页Computer Engineering and Applications

基　　金：湖南省高等学校科学研究项目(No.09C597)~~

摘　　要：通过线性逼近硬实时系统任务的工作负荷量的方法,一个更加接近精确响应时间的时间上限能有效地降低调度分析时间。同时该上限用于任务集的充分性可调度测试时具有线性时间的复杂度。这种线性上限的可调度性测试能够用于交互的系统工具设计、基于搜索的系统优化以及任务集的动态接纳新任务的设计中。并且新的调度系统模型无时间死线、抖动大小限制,适用范围更广。相关的实验也表明响应时间上限可调度性分析提高了准确调度测试的效率。By the approaches of being linearly close to the workload of tasks in hard real-time system the closer response time upper bound can be used to decrease the running time.At the same time it is linear in time of complexity for the upper bound in the sufficient schedulable tests of task sets.In interactive system design tools,system optimization via search,and admission of new tasks into dynamic systems,this new linear upper bound can considerably improve efficiency of test.Further,it is wide in application for the scheduling model without the limit of deadline and jitter.The pertinent experiments show that the method of utilizing the approximate upper time has improved the efficiency of exact test of the schedulability.

关 键 词：繁忙周期 响应时间分析 线性近似 

分 类 号：TP316.2[自动化与计算机技术—计算机软件与理论]