mdh.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • 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
Schedulability using native non-preemptive groups on an AUTOSAR/OSEK platform with caches
Technische Universiteit Eindhoven, Eindhoven, Netherlands .
Mälardalen University, School of Innovation, Design and Engineering, Embedded Systems. Technische Universiteit Eindhoven, Eindhoven, Netherlands .ORCID iD: 0000-0001-6234-5117
University of Amsterdam, Amsterdam, Netherlands .
2017 (English)In: Proceedings of the 2017 Design, Automation and Test in Europe, DATE 2017, Institute of Electrical and Electronics Engineers (IEEE), 2017, 244-249 p.Conference paper, (Refereed)
Abstract [en]

Fixed-priority preemption threshold scheduling (FPTS) is a limited preemptive scheduling scheme that generalizes both fixed-priority preemptive scheduling (FPPS) and fixed-priority non-preemptive scheduling (FPNS). By increasing the priority of tasks as they start executing it reduces the set of tasks that can preempt any given task. A subset of FPTS task configurations can be implemented natively on any AUTOSAR/OSEK compatible platform by utilizing the platform's native implementation of non-preemptive task groups via so called internal resources. The limiting factor for this implementation is the number of internal resources that can be associated with any individual task. OSEK and consequently AUTOSAR limit this number to one internal resource per task. In this work, we investigate the impact of this limitation on the schedulability of task sets when cache related preemption delays are taken into account. We also consider the impact of this restriction on the stack size when the tasks are executed on a shared-stack system.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers (IEEE), 2017. 244-249 p.
Keyword [en]
Fixed priorities, Fixed priority preemptive, Fixed-priority non-preemptive, Internal resources, Non-preemptive tasks, Pre-emptive scheduling, Preemption thresholds, Schedulability, Scheduling
National Category
Computer Science
Identifiers
URN: urn:nbn:se:mdh:diva-35896DOI: 10.23919/DATE.2017.7926990Scopus ID: 2-s2.0-85020171887ISBN: 9783981537093 (print)OAI: oai:DiVA.org:mdh-35896DiVA: diva2:1113933
Conference
20th Design, Automation and Test in Europe, DATE 2017; SwissTech Convention CenterSwisstech, Lausanne; Switzerland; 27 March - 31 March 2017.
Available from: 2017-06-22 Created: 2017-06-22 Last updated: 2017-06-22Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
J. Bril, Reinder
By organisation
Embedded Systems
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

Altmetric score

Total: 1 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • 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