首页> 外文会议>International Conference for Internet Technology and Secured Transactions >A fault-tolerant scheduling algorithm based on grouping for real-time multiprocessor
【24h】

A fault-tolerant scheduling algorithm based on grouping for real-time multiprocessor

机译:基于分组的实时多处理器容错调度算法

获取原文

摘要

In order to improve the fault-tolerant scheduling efficiency of aperiotic tasks in a real-time multiprocessor system, a fault-tolerant scheduling algorithm based on grouping for realtime multiprocessor is proposed. This algorithm determines the primary-backup scheduling forms of aperiotic tasks based on processor grouping technology. The algorithm uses Improved Spring algorithm to finish the scheduling of task copies in primary-backup concur and overlap form,and it uses Application Parameter overloading strategy to optimize the scheduling of task copies in primary-backup exclusive form,so that the scheduling efficiencies of aperiotic tasks are improved considerably. It is shown from the simulation that this algorithm has important effect on improving the fault-tolerant scheduling performance of aperiotic tasks.
机译:为了提高实时多处理器系统中非任务任务的容错调度效率,提出了一种基于分组的实时多处理器容错调度算法。该算法基于处理器分组技术确定非定期任务的初次备份调度形式。该算法使用改进的Spring算法完成主备份并发和重叠形式的任务副本的调度,并使用应用程序参数重载策略优化主备份排他形式的任务副本的调度,从而使非周期性的任务调度效率更高。任务得到了很大改善。仿真结果表明,该算法对改善非任务任务的容错调度性能具有重要作用。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号