Probabilistic Analysis and Scheduling of Critical Soft Real-Time Systems (1999)
| Citations: | 8 - 0 self |
BibTeX
@MISC{Gardner99probabilisticanalysis,
author = {Mark K. Gardner},
title = { Probabilistic Analysis and Scheduling of Critical Soft Real-Time Systems},
year = {1999}
}
OpenURL
Abstract
In addition to correctness requirements, a real-time system must also meet its temporal constraints, often expressed as deadlines. We call safety or mission critical real-time systems which may miss some deadlines critical soft real-time systems to distinguish them from hard real-time systems, where all deadlines must be met, and from soft real-time systems which are not safety or mission critical. The performance of a critical soft real-time system is acceptable as long as the deadline miss rate is below an application specific threshold. Architectural features of computer systems, such as caches and branch prediction hardware, are designed to improve average performance. Deterministic real-time design and analysis approaches require that such features be disabled to increase predictability. Alternatively, allowances must be made for for their effects by designing for the worst case. Either approach leads to a decrease in average performance. Since critical soft real-time systems do not require that all deadlines be met, average performance can be improved by adopting a probabilitistic approach. In order to allow a trade-off between deadlines met and average







