A fault-tolerant scheduling problem
IEEE Transactions on Software Engineering
On Scheduling Tasks with a Quick Recovery from Failure
IEEE Transactions on Computers
Some Results of the Earliest Deadline Scheduling Algorithm
IEEE Transactions on Software Engineering
Algorithms for Scheduling Imprecise Computations
Computer - Special issue on real-time systems
A Multiframe Model for Real-Time Tasks
IEEE Transactions on Software Engineering
Fault-Tolerant Rate-Monotonic Scheduling
Real-Time Systems
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Analysis of Checkpointing for Real-Time Systems
Real-Time Systems
IEEE Transactions on Computers
On the Scheduling of Flexible and Reliable Real-Time Control Systems
Real-Time Systems
A Dynamic Priority Assignment Technique for Streams with (m, k)-Firm Deadlines
IEEE Transactions on Computers
IEEE Transactions on Computers
A Fault-Tolerant Scheduling Algorithm for Real-Time Periodic Tasks with Possible Software Faults
IEEE Transactions on Computers
Skip-Over: algorithms and complexity for overloaded systems that allow skips
RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
Enhanced fixed-priority scheduling with (m,k)-firm guarantee
RTSS'10 Proceedings of the 21st IEEE conference on Real-time systems symposium
Analysis of a window-constrained scheduler for real-time and best-effort packet streams
RTSS'10 Proceedings of the 21st IEEE conference on Real-time systems symposium
Hi-index | 0.00 |
Recent research in real-time systems has much focused on new task models for flexible scheduling and fault-tolerant real-time systems. In this paper, we propose a novel task model for the purpose of flexible scheduling in reliable real-time systems. In the proposed dual-mode r-reliable task model, a task periodically releases fast mode jobs or reliable mode jobs with the constraint that reliable mode jobs must be executed at least once for any r consecutive periods to guarantee the reliability of task. We also propose scheduling algorithms and compare performance through simulation results