mdh.sePublikationer
Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Optimal Priority and Threshold Assignment for Fixed-priority Preemption Threshold Scheduling
Technische Universiteit, The Netherlands.ORCID-id: 0000-0003-0073-1674
Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.ORCID-id: 0000-0002-0474-2904
Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system. Technische Universiteit, The Netherlands.ORCID-id: 0000-0001-6234-5117
2018 (Engelska)Ingår i: ACM SIGBED Review, E-ISSN 1551-3688, nr 1, s. 43-49Artikel i tidskrift (Refereegranskat) Published
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.

Ort, förlag, år, upplaga, sidor
2018. nr 1, s. 43-49
Nationell ämneskategori
Datorsystem
Identifikatorer
URN: urn:nbn:se:mdh:diva-37058Scopus ID: 2-s2.0-84992364765OAI: oai:DiVA.org:mdh-37058DiVA, id: diva2:1155263
Konferens
7th Embedded Operating Systems Workshop EWiLi'17, 06 Oct 2017, Seoul, South Korea
Projekt
PRESS - Predictable Embedded Software SystemsTillgänglig från: 2017-11-07 Skapad: 2017-11-07 Senast uppdaterad: 2019-01-28Bibliografiskt granskad

Open Access i DiVA

Fulltext saknas i DiVA

Scopus

Personposter BETA

Hatvani, LeoAfshar, Sara ZargariJ. Bril, Reinder

Sök vidare i DiVA

Av författaren/redaktören
Hatvani, LeoAfshar, Sara ZargariJ. Bril, Reinder
Av organisationen
Inbyggda system
Datorsystem

Sök vidare utanför DiVA

GoogleGoogle Scholar

urn-nbn

Altmetricpoäng

urn-nbn
Totalt: 57 träffar
RefereraExporteraLänk till posten
Permanent länk

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