Dynamic Scheduling Real-Time Task Using Primary-Backup Overloading Strategy for Multiprocessor Systems
Dynamic Scheduling Real-Time Task Using Primary-Backup Overloading Strategy for Multiprocessor Systems
复制标题
DOI：
10.1093/ietisy/e91-d.3.796
复制
发表时间：
2008-03
期刊：
影响因子：
--
通讯作者：
Wei Sun;Chen Yu;X. Défago;Y. Inoguchi
中科院分区：
文献类型：
--
作者：
Wei Sun;Chen Yu;X. Défago;Y. Inoguchi
具有容错要求的实时任务调度一直是多处理器系统中的一个重要问题。主备份（PB）方法通常被用作一种容错技术，以保证任务的最后期限，尽管存在故障。在本文中，我们提出了一个动态的PB为基础的任务调度方法，其中分配参数是用来搜索新到达的任务的可用时隙，和以前调度的任务可以重新调度时，没有可用的时隙，新到达的任务。为了提高可扩展性，我们还提出了一个PB-重载和备份-备份（BB）重载的重载策略。我们提出的任务调度算法与一些现有的调度算法在文献中进行了比较，通过仿真研究。实验结果表明，该算法的任务拒绝率比同类算法低近50%。
The scheduling of real-time tasks with fault-tolerant requirements has been an important problem in multiprocessor systems. The primary-backup (PB) approach is often used as a fault-tolerant technique to guarantee the deadlines of tasks despite the presence of faults. In this paper we propose a dynamic PB-based task scheduling approach, wherein an allocation parameter is used to search the available time slots for a newly arriving task, and the previously scheduled tasks can be re-scheduled when there is no available time slot for the newly arriving task. In order to improve the schedulability we also propose an overloading strategy for PB-overloading and Backup-backup (BB) overloading. Our proposed task scheduling algorithm is compared with some existing scheduling algorithms in the literature through simulation studies. The results have shown that the task rejection ratio of our real-time task scheduling algorithm is almost 50% lower than the compared algorithms.