计算机工程 ›› 2017, Vol. 43 ›› Issue (12): 38-44.doi: 10.3969/j.issn.1000-3428.2017.12.007

• 体系结构与软件技术 • 上一篇    下一篇

多核平台下分区操作系统的安全关键任务调度方法

朱怡安  a,黄林林  a,李联  b,罗殊彦  a   

  1. (西北工业大学 a.计算机学院; b.软件与微电子学院,西安 710072)
  • 收稿日期:2016-11-15 出版日期:2017-12-15 发布日期:2017-12-15
  • 作者简介:朱怡安(1961—),男,教授,主研方向为嵌入式软件、物联网、云计算;黄林林(通信作者),硕士研究生;李联,研究员;罗殊彦,博士研究生。
  • 基金项目:
    航空科学基金“混合关键任务调度算法及无锁同步机制研究”(20150753010);民用飞机专项科研技术研究类项目“高可靠操作系统内核关键技术研究”(XJZ-2015-D-76);陕西省重点研发计划重大重点项目“时间/事件混合触发的实时操作系统技术与应用研究”(2016MSZD-G-8-1)。

Safety-critical Task Scheduling Method for Partitioned Operating System in Multi-core Platform

ZHU Yian  a,HUANG Linlin  a,LI Lian  b,LUO Shuyan  a   

  1. (a.School of Computer Science; b.School of Software and Microelectronics,Northwestern Polytechnical University,Xi’an 710072,China)
  • Received:2016-11-15 Online:2017-12-15 Published:2017-12-15

摘要: 多核环境中并发、资源共享和任务迁移等特性,导致分区操作系统的安全关键任务调度存在较大的不确定性。为此,提出一种针对多核平台分区操作系统的安全关键任务调度方法。判断系统是否包含安全关键任务并将其分为关键分区和非关键分区。在系统层通过资源划分的方式确保关键分区的独立运行,根据分区利用率确定最小资源上限,在保证安全关键任务调度可靠性的同时,提高系统的资源利用率。在分区层设计基于动态优先级的双模容错任务调度算法和基于二分搜索的最小任务优先级搜索算法,以提升系统的容错能力。实验结果表明,该方法能够提高分区操作系统的资源利用率和任务调度可靠性。

关键词: 多核处理器, 分区操作系统, 容错调度, 资源划分, 安全关键任务, 分区映射

Abstract: Due to the characteristics of concurrent,resource sharing and task migration in multi-core environment,uncertaionty has been introduced into the safety-critical task scheduling for partitioned operating system.In view of this,this paper presents a safety-critical task scheduling method for partitioned operating system in multi-core platform.This method divids the system partition into critical partition and non-critical partition by judging whether it contains safety-critical tasks.On the system layer,resource pre-allocated method is used to ensure the independent operation of the critical partitions.Moreover,it determines the minimum resource upper limit according to the partition utilization,so as to improve the resource utilization rate of the system while ensuring the reliability of safety-critical task scheduling.On the partition layer,a dual-mode fault-tolerant task scheduling algorithm based on dynamic priority and a minimum task priority search algorithm based on binary-search are proposed,which can enhance the fault-tolerance abality of the system.Experimental results show that the proposed method can guarantee the partitioned operating system to have higher resource utilization and reliability of task scheduling.

Key words: multi-core processor, partitioned operating system, fault-tolerant scheduling, resource partitioning, safety-critical task, partitioned mapping

中图分类号: