Umeå universitets logga

umu.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
Criticality-aware EDF scheduling for constrained-deadline imprecise mixed-criticality systems
College of Computer Science and Technology, Huaqiao University, China.
College of Computer Science and Technology, Huaqiao University, China.
College of Computer Science and Technology, Huaqiao University, China.
Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för tillämpad fysik och elektronik.ORCID-id: 0000-0003-4228-2774
2024 (Engelska)Ingår i: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, ISSN 0278-0070, E-ISSN 1937-4151, Vol. 43, nr 2, s. 480-491Artikel i tidskrift (Refereegranskat) Published
Abstract [en]

EDF-VD first focuses on the classic mixed-criticality task model in which all low criticality (LO) tasks are abandoned in the high criticality mode, which is an effective dynamic priority scheduling algorithm for mixed-criticality systems. However, it has low schedulability for the imprecise mixed-criticality (IMC) task model with constrained-deadlines, in which LO tasks are provided graceful degradation services instead of being abandoned. In this paper, we study how to improve schedulability for the IMC tasks model. First, we propose a novel criticality-aware EDF scheduling algorithm (CA-EDF) that tries to delay the LO task execution to improve schedulability. Second, we derive sufficient conditions of schedulability for CA-EDF based on the Demand Bound Function. Finally, we evaluate CA-EDF through extensive simulation. The experimental results indicate that CA-EDF can improve the schedulability ratio by about 13.10% compared to the existing algorithms.

Ort, förlag, år, upplaga, sidor
Institute of Electrical and Electronics Engineers (IEEE), 2024. Vol. 43, nr 2, s. 480-491
Nyckelord [en]
Computational modeling, demand bound function, graceful degradation, imprecise mixed-criticality, Industries, Job shop scheduling, Program processors, real-time scheduling, Scheduling algorithms, Switches, Task analysis
Nationell ämneskategori
Datorteknik Datavetenskap (datalogi)
Identifikatorer
URN: urn:nbn:se:umu:diva-219518DOI: 10.1109/TCAD.2023.3318512Scopus ID: 2-s2.0-85181578343OAI: oai:DiVA.org:umu-219518DiVA, id: diva2:1830004
Forskningsfinansiär
KempestiftelsernaTillgänglig från: 2024-01-22 Skapad: 2024-01-22 Senast uppdaterad: 2024-01-22Bibliografiskt granskad

Open Access i DiVA

Fulltext saknas i DiVA

Övriga länkar

Förlagets fulltextScopus

Person

Gu, Zonghua

Sök vidare i DiVA

Av författaren/redaktören
Gu, Zonghua
Av organisationen
Institutionen för tillämpad fysik och elektronik
I samma tidskrift
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
DatorteknikDatavetenskap (datalogi)

Sök vidare utanför DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetricpoäng

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