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

Handling Sporadic Tasks in Real-time Systems - Combined Offline and Online Approach

Fulltext:


Authors:


Publication Type:

Report - MRTC

Publisher:

Mälardalen University Press, Mälardalen University, Sweden

ISRN:

MDH-MRTC-40/2001-1-SE


Abstract

Many industrial applications with real-time demands are composed of mixed sets of tasks with a variety of requirements. These can be in the form of standard timing constraints, such as period and deadline, or complex, e.g., to express application specific or non temporal constraints, reliability, performance, etc. Arrival patterns determine whether tasks will be treated as periodic, sporadic, or aperiodic. As many algorithms focus on specific sets of task types and constraints only, system design has to focus on those supported by a particular algorithm, at the expense of the rest. In this work, we present a set of algorithms to deal with a combination of mixed sets of tasks and constraints: periodic tasks with complex and simple constraints, soft and firm aperiodic, and in particular sporadic tasks. Instead of providing algorithms tailored for a specific set of constraints, we propose an EDF based runtime algorithm, and the use of an offline scheduler for complexity reduction to transform complex constraints into the EDF model. At runtime, an extension to EDF, two level EDF, ensures feasible execution of tasks with complex constraints in the presence of additional tasks or overloads. We present a combined offline and online approach for handling sporadic tasks. First, the sporadic tasks are guaranteed offline, during design time, which allows rescheduling or redesign in the case of failure. Since we do not know the arrival time of sporadics we need to perform the worst-case offline guarantee. Second, we try online to reduce the pessimism intoduced by worst-case assumption. An online algorithm keeps track of arrivals of instances of sporadic tasks to reduce pessimism about future sporadic arrivals and improve response times and acceptance of firm aperiodic tasks. A simulation study underlines the effectiveness of the proposed approach.

Bibtex

@techreport{Isovic261,
author = {Damir Isovic},
title = {Handling Sporadic Tasks in Real-time Systems - Combined Offline and Online Approach},
number = {ISSN 1404-3041 ISRN MDH-MRTC-40/2001-1-SE},
month = {June},
year = {2001},
publisher = {M{\"a}lardalen University Press, M{\"a}lardalen University, Sweden},
url = {http://www.es.mdu.se/publications/261-}
}