2026-10-14T04:42:59Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:1488 2024-03-06T10:07:56Z ddc:004 open_access

Uniprocessor EDF Feasibility is an Integer Problem Bini, Enrico EDF schedulability condition optimal deadline assignment The research on real-time scheduling has mostly focused on the development of algorithms that allows to test whether the constraints imposed on the task execution (often expressed by deadlines) are verified or not. However, in many design scenarios the task set is only partially known and these algorithms cannot be applied because they require the complete knowledge of all the parameters of the task set. Moreover, very often the designer has the freedom to select some of the task set parameters in order to maximize the system performance, and an arbitrary selection of the free parameters can lead either to poor performance or to a constraint violation. It is then useful to describe the feasibility region of the task set parameters by equations instead of by algorithms, so that optimization algorithms can be applied to find the best assignment to the free variables. In this paper we formulate the EDF schedulability on a single processor through a combination of linear constraints. We study the geometry of the feasibility region of task deadlines when computation times and periods are known. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Enrico Bini 2008 Is Part Of Dagstuhl Seminar Proceedings, Volume 8071, Scheduling (2008) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagSemProc.08071.4 urn:nbn:de:0030-drops-14880 https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.08071.4 eng https://creativecommons.org/licenses/by/4.0/legalcode