Efficiently Approximating the Worst-Case Deadline Failure Probability Under EDF.
Georg von der BrüggenNico PiatkowskiKuan-Hsun ChenJian-Jia ChenKatharina MorikBjörn B. BrandenburgPublished in: RTSS (2021)
Keyphrases
- worst case
- scheduling algorithm
- probability distribution
- failure rate
- upper bound
- lower bound
- np hard
- response time
- greedy algorithm
- website
- error bounds
- failure prediction
- neural network
- running times
- average case
- highly efficient
- times faster
- multi class
- objective function
- artificial intelligence
- genetic algorithm
- real world