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
Extended support for limited preemption fixed priority scheduling for OSEK/AUTOSAR-compliant operating systems
Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.ORCID-id: 0000-0002-1276-3609
Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.ORCID-id: 0000-0003-2670-3022
Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system. Technische Universiteit Eindhoven, Eindhoven, Netherlands.ORCID-id: 0000-0001-6234-5117
Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.ORCID-id: 0000-0001-6132-7945
2015 (engelsk)Inngår i: 2015 10th IEEE International Symposium on Industrial Embedded Systems, SIES 2015 - Proceedings, 2015, s. 207-217Konferansepaper, Publicerat paper (Fagfellevurdert)
Abstract [en]

Fixed Priority Scheduling (FPS) is the de facto standard in industry and it is the scheduling algorithm used in OSEK/AUTOSAR. Applications in such systems are compositions of so called runnables, the functional entities of the system. Runnables are mapped to operating system tasks during system synthesis. In order to improve system performance it is proposed to execute runnables non-preemptively while varying the tasks threshold between runnables. This allows simpler resource access, can reduce the stack usage of the system, and improve the schedulability of the task sets. FPDS , as a special case of fixed-priority scheduling with deferred preemptions, executes subjobs non-preemptively and preemption points have preemption thresholds, providing exactly the proposed behavior. However OSEK/AUTOSAR-conform systems cannot execute such schedules. In this paper we present an approach allowing the execution of FPDS schedules. In our approach we exploit pseudo resources in order to implement FPDS . It is further shown that our optimal algorithm produces a minimum number of resource accesses. In addition, a simulation based evaluation is presented in which the number of resource accesses as well as the number of required pseudo-resources by the proposed algorithms are investigated. Finally, we report the overhead of resource access primitives using our measurements performed on an AUTOSARcompliant operating system.

sted, utgiver, år, opplag, sider
2015. s. 207-217
Emneord [en]
Limited Preemptive Fixed Priority Scheduling AUTOSAROSEKPseudo Resources
HSV kategori
Identifikatorer
URN: urn:nbn:se:mdh:diva-28151DOI: 10.1109/SIES.2015.7185062ISI: 000380569800028Scopus ID: 2-s2.0-84959459867ISBN: 9781467377119 (tryckt)OAI: oai:DiVA.org:mdh-28151DiVA, id: diva2:820586
Konferanse
10th IEEE International Symposium on Industrial Embedded Systems, SIES 2015; Siegen; Germany; 8 June 2015 through 10 June 2015
Prosjekter
START - Stochastic Real-Time Analysis of Embedded Software SystemsARROWS - Design Techniques for Adaptive Embedded SystemsTilgjengelig fra: 2015-06-12 Laget: 2015-06-08 Sist oppdatert: 2018-01-11bibliografisk kontrollert

Open Access i DiVA

Fulltekst mangler i DiVA

Andre lenker

Forlagets fulltekstScopus

Personposter BETA

Becker, MatthiasKhalilzad, NimaBril, Reinder J.Nolte, Thomas

Søk i DiVA

Av forfatter/redaktør
Becker, MatthiasKhalilzad, NimaBril, Reinder J.Nolte, Thomas
Av organisasjonen

Søk utenfor DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric

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