...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Journal of systems architecture >Scheduling non-preemptive tasks with strict periods in multi-core real-time systems
【24h】

Scheduling non-preemptive tasks with strict periods in multi-core real-time systems

机译：在多核实时系统中，严格的不抢占任务

获取原文
获取原文并翻译 | 示例
   

获取外文期刊封面封底 >>

       
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Non-preemptive tasks with strict periods are usually adopted in practical multi-core real-time systems when continual sampling and processing of data are required. Systems designers need to provide a proper scheduling strategy such that the tasks' deadlines will be met even under the worst-case conditions. In this paper, we study the scheduling problem of non-preemptive tasks with strict periods in multi-core real-time systems. We first derive a necessary and sufficient condition to determine whether a new task is schedulable upon a multi-core platform without changing the allocations of the existing tasks. Then, with a game theory analogy, we design a recursive method to calculate the maximum permissible execution time for a given task, and propose a new schedulability condition used when the start time and processor assignments of the existing tasks can be modified. Finally, based on the conditions derived previously, we present a task assignment algorithm, which not only provides valid allocations for all tasks, but also obtains the minimum number of processors required by the system. Simulation experiments with randomly generated task sets have been conducted to show the high efficiency and reliability of the proposed approach.
机译：具有严格时期的非先发制人任务通常在实际的多核实时系统中采用，当需要进行数据不断采样和处理数据时。系统设计人员需要提供适当的调度策略，使得即使在最坏情况下也会满足任务的截止日期。在本文中，我们研究了在多核实时系统中严格时期的非抢占任务的调度问题。我们首先导出必要和充分的条件来确定新任务是否在多核平台上定期，而无需更改现有任务的分配。然后，通过博弈论类比，我们设计递归方法来计算给定任务的最大允许执行时间，并提出可以修改现有任务的开始时间和处理器分配时使用的新调度条件。最后，基于先前导出的条件，我们呈现了一个任务分配算法，它不仅为所有任务提供了有效的分配，还提供了系统所需的最小处理器数。已经进行了随机产生的任务集的仿真实验，以显示所提出的方法的高效率和可靠性。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号