Affiliation:
1. Real-time Systems Research Group, Department of Computer Science, University of York, UK
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 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.
Publisher
Association for Computing Machinery (ACM)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献