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

Improved Handling of Soft Aperiodic Tasks in Offline Scheduled Real-Time Systems using Total Bandwidth Server

Fulltext:


Authors:

Gerhard Fohler, Tomas Lennvall, Giorgio Buttazzo

Publication Type:

Conference/Workshop Paper

Venue:

In 8th IEEE Int. Conf. on Emerging Technologies & Factory Automation


Abstract

Real-world industrial applications impose complex constraints, such as distribution, end-to-end deadlines, and jitter control on real-time systems and require their efficient handling. Most scheduling algorithms concentrate on single or limited combinations of constraints and requirements only. Offline scheduling resolves complex constraints, but provides only very limited flexibility. Online scheduling on the other hand, supports flexibility, resource reclaiming, and overload handling, but handling constraints such as distribution or end-to-end deadline can be costly, if not intractable. In this paper, we propose a method to bridge the gap between offline and online scheduling paradigms to allow for efficient handling of tasks with complex constraints in dynamic systems. It uses offline scheduling to handle complex constraints, reduce their complexity, and provide for guaranteed available bandwidth. The constructed schedule is translated into independent tasks on single nodes with starttimes and deadline constraints only. These are then executed using earliest deadline first, total bandwidth server scheduling at runtime. Thus, our method enables systems to handle tasks with complex constraints via standard online scheduling methods at runtime.

Bibtex

@inproceedings{Fohler273,
author = {Gerhard Fohler and Tomas Lennvall and Giorgio Buttazzo},
title = {Improved Handling of Soft Aperiodic Tasks in Offline Scheduled Real-Time Systems using Total Bandwidth Server},
month = {October},
year = {2001},
booktitle = {In 8th IEEE Int. Conf. on Emerging Technologies {\&} Factory Automation},
url = {http://www.es.mdu.se/publications/273-}
}