Abstract
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. © Springer-Verlag Berlin Heidelberg 2003.
Cite
CITATION STYLE
Burns, A., Bernat, G., & Broster, I. (2003). A probabilistic framework for schedulability analysis. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2855, 1–15. https://doi.org/10.1007/978-3-540-45212-6_1
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
