• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Transactions on Parallel and Distributed Systems >Best-Harmonically-Fit Periodic Task Assignment Algorithm on Multiple Periodic Resources
【24h】

Best-Harmonically-Fit Periodic Task Assignment Algorithm on Multiple Periodic Resources

机译：多种周期资源上的最佳谐波拟合周期任务分配算法

获取原文
获取原文并翻译 | 示例
       
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

The periodic task set assignment problem in the context of multiple processors has been studied for decades. Different heuristic approaches have been proposed, such as the Best-Fit (BF), the First-Fit (FF), and the Worst-Fit (WF) task assignment algorithms. However, when processors are not dedicated but only periodically available to the task set, whether existing approaches still provide good performance or if there is a better task assignment approach in the new context are research problems which, to our best knowledge, have not been studied by the real-time research community. In this paper, we present the Best-Harmonically-Fit (BHF) task assignment algorithm to assign periodic tasks on multiple periodic resources. By periodic resource we mean that for every fixed time interval, i.e., the period, the resource always provides the same amount of processing capacity to a given task set. Our formal analysis indicates that if a harmonic task set is also harmonic with a resource's period, the resource capacity can be fully utilized by the task set. Based on this analysis, we present the Best-Harmonically-Fit task assignment algorithm. The experimental results show that, on average, the BHF algorithm results in , , and percent higher resource utilization rate than the Best-Fit Decreasing (BFD), the First-Fit Decreasing (FFD), and the Worst-Fit Decreasing (WFD) task assignment algorithms, respectively; but comparing to the optimal r- source utilization rate found by exhaustive search, it is about percent lower.
机译：在多处理器环境中的周期性任务集分配问题已经研究了数十年。已经提出了不同的启发式方法，例如最适合（BF），最适合（FF）和最不适合（WF）任务分配算法。但是，当处理器不是专用的而是只能定期用于任务集时，现有的方法是否仍可提供良好的性能，或者在新的环境中是否存在更好的任务分配方法，则是据我们所知尚未研究的研究问题。由实时研究社区提供。在本文中，我们提出了最佳谐波适合（BHF）任务分配算法，以在多个周期性资源上分配周期性任务。周期性资源是指对于每个固定的时间间隔（即周期），资源始终为给定的任务集提供相同数量的处理能力。我们的形式分析表明，如果谐波任务集也是资源周期的谐波，则任务集可以充分利用资源容量。基于此分析，我们提出了最佳谐波拟合任务分配算法。实验结果表明，与最佳适应降低（BFD），第一适应降低（FFD）和最不利适应（WFD）相比，BHF算法平均可提高，和％的资源利用率。任务分配算法；但与穷举搜索找到的最佳r源利用率相比，它要低大约百分之百。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号