检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]东南大学计算机科学与工程系 [2]教育部计算机网络与信息集成重点实验室,南京210096
出 处:《计算机研究与发展》2006年第5期813-820,共8页Journal of Computer Research and Development
基 金:国家自然科学基金项目(90104009);江苏省基础研究计划基金项目(BK2005408)~~
摘 要:端到端实时任务调度模型可用于描述许多分布式实时系统.提出一种基于EDF调度策略的端到端实时任务调度模型,给出了端到端实时系统的可调度性判定条件,并提出其可调度性分析算法,该可调度性判定条件及可调度性分析算法适用于采用非连续工作型同步协议和连续工作型同步协议控制下的端到端实时系统.与固定优先级的端到端实时任务调度模型及其算法相比,基于EDF调度策略的端到端实时任务调度模型和算法更加简单和易于实现,仿真结果也表明具有较高的性能.An end-to-end real-time scheduling model can be used to describe many distributed real-time systems. In this paper, an EDF-based end-to-end real-time scheduling model is proposed. According to the time demand analysis technique, a schedulability condition for the end-to-end real-time system is deduced. Then, a schedulability analysis algorithm is developed. The schedulability condition and schedulablity analysis algorithm are suitable not only for end-to-end real-time systems controlled by non-greedy synchronization protocols, but also for those controlled by greedy synchronization protocol. Compared with fix-priority-based end-to-end real-time scheduling model and its algorithms, the model and algorithm proposed in this paper are simpler and easier to implement. Simulation results reveal that higher performance can be achieved too.
分 类 号:TP316.4[自动化与计算机技术—计算机软件与理论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.191.53.120