Some Results of the Earliest Deadline Scheduling Algorithm
IEEE Transactions on Software Engineering
An adaptive scheduling algorithm for fault-tolerant real-time systems
Software Engineering Journal - Special issue on real-time software
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
A Dynamic Priority Assignment Technique for Streams with (m, k)-Firm Deadlines
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
Elastic Task Model for Adaptive Rate Control
RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
A fault-tolerant scheduling problem
IEEE Transactions on Software Engineering
| Hi-index | 0.00 |
Tasks in a real-time computing system are commonly periodic. Each instance generated by the invocation of a periodic task has normally a deadline constraint by which it must complete its execution in all circumstances. However, faults may be present in software, the electrical power supply may be depleted, the processor may be overloaded transiently etc. Any of these emergencies involves a situation where it is no longer possible to meet the deadlines of all the instances in the application. In this paper, we discuss a general model for the application task set that permits the operating system to correctly manage the above emergency situations in accordance with specific parameters statically attached to every task in addition to its classical timing parameters. The model is inspired by the well-known Deadline Mechanism and Skip-Over model. We introduce the BGW model where each instance of any periodic task can get one of the three colours Black, Grey and White. A colour specifies that the instance has to imperatively execute the primary version, the instance has to execute at least one version among primary and alternate or the instance may be discarded. We briefly discuss implementation issues for this new model.