首页> 外文OA文献 >MC-Fluid: Fluid Model-Based Mixed-Criticality Scheduling on Multiprocessors
【2h】

MC-Fluid: Fluid Model-Based Mixed-Criticality Scheduling on Multiprocessors

机译:MC-Fluid:在多处理器上基于流体模型的混合关键性调度

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

A mixed-criticality system consists of multiple components with different criticalities. While mixed-criticality scheduling has been extensively studied for the uniprocessor case, the problem of efficient scheduling for the multiprocessor case has largely remained open. We design a fluid model-based multiprocessor mixed-criticality scheduling algorithm, called MC-Fluid in which each task is executed in proportion to its criticality-dependent rate. We propose an exact schedulability condition for MC-Fluid and an optimal assignment algorithm for criticality-dependent execution rates with polynomial-time complexity. Since MC-Fluid cannot be implemented directly on real hardware platforms, we propose another scheduling algorithm, called MC-DP-Fair, which can be implemented while preserving the same schedulability properties as MC-Fluid. We show that MC-Fluid has a speedup factor of (1 + √ 5) /2 (~ 1.618), which is best known in multiprocessor MC scheduling, and simulation results show that MC-DP-Fair outperforms all existing algorithms.
机译:混合临界系统由具有不同临界度的多个组件组成。尽管针对单处理器情况对混合临界调度进行了广泛研究,但对多处理器情况进行有效调度的问题在很大程度上仍未解决。我们设计了一种基于流体模型的多处理器混合关键性调度算法,称为MC-Fluid,其中每个任务的执行均与关键性相关的速率成比例。我们为MC-Fluid提出了精确的可调度性条件,并针对具有多项式时间复杂性的与临界性相关的执行率提出了一种最佳分配算法。由于不能在实际的硬件平台上直接实现MC-Fluid,因此我们提出了另一种调度算法,称为MC-DP-Fair,可以在保留与MC-Fluid相同的可调度性的同时实现该算法。我们显示MC-Fluid的加速因子为(1 +√5)/ 2(〜1.618),这在多处理器MC调度中最为人所知,并且仿真结果表明MC-DP-Fair优于所有现有算法。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号