You are required to read and agree to the below before accessing a full-text version of an article in the IDE article repository.

The full-text document you are about to access is subject to national and international copyright laws. In most cases (but not necessarily all) the consequence is that personal use is allowed given that the copyright owner is duly acknowledged and respected. All other use (typically) require an explicit permission (often in writing) by the copyright owner.

For the reports in this repository we specifically note that

  • the use of articles under IEEE copyright is governed by the IEEE copyright policy (available at http://www.ieee.org/web/publications/rights/copyrightpolicy.html)
  • the use of articles under ACM copyright is governed by the ACM copyright policy (available at http://www.acm.org/pubs/copyright_policy/)
  • technical reports and other articles issued by M‰lardalen University is free for personal use. For other use, the explicit consent of the authors is required
  • in other cases, please contact the copyright owner for detailed information

By accepting I agree to acknowledge and respect the rights of the copyright owner of the document I am about to access.

If you are in doubt, feel free to contact webmaster@ide.mdh.se

Response-time Calculation and Priority Assignment with Integer Programming Methods

Fulltext:


Authors:

Björn Lisper, Peter Mellgren

Publication Type:

Conference/Workshop Paper

Venue:

Proc. Work-in-progress and Industrial Sessions, 13th Euromicro Conference on Real-Time Systems


Abstract

Exact response-time calculation for cyclical tasks with fixed priorities requires that equations involving ceilings are solved. These equations are usually solved iteratively. For simple response-time problems with fixed priorities the iterations are guaranteed to converge if there is a solution. For more complex cases, however, like scheduling of real-time tasks in distributed systems, the iterative method does not always provide the best solution, in particular if the combined response-time/optimal priority assignment problem is considered. We show how to reformulate equations with ceilings into integer linear programming problems, which can be solved with known optimization methods. This reformulation is directly applicable to classical exact response-time calculation. We also show how optimal assignment of priorities can be incorporated in the model, which turns the optimization problem into a bilinear integer programming problem. A possible application is holistic scheduling with optimal priority assignments in distributed real-time systems.

Bibtex

@inproceedings{Lisper282,
author = {Bj{\"o}rn Lisper and Peter Mellgren},
title = {Response-time Calculation and Priority Assignment with Integer Programming Methods},
editor = {Eduardo Tovar and Christer Norstr{\"o}m},
pages = {13--16},
month = {June},
year = {2001},
booktitle = {Proc. Work-in-progress and Industrial Sessions, 13th Euromicro Conference on Real-Time Systems},
url = {http://www.es.mdh.se/publications/282-}
}