Sporadic tasks in hard real-time systems

Authors:
R. K. Allen;A. Burns;A. J. Wellings
Affiliations:
Department of Computer Science, Swinburne University of Technology, Hawthorn, Victoria, Australia;Real-time Systems Research Group, Department of Computer Science, University of York, UK;Real-time Systems Research Group, Department of Computer Science, University of York, UK
Venue:
ACM SIGAda Ada Letters
Year:
1995

Citing 2
Cited 0

Implementing analysable hard real-time sporadic tasks in Ada 9X

ACM SIGAda Ada Letters
An extendible approach for analyzing fixed priority hard real-time tasks

Real-Time Systems

Quantified Score

Hi-index	0.00

Visualization

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.