A fault-tolerant scheduling problem
IEEE Transactions on Software Engineering
An extendible approach for analyzing fixed priority hard real-time tasks
Real-Time Systems
Fault-Tolerant Rate-Monotonic First-Fit Scheduling in Hard-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
Analysis of Hierar hical Fixed-Priority Scheduling
ECRTS '02 Proceedings of the 14th Euromicro Conference on Real-Time Systems
A Fixed-Priority-Driven Open Environment for Real-Time Applications
RTSS '99 Proceedings of the 20th IEEE Real-Time Systems Symposium
Fault-tolerant scheduling for real-time embedded control systems
Journal of Computer Science and Technology
Hierarchical Fixed Priority Pre-Emptive Scheduling
RTSS '05 Proceedings of the 26th IEEE International Real-Time Systems Symposium
Scheduling Hard-Real-Time Tasks with Backup Phasing Delay
DS-RT '06 Proceedings of the 10th IEEE international symposium on Distributed Simulation and Real-Time Applications
Compositional real-time scheduling framework with periodic model
ACM Transactions on Embedded Computing Systems (TECS)
Towards hierarchical scheduling in AUTOSAR
ETFA'09 Proceedings of the 14th IEEE international conference on Emerging technologies & factory automation
Kernel-level ARINC 653 partitioning for Linux
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Fault-Tolerant Scheduling in Hierarchical Real-Time Scheduling Framework
RTCSA '12 Proceedings of the 2012 IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
| Hi-index | 0.00 |
The resource partitioning has been suggested to provide efficient composition of multi-threaded real-time applications. Partitioning can provide reliable and flexible software upgrade as partitions are strongly isolated in terms of resources. However, there are always possibility of experiencing software faults while operating on a real plant. To avoid entering a hazardous state due to a partition that is yet to be fully verified, we can deploy a backup partition that may implement inefficient algorithms or limited features but is verified with respect to reliability. The backup partition performs failover to carry out missions of the corresponding primary partition when a software fault is detected. There have been significant researches for fault-tolerant real-time scheduling but considerations for partitioned systems have not been studied. In this paper, we extend the resource model for hierarchical real-time scheduling to support primary and backup partitions. Our model can support context-dependent and context-independent tasks in the backup partition efficiently. In addition, we provide the schedulability analysis for suggested model.