Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • 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
Utilization-Based Schedulability Test of Real-Time Systems on Virtual Multiprocessors
Blekinge Tekniska Högskola, Fakulteten för datavetenskaper, Institutionen för datalogi och datorsystemteknik.
Blekinge Tekniska Högskola, Fakulteten för teknikvetenskaper, Institutionen för matematik och naturvetenskap.
2015 (engelsk)Inngår i: 2015 44TH INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING WORKSHOPS, IEEE Computer Society, 2015, Vol. 2015-January, s. 267-276Konferansepaper, Publicerat paper (Fagfellevurdert)
Resurstyp
Text
Abstract [en]

The number of applications that use virtual systems is growing, and one would like to use this kind of systems also for real-time applications with hard deadlines. Virtual machines with many cores are interesting since the underlying physical infrastructure usually contains many cores. We consider hard real-time tasks that execute on a virtual machine with m cores. Tasks are scheduled globally on the cores using fixed-priority preemptive scheduling. This means that a task can execute on different virtual cores at different instances in time. In order to avoid Dhall’s effect, which may cause task sets with even very low utilization to miss deadlines, we classify tasks into two priority classes, namely heavy and light tasks. Heavy tasks have higher priority than light tasks. For light tasks we use rate monotonic priority assignment. In this paper we propose a utilization-based test that shows if a task set is schedulable or not. If the task set is schedulable the test provides the priority for each task. The input to the test is the task set, the number of cores in the virtual machine (m), a period for the virtual machine with m cores, and the blocking time when a virtual machine does not have access to the underlying hardware in each period. © 2015 IEEE.

sted, utgiver, år, opplag, sider
IEEE Computer Society, 2015. Vol. 2015-January, s. 267-276
Serie
International Conference on Parallel Processing Workshops, ISSN 1530-2016
Emneord [en]
Interactive computer systems; Java programming language; Multiprocessing systems; Scheduling; Testing, Fixed priority preemptive; Fixed priority scheduling; Hard real-time; Hard real-time task; Multi processor scheduling; Priority assignment; Real-time application; Utilization based tests, Real time systems
HSV kategori
Identifikatorer
URN: urn:nbn:se:bth-11582DOI: 10.1109/ICPPW.2015.27ISI: 000377378800034Scopus ID: 2-s2.0-84954511253ISBN: 9781467375894 (tryckt)OAI: oai:DiVA.org:bth-11582DiVA, id: diva2:900035
Konferanse
44th Annual Conference of the International Conference on Parallel Processing Workshops, (ICPPW), Beijing
Tilgjengelig fra: 2016-02-03 Laget: 2016-02-03 Sist oppdatert: 2018-01-10bibliografisk kontrollert

Open Access i DiVA

Fulltekst mangler i DiVA

Andre lenker

Forlagets fulltekstScopus

Personposter BETA

Lundberg, LarsLennerstad, Håkan

Søk i DiVA

Av forfatter/redaktør
Lundberg, LarsLennerstad, Håkan
Av organisasjonen

Søk utenfor DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric

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

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