Real-time Task Scheduling Using Extended Overloading Technique for Multiprocessor Systems

Authors:
Wei Sun;Chen Yu;Xavier Defago;Yuanyuan Zhang;Yasushi Inoguchi
Affiliations:
Japan Advanced Institute of Science and Technology;Japan Advanced Institute of Science and Technology;Japan Advanced Institute of Science and Technology;Fujitsu Laboratories Ltd.;Japan Advanced Institute of Science and Technology
Venue:
DS-RT '07 Proceedings of the 11th IEEE International Symposium on Distributed Simulation and Real-Time Applications
Year:
2007

Citing 10
Cited 1

The Spring kernel: a new paradigm for real-time operating systems

ACM SIGOPS Operating Systems Review
Fault-Tolerance Through Scheduling of Aperiodic Tasks in Hard Real-Time Multiprocessor Systems

IEEE Transactions on Parallel and Distributed Systems
A Fault-Tolerant Dynamic Scheduling Algorithm for Multiprocessor Real-Time Systems and Its Analysis

IEEE Transactions on Parallel and Distributed Systems
Resource Reclaiming in Multiprocessor Real-Time Systems

IEEE Transactions on Parallel and Distributed Systems
An Efficient Dynamic Scheduling Algorithm for Multiprocessor Real-Time Systems

IEEE Transactions on Parallel and Distributed Systems
A Fault-Tolerant Scheduling Algorithm for Real-Time Periodic Tasks with Possible Software Faults

IEEE Transactions on Computers
Real-Time Primary-Backup (RTPB) Replication with Temporal Consistency Guarantees

ICDCS '98 Proceedings of the The 18th International Conference on Distributed Computing Systems
Efficient overloading techniques for primary-backup scheduling in real-time systems

Journal of Parallel and Distributed Computing
An adaptive scheme for fault-tolerant scheduling of soft real-time tasks in multiprocessor systems

Journal of Parallel and Distributed Computing
Hybrid Overloading and Stochastic Analysis for Redundant Real-time Multiprocessor Systems

SRDS '07 Proceedings of the 26th IEEE International Symposium on Reliable Distributed Systems

Dynamic Scheduling Real-Time Task Using Primary-Backup Overloading Strategy for Multiprocessor Systems

IEICE - Transactions on Information and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The scheduling of real-time tasks with fault-tolerant requirements has been an important problem in multiprocessor systems. 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 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 rescheduled when there is no available time slot for the newly arriving task. In order to improve the schedulability we extend the existing PB-overloading and the 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 lower than the compared algorithms.