Towards Efficient Explainability of Schedulability Properties in Real-Time Systems

Autor:	Baruah, Sanjoy, Ekberg, Pontus
Jazyk:	angličtina
Rok vydání:	2023
Předmět:	Software and its engineering → Scheduling Computational Complexity Computer systems organization → Real-time systems Explanation Verification Approximation Schemes Uniprocessor and Multiprocessor Schedulability Recurrent Task Systems
DOI:	10.4230/lipics.ecrts.2023.2
Popis:	The notion of efficient explainability was recently introduced in the context of hard-real-time scheduling: a claim that a real-time system is schedulable (i.e., that it will always meet all deadlines during run-time) is defined to be efficiently explainable if there is a proof of such schedulability that can be verified by a polynomial-time algorithm. We further explore this notion by (i) classifying a variety of common schedulability analysis problems according to whether they are efficiently explainable or not; and (ii) developing strategies for dealing with those determined to not be efficiently schedulable, primarily by identifying practically meaningful sub-problems that are efficiently explainable. LIPIcs, Vol. 262, 35th Euromicro Conference on Real-Time Systems (ECRTS 2023), pages 2:1-2:20
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::07ee9e5f2099b6356012e5b1d375f702 Zobrazit plný text záznamu