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
RTOS support for mixed time-triggered and event-triggered task sets
Technische Universiteit Eindhoven.
Mälardalens högskola, Akademin för innovation, design och teknik. (IS)ORCID-id: 0000-0002-5274-7339
Technische Universiteit Eindhoven.ORCID-id: 0000-0001-6234-5117
Technische Universiteit Eindhoven.
Vise andre og tillknytning
2012 (engelsk)Inngår i: Proceedings - 15th IEEE International Conference on Computational Science and Engineering, CSE 2012 and 10th IEEE/IFIP International Conference on Embedded and Ubiquitous Computing, EUC 2012, 2012, s. 578-585Konferansepaper, Publicerat paper (Fagfellevurdert)
Abstract [en]

Many embedded systems have complex timing constraints and, at the same time, have flexibility requirements which prohibit offline planning of the entire system. To support a mixture of time-triggered and event-triggered tasks, some industrial systems deploy an RTOS with a table-driven dispatcher complemented with a preemptive scheduler to allocate the free time slots to event-driven tasks. Rather than allocating dedicated time-slots to time-triggered tasks, in this work we provide RTOS support to dynamically re-allocate time-slots of time triggered tasks within a pre-computed time range to maximize the available processing capacity for event-triggered tasks. Although the concept - called slotshifting - is not new, we are the first to extend a commercial RTOS with such support. In addition, we extend slot shifting with a run-time mechanism to reclaim resources of time-triggered tasks when their reserved capacities are unused. This mechanism eliminates over-provisioning of capacities to (event-triggered) tasks that have been converted to periodic tasks to resolve interdependencies during off-line synthesis, e.g. allowing for a resource-efficient implementation of a polling task. After implementing our unique RTOS extensions, we investigate the run-time overheads for the corresponding scheduling mechanisms. Measurements show that the increase in terms of absolute run-time overhead is minor compared to an off-the-shelf micro-kernel with a fixed-priority scheduler

sted, utgiver, år, opplag, sider
2012. s. 578-585
HSV kategori
Identifikatorer
URN: urn:nbn:se:mdh:diva-17376DOI: 10.1109/ICCSE.2012.85ISI: 000317475000078Scopus ID: 2-s2.0-84874098102ISBN: 9780769549149 (tryckt)OAI: oai:DiVA.org:mdh-17376DiVA, id: diva2:579707
Konferanse
10th IEEE/IFIP International Conference on Embedded and Ubiquitous Computing (EUC),Paphos, Cyprus, December 2012
Tilgjengelig fra: 2012-12-20 Laget: 2012-12-20 Sist oppdatert: 2018-01-03bibliografisk kontrollert

Open Access i DiVA

Fulltekst mangler i DiVA

Andre lenker

Forlagets fulltekstScopus

Personposter BETA

Isovic, DamirBril, Reinder

Søk i DiVA

Av forfatter/redaktør
Isovic, DamirBril, ReinderRamachandran, Gowri Sankar
Av organisasjonen

Søk utenfor DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric

doi
isbn
urn-nbn
Totalt: 30 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