Implementing Analysable Hard Real-time Sporadic Tasks in Ada 9X (1994) [4 citations — 2 self]
ftp://ftp.cs.york.ac.uk/reports/YCS-93-209.ps.Z
ftp://ftp.cs.york.ac.uk/pub/realtime/papers/YCS209
http://www.cs.york.ac.uk/ftpdir/reports/YCS-93-209
CACHED:
|
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
author = {A. Burns and A. J. Wellings},
title = {Implementing Analysable Hard Real-time Sporadic Tasks in Ada 9X},
institution = {Ada Letters},
year = {1994}
}
Bookmarks
OpenURL
Abstract:
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 runtime 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...
