Fault-Tolerant Real-Time Scheduling Algorithm in Multi-Core Processor
朱扬烁 1吕海玉 1李奕晨 1张凤登1
扫码查看
点击上方二维码区域，可以放大扫码查看
作者信息
1. 上海理工大学 光电信息与计算机工程学院,上海 200093
折叠
摘要
针对系统故障模式下容错公平调度FT-FS(Fault Tolerate Fair Scheduler)算法存在拒绝任务次数较多和资源浪费等问题,文中在FT-FS算法的基础上融入了主/替代版本PA(Primary Alternate)容错策略,提出了新的公平调度算法PA-FTFS(Primary-Alternate and Fault Tolerant Fair Scheduling).该算法能够在多核处理器系统中减少资源浪费的同时更好地减少拒绝任务的次数.利用MATLAB仿真软件对上述算法进行了仿真验证,实验结果表明在内核发生永久性故障后,采用比例替代任务策略的PA-FTFS算法相较于FT-FS算法拒绝任务的次数明显减少.通过数据分析表明,PA-FTFS算法相较于FT-FS算法在故障率和调度率上具有较大改进.
Abstract
In view of the problems such as too many times of rejected tasks and waste of resources in fault-tolerant fair scheduling FT-FS(Fault Tolerate Fair Scheduler)algorithm,a new fair scheduling algorithm PA-FTFS(Primary-Alternate and Fault Tolerant Fair Scheduling)is proposed based on FT-FS algorithm by integrating the main/alternative PA(Primary Alternate)fault-tolerant strategy.This algorithmcan reduce the number of rejected tasks in multi-core pro-cessor system and reduce the waste of resources.MATLAB simulation software is used to verify the above algorithms.The experimental results show that PA-FTFS algorithm using proportional replacement task strategy has significantly reduced the number of task rejection times compared with FT-FS algorithm after permanent kernel failure.Data analysis shows that PA-FTFS algorithm has better failure rate and scheduling rate than FT-FS algorithm.
维普
万方数据