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

Attribute Assignment for the Integration of Off-line and Fixed Priority Scheduling

Authors:

Radu Dobrin, Gerhard Fohler

Publication Type:

Conference/Workshop Paper

Venue:

Work-in-Progress Session, 21st IEEE Real-Time Systems Symposium

Abstract

In this paper we present work to combine FPS with off-line schedule construction. It assumes a schedule has been constructed off-line for a set of tasks to meet their complex constraints. Our method takes the schedule and assigns the FPS attributes priority, offset, and period, to the tasks, such that their runtime FPS execution matches the off-line schedule. It does so by dividing the schedule into sequences and deriving priority inequalities, which are then resolved by integer linear programming. As FPS cannot reconstruct all schedules with periodic tasks, we have to split tasks into several instances to achieve consistent task attributes. Our algorithm constructs the minimum number of such artifact tasks.

Bibtex

@inproceedings{Dobrin224,
author = {Radu Dobrin and Gerhard Fohler},
title = {Attribute Assignment for the Integration of Off-line and Fixed Priority Scheduling},
month = {November},
year = {2000},
booktitle = {Work-in-Progress Session, 21st IEEE Real-Time Systems Symposium},
url = {http://www.es.mdu.se/publications/224-}
}