Article

Stochastic Analysis of Periodic Real-Time Systems

Authors:

Orazio MirabellaAuthors Info & Claims

RTSS '02: Proceedings of the 23rd IEEE Real-Time Systems Symposium

Page 289

Published: 03 December 2002 Publication History

Publisher Site

Abstract

This paper describes a stochastic analysis method for general periodic real-time systems. The proposed method accurately computes the response time distribution of each task in the system, thus making it possible to determine the deadline miss probability of individual tasks, even for systems with maximum utilization factor greater than one. The method uniformly covers both fixed-priority scheduling (such as Rate Monotonic) as well as dynamic-priorityscheduling (such as Earliest Deadline First) and can handle arbitrary relative deadlines and execution time distributions. The accuracy of the method is proven by comparing the results from the analysis with those obtained from simulations, as well as other methodologies in the literature.

Cited By

View all

Hammadeh ZQuinton SErnst R(2019)Weakly-hard Real-time Guarantees for Earliest Deadline First Scheduling of Independent TasksACM Transactions on Embedded Computing Systems10.1145/335686518:6(1-25)Online publication date: 14-Dec-2019
https://dl.acm.org/doi/10.1145/3356865
Abella JMezzetti ECazorla FHung CPapadopoulos G(2019)On assessing the viability of probabilistic scheduling with dependent tasksProceedings of the 34th ACM/SIGAPP Symposium on Applied Computing10.1145/3297280.3297339(625-634)Online publication date: 8-Apr-2019
https://dl.acm.org/doi/10.1145/3297280.3297339
Abdeddaïm YMaxim D(2017)Probabilistic schedulability analysis for fixed priority mixed criticality real-time systemsProceedings of the Conference on Design, Automation & Test in Europe10.5555/3130379.3130514(596-601)Online publication date: 27-Mar-2017
https://dl.acm.org/doi/10.5555/3130379.3130514
Show More Cited By

Stochastic Analysis of Periodic Real-Time Systems

Recommendations

Preference-oriented fixed-priority scheduling for periodic real-time tasks

A preference priority assignment (PPA) scheme that explicitly incorporates the ASAP and ALAP execution preferences of periodic real-time tasks is proposed.An online dual-queue based preference-oriented fixed- priority (POFP) scheduler is proposed 4, ...
Fairness in periodic real-time scheduling
RTSS '95: Proceedings of the 16th IEEE Real-Time Systems Symposium

The issue of temporal fairness in periodic real-time scheduling is considered. It is argued that such fairness is often a desirable characteristic in real-time schedules. A concrete criterion for temporal fairness-pfairness-is described. The weight-...
On periodic real-time scheduling algorithms

Comments

Information & Contributors

Information

Published In

RTSS '02: Proceedings of the 23rd IEEE Real-Time Systems Symposium

December 2002

ISBN:0769518516

Publisher

IEEE Computer Society

United States

Publication History

Published: 03 December 2002

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

41
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 07 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Hammadeh ZQuinton SErnst R(2019)Weakly-hard Real-time Guarantees for Earliest Deadline First Scheduling of Independent TasksACM Transactions on Embedded Computing Systems10.1145/335686518:6(1-25)Online publication date: 14-Dec-2019
https://dl.acm.org/doi/10.1145/3356865
Abella JMezzetti ECazorla FHung CPapadopoulos G(2019)On assessing the viability of probabilistic scheduling with dependent tasksProceedings of the 34th ACM/SIGAPP Symposium on Applied Computing10.1145/3297280.3297339(625-634)Online publication date: 8-Apr-2019
https://dl.acm.org/doi/10.1145/3297280.3297339
Abdeddaïm YMaxim D(2017)Probabilistic schedulability analysis for fixed priority mixed criticality real-time systemsProceedings of the Conference on Design, Automation & Test in Europe10.5555/3130379.3130514(596-601)Online publication date: 27-Mar-2017
https://dl.acm.org/doi/10.5555/3130379.3130514
Maxim CGogonel AAsavoae IAsavoae MCucu-Grosjean L(2017)Reproducibility and representativityACM SIGBED Review10.1145/3166227.316623014:3(24-31)Online publication date: 22-Nov-2017
https://dl.acm.org/doi/10.1145/3166227.3166230
Maxim DDavis RCucu-Grosjean LEaswaran ABini EPagetti C(2017)Probabilistic analysis for mixed criticality systems using fixed priority preemptive schedulingProceedings of the 25th International Conference on Real-Time Networks and Systems10.1145/3139258.3139276(237-246)Online publication date: 4-Oct-2017
https://dl.acm.org/doi/10.1145/3139258.3139276
Burns ADavis R(2017)A Survey of Research into Mixed Criticality SystemsACM Computing Surveys10.1145/313134750:6(1-37)Online publication date: 22-Nov-2017
https://dl.acm.org/doi/10.1145/3131347
Sun YNatale M(2017)Weakly Hard Schedulability Analysis for Fixed Priority Scheduling of Periodic Real-Time TasksACM Transactions on Embedded Computing Systems10.1145/312649716:5s(1-19)Online publication date: 27-Sep-2017
https://dl.acm.org/doi/10.1145/3126497
Ben-Amor SMaxim DCucu-Grosjean LPlantec ASinghoff FFaucou SPinho L(2016)Schedulability analysis of dependent probabilistic real-time tasksProceedings of the 24th International Conference on Real-Time Networks and Systems10.1145/2997465.2997499(99-107)Online publication date: 19-Oct-2016
https://dl.acm.org/doi/10.1145/2997465.2997499
Tanasa BBordoloi UEles PPeng Z(2016)Correlation-Aware Probabilistic Timing Analysis for the Dynamic Segment of FlexRayACM Transactions on Embedded Computing Systems10.1145/287063515:3(1-31)Online publication date: 23-May-2016
https://dl.acm.org/doi/10.1145/2870635
Abeni LFontanelli DPalopoli LFrías BOssowski S(2016)Probabilistic analysis of bufferless pipelines of real-time tasksProceedings of the 31st Annual ACM Symposium on Applied Computing10.1145/2851613.2851676(1751-1758)Online publication date: 4-Apr-2016
https://dl.acm.org/doi/10.1145/2851613.2851676
Show More Cited By

Abstract

Cited By

Recommendations

Preference-oriented fixed-priority scheduling for periodic real-time tasks

Fairness in periodic real-time scheduling

On periodic real-time scheduling algorithms

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations