License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.08071.4
URN: urn:nbn:de:0030-drops-14880
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2008/1488/
Go to the corresponding Portal

Bini, Enrico

Uniprocessor EDF Feasibility is an Integer Problem

pdf-format:
08071.BiniEnrico.Paper.1488.pdf (0.2 MB)

Abstract

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.

BibTeX - Entry

@InProceedings{bini:DagSemProc.08071.4,
  author =	{Bini, Enrico},
  title =	{{Uniprocessor EDF Feasibility is an Integer Problem}},
  booktitle =	{Scheduling},
  pages =	{1--17},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2008},
  volume =	{8071},
  editor =	{Jane W. S. Liu and Rolf H. M\"{o}hring and Kirk Pruhs},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2008/1488},
  URN =		{urn:nbn:de:0030-drops-14880},
  doi =		{10.4230/DagSemProc.08071.4},
  annote =	{Keywords: EDF schedulability condition, optimal deadline assignment}
}

Keywords: EDF schedulability condition, optimal deadline assignment
Collection: 08071 - Scheduling
Issue Date: 2008
Date of publication: 07.05.2008

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI