Modeling Preemptive EDF and FP by Integer Variables. Proceedings of the 4th Multidisciplinary International Scheduling Conference: Theory and Applications (MISTA 2009), 10-12 Aug 2009, Dublin, Ireland, pages 77-84, 2009.
Paper
The design of any system can be modeled by an optimization problem, where a decision must be taken to maximize an overall utility function within some constraints (that can be physical, contractual, etc.). In hard real-time systems the constraints are specified by the deadlines that are set for the completion of tasks. However classic schedulability tests are formulated by algorithms that prevent a visualization of the feasible region of the designer choices. In this paper we formulate the EDF and FP exact schedulability conditions on a single processor through a combination of linear constraints. We believe that this alternate representation is better suited for optimization and can trigger the development of more effective design methodologies for real-time systems.
You can download the pdf of this publication from here
This publication does not have a doi, so we cannot provide a link to the original source
What is a doi?: A doi (Document Object Identifier) is a unique identifier for sicientific papers (and occasionally other material). This provides direct access to the location where the original article is published using the URL http://dx.doi/org/xxxx (replacing xxx with the doi). See http://dx.doi.org/ for more information
This pubication does not have a URL associated with it.
The URL is only provided if there is additional information that might be useful. For example, where the entry is a book chapter, the URL might link to the book itself.
@INPROCEEDINGS{2009-077-084-P, author = {E. Bini},
title = {Modeling Preemptive EDF and FP by Integer Variables},
booktitle = {Proceedings of the 4th Multidisciplinary International Scheduling Conference: Theory and Applications (MISTA 2009), 10-12 Aug 2009, Dublin, Ireland},
year = {2009},
editor = {J. Blazewicz and M. Drozdowski and G. Kendall and B. McCollum},
pages = {77--84},
note = {Paper},
abstract = {The design of any system can be modeled by an optimization problem, where a decision must be taken to maximize an overall utility function within some constraints (that can be physical, contractual, etc.). In hard real-time systems the constraints are specified by the deadlines that are set for the completion of tasks. However classic schedulability tests are formulated by algorithms that prevent a visualization of the feasible region of the designer choices. In this paper we formulate the EDF and FP exact schedulability conditions on a single processor through a combination of linear constraints. We believe that this alternate representation is better suited for optimization and can trigger the development of more effective design methodologies for real-time systems.},
owner = {gxk},
timestamp = {2010.10.11},
webpdf = {2009-077-084-P.pdf} }