A Probabilistic Framework for Schedulability Analysis
A. Burns, G. Bernat and I. Broster
The limitations of the deterministic formulation of scheduling are outlined and a probabilistic approach is motivated. A number of models are reviewed with one being chosen as a basic framework. Response-time analysis is extended to incorporate a probabilistic characterisation of task arrivals and execution times. Copulas are used to represent dependencies.
BibTex Entry
@inproceedings{Burns2003e,
author = {A. Burns and G. Bernat and I. Broster},
booktitle = {Proceedings of the Third International Embedded Software Conference, EMSOFT},
editor = {R Alur and I Lee},
number = {LNCS 2855},
pages = {1--15},
series = {Lecture Notes in Computer Science},
title = {A Probabilistic Framework for Schedulability Analysis},
year = {2003}
}