首页> 外文会议>2010 WASE International Conference on Information Engineering >Bin-packing Algorithms for Periodic Task Scheduling
【24h】

Bin-packing Algorithms for Periodic Task Scheduling

机译:定期任务调度的装箱算法

获取原文

摘要

As the extension of off-line bin-packing problem, periodic task scheduling has many important applications in real-time distributed systems. For time triggered CAN control systems, two strategies to determine basic cycle(BC) of TTCAN are presented. Next-fit algorithm, next-fit decreasing algorithm, best-fit algorithm and best-fit decreasing algorithm are proposed to construct periodic task scheduling tables. Time complexity and worst-case asymptotic performance ratio of these algorithms are analyzed, and experiment results are compared in different problem size.
机译:作为离线装箱问题的扩展,周期性任务调度在实时分布式系统中具有许多重要的应用。对于时间触发的CAN控制系统,提出了两种确定TTCAN基本周期(BC)的策略。提出了下一步拟合算法,下一步拟合递减算法,最佳拟合算法和最佳拟合递减算法来构造周期任务调度表。分析了这些算法的时间复杂度和最坏情况下的渐近性能比,并比较了不同问题大小下的实验结果。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号