• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>IEEE International Symposium on Real-Time Distributed Computing >Probabilistic Schedulability Analysis for Real-time Tasks with Precedence Constraints on Partitioned Multi-core
【24h】

Probabilistic Schedulability Analysis for Real-time Tasks with Precedence Constraints on Partitioned Multi-core

机译：分区多核上具有优先约束的实时任务的概率可调度性分析

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

摘要

The design of embedded systems is facing the explosion of new functionalities requiring increased computation capacities and, thus, the introduction of multi-core processors. Moreover, some functionalities may impose precedence constraints between the programs implementing them. In this paper, we consider partitioned scheduling of tasks with precedence constraints defined by multiple Directed Acyclic Graphs (DAGs). The variability of execution and communication times is taken into account by describing them with probability distributions. Our probabilistic response time analysis is validated on random generated task sets and on a PX4 drone autopilot.
机译：嵌入式系统的设计正面临着新功能的爆炸式增长，需要增加计算能力，因此需要引入多核处理器。此外，某些功能可能会在实现它们的程序之间施加优先级约束。在本文中，我们考虑了由多个有向无环图（DAG）定义的具有优先约束的任务的分区调度。通过用概率分布描述执行和通信时间的可变性，可以将它们考虑在内。我们的概率响应时间分析已在随机生成的任务集和PX4无人机自动驾驶仪上得到验证。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号