Change search
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
Utilization-Based Schedulability Test of Real-Time Systems on Virtual Multiprocessors
Blekinge Institute of Technology, Faculty of Computing, Department of Computer Science and Engineering.
Blekinge Institute of Technology, Faculty of Engineering, Department of Mathematics and Natural Sciences.
2015 (English)In: 2015 44TH INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING WORKSHOPS, IEEE Computer Society, 2015, Vol. 2015-January, 267-276 p.Conference paper, Published paper (Refereed)
Resource type
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.

Place, publisher, year, edition, pages
IEEE Computer Society, 2015. Vol. 2015-January, 267-276 p.
Series
International Conference on Parallel Processing Workshops, ISSN 1530-2016
Keyword [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
National Category
Computer and Information Science
Identifiers
URN: urn:nbn:se:bth-11582DOI: 10.1109/ICPPW.2015.27ISI: 000377378800034Scopus ID: 2-s2.0-84954511253ISBN: 9781467375894 (print)OAI: oai:DiVA.org:bth-11582DiVA: diva2:900035
Conference
44th Annual Conference of the International Conference on Parallel Processing Workshops, (ICPPW), Beijing
Available from: 2016-02-03 Created: 2016-02-03 Last updated: 2017-06-19Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Lundberg, LarsLennerstad, Håkan
By organisation
Department of Computer Science and EngineeringDepartment of Mathematics and Natural Sciences
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar

Altmetric score

Total: 120 hits
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