首页 | 本学科首页   官方微博 | 高级检索  
     

通信竞争的混合关键级系统多DAG动态调度策略
引用本文:刘樑骄, 谢国琪, 李仁发, 杨柳, 谢勇. 通信竞争的混合关键级系统多DAG动态调度策略[J]. 计算机研究与发展, 2015, 52(11): 2608-2621. DOI: 10.7544/issn1000-1239.2015.20140776
作者姓名:刘樑骄  谢国琪  李仁发  杨柳  谢勇
作者单位:1.1(湖南大学信息科学与工程学院 长沙 410082);2.2(湖南大学嵌入式与网络计算湖南省重点实验室 长沙 410082);3.3(湖南省发展和改革委员会 长沙 410004);4.4(厦门理工学院计算机与信息工程学院 福建厦门 361024) (llj1984109@qq.com)
基金项目:国家自然科学基金项目(61173036,61202102,61300039,61300037,61502405);国家“八六三”高技术研究发展计划基金项目(2012AA01A301-01)
摘    要:以多DAG模型研究通信竞争的混合关键级系统(mixed-criticality systems)的调度问题是适应现代汽车电子系统异构化和分布式的需要.首先实现通信竞争环境下“向上排序值(upward rank value)”和“最早完成时间(earliest finish time)”中时间的精确分析,以适应系统中计算与网络均异构,且任务与消息的同步特征.接着提出公平策略的多DAG动态任务与消息调度F_MDDTMS算法,以降低系统的调度长度;提出关键级策略的多DAG动态任务与消息调度C_MDDTMS算法,以确保高关键级应用的实时性;结合F_MDDTMS算法和C_MDDTMS算法,提出混合关键级策略的多DAG动态任务与消息调度MC_MDDTMS算法,既确保混合关键级系统中高关键级应用的实时性,又使得低关键级应用得到积极的处理.实例分析和实验结果验证了提出的算法在调度长度、不公平性、最差响应时间和实时性上的优越性.

关 键 词:通信竞争  混合关键级系统  多DAG  动态调度  实时性

Multiple DAGs Dynamic Scheduling for Mixed-Criticality Systems with Communication Contention
Liu Liangjiao, Xie Guoqi, Li Renfa, Yang Liu, Xie Yong. Multiple DAGs Dynamic Scheduling for Mixed-Criticality Systems with Communication Contention[J]. Journal of Computer Research and Development, 2015, 52(11): 2608-2621. DOI: 10.7544/issn1000-1239.2015.20140776
Authors:Liu Liangjiao  Xie Guoqi  Li Renfa  Yang Liu  Xie Yong
Affiliation:1.1(College of Computer Science and Electronic Engineering, Hunan University, Changsha 410082);2.2(Key Laboratory for Embedded and Network Computing of Hunan Province, Hunan University, Changsha 410082);3.3(Development and Reform Commission of Hunan Province, Changsha 410004);4.4(College of Computer and Information Engineering, Xiamen University of Technology, Xiamen, Fujian 361024)
Abstract:The scheduling of mixed-criticality systems with communication contention based on multiple DAGs model is the requirement of automobile electronic systems with heterogeneity and distribution. Firstly, the more accurate “upward rank value” and “earliest finish time” with communication contention on time are implemented to adapt to the heterogeneity of both computing and networking, and the synchronization of task and message in this paper. Then, an algorithm called fairness on multiple DAGs dynamic task and message scheduling (F_MDDTMS) is proposed to reduce scheduling length. An algorithm called criticality on multiple DAGs dynamic task and message scheduling (C_MDDTMS) is proposed to ensure the real-time of higher criticality applications. An algorithm called mixed criticality on multiple DAGs dynamic task and message scheduling (MC_MDDTMS) is also proposed based on the joint of F_MDDTMS algorithm and C_MDDTMS algorithm to ensure hard real-time of higher criticality applications and the activity of lower criticality applications of mixed-criticality systems. Example analysis and experimental results show that the proposed algorithms are excellent on scheduling length, unfairness, worst-case response time (WCRT) and real-time.
Keywords:communication contention  mixed-criticality systems  multiple DAGs  dynamic scheduling  real-time
点击此处可从《计算机研究与发展》浏览原始摘要信息
点击此处可从《计算机研究与发展》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号