Paper Info
Title
Real-time multi-core virtual machine scheduling in xen
Abstract
Recent years have witnessed two major trends in the development of complex real-time embedded systems. First, to reduce cost and enhance flexibility, multiple systems are sharing common computing platforms via virtualization technology, instead of being deployed separately on physically isolated hosts. Second, multicore processors are increasingly being used in real-time systems. The integration of real-time systems as virtual machines (VMs) atop common multicore platforms raises significant new research challenges in meeting the real-time performance requirements of multiple systems. This paper advances the state of the art in real-time virtualization by designing and implementing RT-Xen 2.0, a new real-time multicore VM scheduling framework in the popular Xen virtual machine monitor (VMM). RT-Xen 2.0 realizes a suite of real-time VM scheduling policies spanning the design space. We implement both global and partitioned VM schedulers; each scheduler can be configured to support dynamic or static priorities and to run VMs as periodic or deferrable servers. We present a comprehensive experimental evaluation that provides important insights into real-time scheduling on virtualized multicore platforms: (1) both global and partitioned VM scheduling can be implemented in the VMM at moderate overhead; (2) at the VMM level, while compositional scheduling theory shows partitioned EDF (pEDF) is better than global EDF (gEDF) in providing schedulability guarantees, in our experiments their performance is reversed in terms of the fraction of workloads that meet their deadlines on virtualized multi-core platforms; (3) at the guest OS level, pEDF requests a smaller total VCPU bandwidth than gEDF based on compositional scheduling analysis, and therefore using pEDF at the guest OS level leads to more schedulable workloads in our experiments; (4) a combination of pEDF in the guest OS and gEDF in the VMM -- configured with deferrable server -- leads to the highest fraction of schedulable task sets compared to other real-time VM scheduling policies; and (5) on a platform with a shared last-level cache, the benefits of global scheduling outweigh the cache penalty incurred by VM migration.
Year
DOI
Venue
2014
10.1145/2656045.2656066
EMSOFT
Keywords
DocType
Citations 
processor scheduling,algorithms,hybrid systems,design,virtualized multicore platforms,scheduling,static priorities,experimentation,partitioned vm schedulers,processors,cache storage,rt-xen 2.0 implementation,cache penalty,complex real-time embedded system development,multiple shooting,real-time performance requirements,computing platform sharing,falsification,schedulable workloads,flexibility enhancement,virtual machines,moderate overhead,schedulable task sets,rt-xen 2.0 design,based methods,shared last-level cache,deferrable servers,pedf,real-time multicore vm scheduling framework,partitioned edf,multiprocessing systems,global vm schedulers,vmm level,virtualization technology,measurement,common multicore platforms,simulation,virtualisation,real-time vm scheduling policies,gedf,dynamic priorities,periodic servers,xen virtual machine monitor,vm migration,multiple systems,computing platforms,compositional scheduling theory,global scheduling,global edf,cegar,embedded systems,guest os level,total vcpu bandwidth,real-time multicore virtual machine scheduling,compositional scheduling analysis,performance,multicore processors,real-time and embedded systems,real-time virtualization,cost reduction,concrete,model checking,process management,trajectory,cyber physical systems,mathematical model,analysis,thermal runaway
Conference
41
PageRank 
References 
Authors
1.23
45
7
Name
Order
Citations
PageRank
Sisu Xi12298.35
Meng Xu221118.89
Chenyang Lu36474385.38
Linh T. X. Phan428219.22
Christopher D. Gill578955.35
Oleg Sokolsky62193154.94
Insup Lee74996413.64