Efficiently approximating the probability of deadline misses in real-time systems

DOI10.4230/LIPIcs.ECRTS.2018.6zbMath1497.68072OpenAlexW2810473819MaRDI QIDQ5140790

Jian-Jia Chen, Georg von der Brüggen, Nico Piatkowski, Kuan-Hsun Chen, Katharina Morik

Publication date: 16 December 2020

Full work available at URL: https://doi.org/10.4230/LIPIcs.ECRTS.2018.6

zbMATH Keywords

analytical bounddeadline miss probabilitymultinomial-based approach

Mathematics Subject Classification ID

Inequalities; stochastic orderings (60E15) Combinatorial probability (60C05) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (1)

DMAC: Deadline-Miss-Aware Control

Cites Work

• A mathematical introduction to compressive sensing
• Spatio-temporal random fields: compressible representation and distributed estimation
• Measuring the performance of schedulability tests
• Probability Inequalities for Sums of Bounded Random Variables
• Probability and Computing

This page was built for publication: Efficiently approximating the probability of deadline misses in real-time systems