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

Task Attribute Assignment of Fixed Priority Scheduled Tasks to Reenact Off-Line Schedules

Authors:

Radu Dobrin, Yusuf Özdemir , Gerhard Fohler

Publication Type:

Conference/Workshop Paper

Venue:

Proceedings of RTCSA 2000

Abstract

A number of industrial applications advocate the use of time triggered approaches for reasons of predictability, distribution, and particular constraints such as jitter or end-to-end deadlines. The rigid offline scheduling schemes used for time triggered systems, however, do not provide for flexibility. Fixed priority scheduling can provide more flexibility, but is limited with respect to predictability, as actual times of executions depend on run-time events. In this paper, we present a method to combine off-line schedule construction with fixed priority scheduling: by determining task attributes for the off-line scheduled tasks, such that the original schedule is reconstructed if scheduled with FPS at run-time. It analysis off-line schedule together with original task constraints to create sequences and windows of tasks. Priorities and offsets are set to ensure task orders in sequences and relation between windows. As FPS cannot reconstruct all schedules with periodic tasks, our algorithm can split tasks into several instances to achieve consistent task attributes. Lower priority tasks can be added for run-time use.

Bibtex

@inproceedings{Dobrin206,
author = {Radu Dobrin and Yusuf {\"O}zdemir and Gerhard Fohler},
title = {Task Attribute Assignment of Fixed Priority Scheduled Tasks to Reenact Off-Line Schedules},
month = {December},
year = {2000},
booktitle = {Proceedings of RTCSA 2000},
url = {http://www.es.mdu.se/publications/206-}
}