Exploring Busy Period for Worst-Case Deadline Failure Probability Analysis
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914035328352256 |
|---|---|
| author | Liu, Junyi Jiang, Xu Mu, Yuanzhen Yi, Wang Guan, Nan |
| author_facet | Liu, Junyi Jiang, Xu Mu, Yuanzhen Yi, Wang Guan, Nan |
| contents | Busy period is a fundamental concept in classical deterministic real-time scheduling analysis. In this deterministic context, only one busy period - which starts at the critical instant - needs to be considered, which identifies the worst-case scenario and thus paves the way for the development of efficient and safe analysis techniques. However, a recent work has revealed that, in the context of \textit{probabilistic} real-time scheduling analysis, only considering critical instant is not safe. In this paper, we address this gap by systematically analyzing deadline miss probabilities across varying busy period starting points. We propose a novel method of Worst-Case Deadline Failure Probability (WCDFP) for probabilistic fixed-priority preemptive scheduling. Experimental results demonstrate significant improvements over state-of-the-art methods achieved by our proposed method. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_10479 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Exploring Busy Period for Worst-Case Deadline Failure Probability Analysis Liu, Junyi Jiang, Xu Mu, Yuanzhen Yi, Wang Guan, Nan Networking and Internet Architecture Operating Systems Busy period is a fundamental concept in classical deterministic real-time scheduling analysis. In this deterministic context, only one busy period - which starts at the critical instant - needs to be considered, which identifies the worst-case scenario and thus paves the way for the development of efficient and safe analysis techniques. However, a recent work has revealed that, in the context of \textit{probabilistic} real-time scheduling analysis, only considering critical instant is not safe. In this paper, we address this gap by systematically analyzing deadline miss probabilities across varying busy period starting points. We propose a novel method of Worst-Case Deadline Failure Probability (WCDFP) for probabilistic fixed-priority preemptive scheduling. Experimental results demonstrate significant improvements over state-of-the-art methods achieved by our proposed method. |
| title | Exploring Busy Period for Worst-Case Deadline Failure Probability Analysis |
| topic | Networking and Internet Architecture Operating Systems |
| url | https://arxiv.org/abs/2509.10479 |