2026-07-26T19:28:40Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:16324 2024-03-06T10:57:39Z ddc:004 open_access

A Mathematical Comparison Between Response-Time Analysis and Real-Time Calculus for Fixed-Priority Preemptive Scheduling Pollex, Victor Slomka, Frank real-time systems fixed-priority scheduling response-time analysis real-time calculus Fixed-priority preemptive scheduling is a popular scheduling scheme for real-time systems. This is accompanied by a vast amount of research on how to analyse and check whether these systems satisfy their real-time requirements. Two methods that emerged from this research are the response-time analysis and the real-time calculus. These two methods have been compared empirically on the basis of several abstract systems showing that for some systems one method gives better results than the other and for other systems both methods appear to give the same results. However, empirical analyses inherently contain uncertainty. To get a definitive answer we compare both methods mathematically and we show that both methods give the same results for systems that use fixed-priority preemptive scheduling and independent tasks. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Victor Pollex and Frank Slomka 2022 Is Part Of LIPIcs, Volume 231, 34th Euromicro Conference on Real-Time Systems (ECRTS 2022) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ECRTS.2022.7 urn:nbn:de:0030-drops-163246 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ECRTS.2022.7 eng https://creativecommons.org/licenses/by/4.0/legalcode