liu.seSearch for publications in DiVA
Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • 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
Partitioned and overhead-aware scheduling of mixed-criticality real-time systems
Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten. General Motors, USA.
Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
2019 (engelsk)Inngår i: 24th Asia and South Pacific Design Automation Conference, New York: Association for Computing Machinery (ACM), 2019, s. 39-44Konferansepaper, Publicerat paper (Fagfellevurdert)
Abstract [en]

Modern real-time embedded and cyber-physical systems comprise a large number of applications, often of different criticalities, executing on the same computing platform. Partitioned scheduling is used to provide temporal isolation among tasks with different criticalities. Isolation is often a requirement, for example, in order to avoid the case when a low criticality task overruns or fails in such a way that causes a failure in a high criticality task. When the number of partitions increases in mixed criticality systems, the size of the schedule table can become extremely large, which becomes a critical bottleneck due to design time and memory constraints of embedded systems. In addition, switching between partitions at runtime causes CPU overhead due to preemption. In this paper, we propose a design framework comprising a hyper-period optimization algorithm, which reduces the size of schedule table and preserves schedulability, and a re-scheduling algorithm to reduce the number of preemptions. Extensive experiments demonstrate the effectiveness of proposed algorithms and design framework.

sted, utgiver, år, opplag, sider
New York: Association for Computing Machinery (ACM), 2019. s. 39-44
HSV kategori
Identifikatorer
URN: urn:nbn:se:liu:diva-160489DOI: 10.1145/3287624.3287653ISI: 000507459700016Scopus ID: 2-s2.0-85061136107ISBN: 978-1-4503-6007-4 (digital)OAI: oai:DiVA.org:liu-160489DiVA, id: diva2:1353803
Konferanse
Asia and South Pacific Design Automation Conference, Tokyo, Japan, January 21 - 24, 2019
Tilgjengelig fra: 2019-09-24 Laget: 2019-09-24 Sist oppdatert: 2020-02-17bibliografisk kontrollert

Open Access i DiVA

Fulltekst mangler i DiVA

Andre lenker

Forlagets fulltekstScopus

Person

Samii, SoheilEles, PetruPeng, Zebo

Søk i DiVA

Av forfatter/redaktør
Zhou, YuanbinSamii, SoheilEles, PetruPeng, Zebo
Av organisasjonen

Søk utenfor DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric

doi
isbn
urn-nbn
Totalt: 75 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • 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