A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Quantitative Schedulability Analysis of Continuous Probability Tasks in a Hierarchical Context
2015
Proceedings of the 18th International ACM SIGSOFT Symposium on Component-Based Software Engineering - CBSE '15
We define the concept of degree of schedulability to characterize the schedulability and performance of soft real-time systems. The degree of schedulability of a system is given in terms of the two factors 1) Percentage of Missed Deadlines (PoMD); and 2) Degradation of the Quality of Service (DoQoS). Our work is set as a model-based framework for hierarchical scheduling systems where we introduce probability based sporadic tasks. The novel aspect is that we consider task arrival patterns that
doi:10.1145/2737166.2737170
dblp:conf/cbse/KimBNMLSLP15
fatcat:yequph6fpvhlvca2rd5ymtxf5i