2026-07-26T01:03:45Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:13942 2024-03-06T10:53:20Z ddc:004 open_access

Tight Tardiness Bounds for Pseudo-Harmonic Tasks Under Global-EDF-Like Schedulers Ahmed, Shareef Anderson, James H. soft real-time systems multicore tardiness bounds The global earliest-deadline-first (GEDF) scheduler and its variants are soft-real-time (SRT) optimal for periodic/sporadic tasks, meaning they provide bounded tardiness so long as the underlying platform is not over-utilized. Although their SRT-optimality has long been known, tight tardiness bounds for these schedulers have remained elusive. In this paper, a tardiness bound, that does not depend on the processor or task count, is derived for pseudo-harmonic periodic tasks, which are commonly used in practice, under global-EDF-like (GEL) schedulers. This class of schedulers includes both GEDF and first-in-first-out (FIFO). This bound is shown to be generally tight via an example. Furthermore, it is shown that exact tardiness bounds for GEL-scheduled pseudo-harmonic periodic tasks can be computed in pseudo-polynomial time. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Shareef Ahmed and James H. Anderson 2021 Is Part Of LIPIcs, Volume 196, 33rd Euromicro Conference on Real-Time Systems (ECRTS 2021) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ECRTS.2021.11 urn:nbn:de:0030-drops-139428 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ECRTS.2021.11 eng https://creativecommons.org/licenses/by/4.0/legalcode