1314151617181916 of 28
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • 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
Scheduling Tasks with Hard Deadlines in Virtualized Software Systems
Blekinge Institute of Technology, Faculty of Computing, Department of Computer Science and Engineering.ORCID iD: 0000-0002-2974-3700
Blekinge Institute of Technology, Faculty of Computing, Department of Computer Science and Engineering.
(English)In: Article in journal (Refereed) Submitted
Abstract [en]

There is scheduling on two levels in real-time applications executing in a virtualized environment: traditional real-time scheduling of the tasks in the real-time application, and scheduling of different Virtual Machines (VMs) on the hypervisor level. In this paper, we describe a technique for calculating a period and an execution time for a VM containing a real-time application with hard deadlines. This result makes it possible to apply existing real-time scheduling theory when scheduling VMs on the hypervisor level, thus making it possible to guarantee that the real-time tasks in a VM meet their deadlines. If overhead for switching from one VM to another is ignored, it turns out that (infinitely) short VM periods minimize the utilization that each VM needs to guarantee that all real-time tasks in that VM will meet their deadlines. Having infinitely short VM periods is clearly not realistic, and in order to provide more useful results we have considered a fixed overhead at the beginning of each execution of a VM. Considering this overhead, a set of real-time tasks, the speed of  each processor core, and a certain processor utilization of the VM containing the real-time tasks, we present a simulation study and some performance bounds that make it possible to determine if it is possible to schedule the real-time tasks in the VM, and in that case for which periods of the VM that  is possible.

Keywords [en]
Virtualization, Real-Time Scheduling, Hard Deadlines, Virtual Machine.
National Category
Computer Systems
Identifiers
URN: urn:nbn:se:bth-17213OAI: oai:DiVA.org:bth-17213DiVA, id: diva2:1260327
Available from: 2018-11-02 Created: 2018-11-02 Last updated: 2018-11-02Bibliographically approved

Open Access in DiVA

fulltext(1458 kB)7 downloads
File information
File name FULLTEXT01.pdfFile size 1458 kBChecksum SHA-512
6182df3984f473601c913d2e85812a4bcafa6ff36a135bfc826c9dc956033d7507a055c912986827f74aaf3f892b6a8b6babc770837e3aeb74ce6ca44f926a8b
Type fulltextMimetype application/pdf

Authority records BETA

Shirinbab, SogandLundberg, Lars

Search in DiVA

By author/editor
Shirinbab, SogandLundberg, Lars
By organisation
Department of Computer Science and Engineering
Computer Systems

Search outside of DiVA

GoogleGoogle Scholar
Total: 7 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 38 hits
1314151617181916 of 28
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • 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