mdh.sePublikasjoner
Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Handling Mixed Task Sets in Combined Offline and Online Scheduled Real-Time Systems
Mälardalens högskola, Akademin för innovation, design och teknik.ORCID-id: 0000-0002-5274-7339
2009 (engelsk)Inngår i: Real-time systems, ISSN 0922-6443, E-ISSN 1573-1383, Vol. 43, nr 3, s. 296-325Artikkel i tidsskrift (Fagfellevurdert) 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.

sted, utgiver, år, opplag, sider
2009. Vol. 43, nr 3, s. 296-325
HSV kategori
Identifikatorer
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
Tilgjengelig fra: 2010-03-03 Laget: 2010-03-03 Sist oppdatert: 2017-12-12bibliografisk kontrollert

Open Access i DiVA

Fulltekst mangler i DiVA

Andre lenker

Forlagets fulltekstScopus

Personposter BETA

Isovic, Damir

Søk i DiVA

Av forfatter/redaktør
Isovic, DamirFohler, Gerhard
Av organisasjonen
I samme tidsskrift
Real-time systems

Søk utenfor DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric

doi
urn-nbn
Totalt: 42 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf