首页> 外文会议>IEEE International Conference on Embedded and Real-Time Computing Systems and Applications >An implementation of partitioned scheduling scheme for hard real-time tasks in multicore Linux with fair share for Linux tasks
【24h】

An implementation of partitioned scheduling scheme for hard real-time tasks in multicore Linux with fair share for Linux tasks

机译:Mullicore Linux中硬实时任务的分区调度方案的实现,具有Linux任务的公平份额

获取原文

摘要

The correctness of a hard real-time system depends upon its ability to meet all its deadlines. Existing real-time systems use either a pure real-time scheduler or a real-time scheduler embedded as a real-time scheduling class in the scheduler of an operating system (OS). Existing implementations of schedulers in multicore systems that support real-time and non-real-time tasks, permit the execution of non-real-time tasks in all the cores with priorities lower than those of real-time tasks, but interrupts and softirqs associated with these non-real-time tasks can execute in any core with priorities higher than those of real-time tasks. As a result, the execution overhead of real-time tasks is quite large in these systems, which, in turn, affects their runtime. In order that the hard real-time tasks can be executed in such systems with minimal interference from other Linux tasks, we propose, in this paper, an integrated scheduler architecture, called SchedISA, which aims to considerably reduce the execution overhead of real-time tasks in these systems. In order to test the efficacy of the proposed scheduler, we implemented partitioned earliest deadline first (P-EDF) scheduling algorithm in SchedISA on Linux kernel, version 3.8, and conducted experiments on Intel core i7 processor with eight logical cores. We compared the execution overhead of real-time tasks in the above implementation of SchedISA with that in SCHED_DEADLINE's P-EDF implementation, which concurrently executes real-time and non-real-time tasks in Linux OS in all the cores. The experimental results show that the execution overhead of real-time tasks in the above implementation of SchedISA is considerably less than that in SCHED_DEADLINE. We believe that, with further refinement of SchedISA, the execution overhead of real-time tasks in SchedISA can be reduced to a predictable maximum, making it suitable for scheduling hard real-time tasks without affecting the CPU share of Linux tasks.
机译:硬实时系统的正确性取决于其满足其所有截止日期的能力。现有的实时系统使用纯实时调度程序或嵌入的实时调度程序作为操作系统的调度程序(OS)的实时调度类。在支持实时和非实时任务的多核系统中的现有化调度程序实现允许在所有核心中执行非实时任务,其优先级低于实时任务,而是相关的中断和软质疑通过这些非实时任务可以在任何高于实时任务的核心中执行。因此,在这些系统中,实时任务的执行开销非常大,这反过来又影响其运行时。为了使硬实时任务可以在具有来自其他Linux任务的其他干扰的这种系统中执行,本文提出了一个名为SchediSA的集成调度程序体系结构,旨在大大减少实时的执行开销这些系统中的任务。为了测试所提出的调度程序的功效,我们在Linux内核(版本3.8)上的Squienisa中实现了分区的最早的截止日期(P-EDF)调度算法,并在具有八个逻辑核心的英特尔核心I7处理器上进行了实验。我们将实时任务的执行开销与SchediSA在Sched_Deadline的P-EDF实现中的执行开销中的执行开销,在所有内核中同时在Linux操作系统中执行实时和非实时任务。实验结果表明,上述Schedisa的实时任务的执行开销相当于Sched_Deadline中的实时任务。我们认为,通过进一步改进Schedisa,可以将Squienisa中实时任务的执行开销减少到可预测的最大值,使其适用于调度硬实时任务,而不会影响Linux任务的CPU份额。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号