mdh.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Handling Mixed Task Sets in Combined Offline and Online Scheduled Real-Time Systems
Mälardalen University, School of Innovation, Design and Engineering.ORCID iD: 0000-0002-5274-7339
2009 (English)In: Real-time systems, ISSN 0922-6443, E-ISSN 1573-1383, Vol. 43, no 3, p. 296-325Article in journal (Refereed) Published
Abstract [en]

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 paper, we present a method 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. We propose the use of an offline scheduler to manage complex timing and resource constraints of periodic tasks and transform these into a simple EDF model with start-times and deadlines. On top of the offline schedule, sporadic tasks are guaranteed based on their worst-case activation frequencies. Then at run-time, an extension to EDF ensures feasible execution of tasks with complex constraints in the presence of additional tasks or overloads. It allows changes in the offline generated schedule to insert soft and firm aperiodic tasks by shifting the execution of offline scheduled tasks within their feasibility windows. Furthermore, the online algorithm uses the exact knowledge about sporadic arrivals to reduce the pessimism introduced by worst-case assumption, i.e., the resources unused by sporadic tasks are reclaimed to improve response times and acceptance of firm aperiodic tasks. A simulation study underlines the effectiveness of the proposed approach.

Place, publisher, year, edition, pages
2009. Vol. 43, no 3, p. 296-325
National Category
Engineering and Technology
Identifiers
URN: urn:nbn:se:mdh:diva-8979DOI: 10.1007/s11241-009-9088-3ISI: 000270386300003Scopus ID: 2-s2.0-70349659256OAI: oai:DiVA.org:mdh-8979DiVA, id: diva2:301541
Available from: 2010-03-03 Created: 2010-03-03 Last updated: 2017-12-12Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records BETA

Isovic, Damir

Search in DiVA

By author/editor
Isovic, DamirFohler, Gerhard
By organisation
School of Innovation, Design and Engineering
In the same journal
Real-time systems
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 42 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf