• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>IEEE Real-Time and Embedded Technology and Applications Symposium >Offline Equivalence: A Non-preemptive Scheduling Technique for Resource-Constrained Embedded Real-Time Systems (Outstanding Paper)
【24h】

Offline Equivalence: A Non-preemptive Scheduling Technique for Resource-Constrained Embedded Real-Time Systems (Outstanding Paper)

机译：离线等效：资源受限的嵌入式实时系统的非抢占式调度技术（优秀论文）

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

摘要

We consider the problem of scheduling a set of nonpreemptive periodic tasks in an embedded system with a limited amount of memory. On the one hand, due to the memory limitations, a table-based scheduling approach might not be applicable, and on the other hand, the existing online non-preemptive scheduling algorithms are either not efficient in terms of the schedulability ratio, or suffer from considerable runtime overhead. To arrive at a compromise, this paper proposes an online policy that is equivalent to a given offline table to combine some of the advantages of both online and offline scheduling: we first consider a low-overhead online scheduling algorithm as a baseline, and then identify any irregular situations where a given offline table differs from the schedule generated by the online algorithm. We store any such irregularities in tables for use by the online scheduling algorithm, which then can recreate the table at runtime. To generate suitable tables, we provide an offline scheduling algorithm for nonpreemptive tasks, and a table-transformation algorithm to reduce the number of irregularities that must be stored. In an evaluation using an Arduino board and synthetic task sets, we have observed the technique to result in a substantial reduction of scheduling overhead compared toCW-EDF, the online scheduler that achieves the highest schedulability ratio, while having to store on average only a few dozen to a few hundreds of bytes of the static schedule.
机译：我们考虑在内存量有限的嵌入式系统中调度一组非抢占式周期性任务的问题。一方面，由于内存的限制，基于表的调度方法可能不适用，另一方面，现有的在线非抢先式调度算法要么在可调度性方面效率不高，要么遭受相当大的运行时开销。为了达成妥协，本文提出了一种等效于给定离线表的在线策略，以结合在线和离线计划的一些优点：我们首先以低开销的在线计划算法为基准，然后确定给定的离线表与在线算法生成的时间表不同的任何不规则情况。我们将任何此类不规则性存储在表中，以供在线调度算法使用，然后该算法可以在运行时重新创建表。为了生成合适的表，我们为非抢先任务提供了离线调度算法，并提供了一种表转换算法以减少必须存储的不规则数量。在使用Arduino开发板和综合任务集的评估中，我们观察到与CW-EDF相比，该技术可显着减少调度开销，CW-EDF是实现最高可调度性比率的在线调度程序，而平均只需要存储少量调度程序静态时间表的十几个到几百个字节。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号