Formal specifications and proofs of inheritance protocols for real-time scheduling
Software Engineering Journal
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Priority Inheritance Protocols: An Approach to Real-Time Synchronization
IEEE Transactions on Computers
The Impact of an Ada Run-Time System's Performance Characteristics on Scheduling Models
Ada-Europe '93 Proceedings of the 12th Ada-Europe International Conference
Sporadic tasks in hard real-time systems
ACM SIGAda Ada Letters
Priority ceiling protocol in Ada
Proceedings of the conference on TRI-Ada '96: disciplined software development with Ada
| Hi-index | 0.00 |
In this paper we illustrate how systems containing hard real-time sporadic tasks can be analysed for their worst case behaviour. In order to undertake this schedulability analysis, it is necessary to define the minimum inter-arrival time and/or maximum arrival frequency of sporadic tasks. Furthermore, at run-time it is essential to ensure that sporadic tasks are not invoked more often than has been guaranteed by the analysis. We assume that sporadics are invoked by interrupts and that interrupts can be masked under software control.Sporadic tasks are often analysed using the notion of bandwidth preserving sporadic servers within the Rate Monotonic Scheduling Analysis scheme. At run-time this requires the underlying kernel to support complex execution time monitoring mechanisms. Unfortunately such mechanisms are not generally supported by Ada 9X. This paper shows that by using Deadline Monotonic Scheduling Analysis there is no need to resort to bandwidth preserving sporadic servers, and the facilities available in Ada 9X can be used.