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
Optimal priority and threshold assignment for fixed-priority preemption threshold scheduling
Technische Universiteit Eindhoven (TU/e), Netherlands.
Mälardalen University, School of Innovation, Design and Engineering, Embedded Systems.ORCID iD: 0000-0002-0474-2904
Mälardalen University, School of Innovation, Design and Engineering, Embedded Systems. Technische Universiteit Eindhoven (TU/e), Netherlands.ORCID iD: 0000-0001-6234-5117
2016 (English)In: CEUR Workshop Proceedings, 2016, Vol. 1697, 124181Conference paper, Published paper (Refereed)
Abstract [en]

Fixed-priority preemption-threshold scheduling (FPTS) is a generalization of fixed-priority preemptive scheduling (FPPS) and fixed-priority non-preemptive scheduling (FPNS). Since FPPS and FPNS are incomparable in terms of potential schedulability, FPTS has the advantage that it can schedule any task set schedulable by FPPS or FPNS and some that are not schedulable by either. FPTS is based on the idea that each task is assigned a priority and a preemption threshold. While tasks are admitted into the system according to their priorities, they can only be preempted by tasks that have priority higher than the preemption threshold. This paper presents a new optimal priority and preemption threshold assignment (OPTA) algorithm for FPTS which in general outperforms the existing algorithms in terms of the size of the explored state-space and the total number of worst case response time calculations performed. The algorithm is based on back-tracking, i.e. it traverses the space of potential priorities and preemption thresholds, while pruning infeasible paths, and returns the first assignment deemed schedulable. We present the evaluation results where we compare the complexity of the new algorithm with the existing one. We show that the new algorithm significantly reduces the time needed to find a solution. Through a comparative evaluation, we show the improvements that can be achieved in terms of schedulability ratio by our OPTA compared to a deadline monotonic priority assignment.

Place, publisher, year, edition, pages
2016. Vol. 1697, 124181
Keyword [en]
Scheduling, Comparative evaluations, Dead-line monotonic, Fixed priority preemptive, Fixed-priority non-preemptive, Preemption threshold assignment, Preemption thresholds, Priority assignment, Worst case response time, Embedded systems
National Category
Electrical Engineering, Electronic Engineering, Information Engineering
Identifiers
URN: urn:nbn:se:mdh:diva-33542Scopus ID: 2-s2.0-84992364765OAI: oai:DiVA.org:mdh-33542DiVA: diva2:1047322
Conference
2016 Embedded Operating Systems Workshop, EWiLi 2016, 6 October 2016
Available from: 2016-11-17 Created: 2016-11-10 Last updated: 2016-11-17Bibliographically approved

Open Access in DiVA

No full text

Scopus

Search in DiVA

By author/editor
Afshar, SaraBril, Reinder J.
By organisation
Embedded Systems
Electrical Engineering, Electronic Engineering, Information Engineering

Search outside of DiVA

GoogleGoogle Scholar

Total: 17 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