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

Online Handling of Firm Aperiodic Tasks in Time Triggered Systems

Fulltext:


Publication Type:

Conference/Workshop Paper

Venue:

Proceedings od the 12th EUROMICRO Conference on Real-Time Systems (ECRTS 00)


Abstract

A number of industrial applications advocate the use of time triggered approaches for reasons of predictability, cost, product reuse, and maintenance. The rigid offline scheduling schemes used for time triggered systems, however,do not provide for flexibility. At runtime, aperiodic tasks can only be included into the unused resources of the offline schedule, supporting neither guarantees nor fast response times. <br> In this paper we present an algorithm for flexible hard aperiodic task handling in offline scheduled systems: it provides an O(N) acceptance test to determine if a set of aperiodics can be feasibly included into the offline scheduled tasks, and does not require runtime handling of resource reservation for guaranteed tasks. Thus, it supports flexible schemes for rejection and removal of aperiodic tasks, overload handling, and simple reclaiming of resources. <br> As a result, our algorithm provides for a combination of offline scheduling and online hard aperiodic task handling.

Bibtex

@inproceedings{Isovic177,
author = {Damir Isovic and Gerhard Fohler},
title = {Online Handling of Firm Aperiodic Tasks in Time Triggered Systems},
month = {June},
year = {2000},
booktitle = {Proceedings od the 12th EUROMICRO Conference on Real-Time Systems (ECRTS 00)},
url = {http://www.es.mdu.se/publications/177-}
}