Proceedings of the seventeenth ACM symposium on Operating systems principles
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
A SMART scheduler for multimedia applications
ACM Transactions on Computer Systems (TOCS)
Analyzing Fixed-Priority Global Multiprocessor Scheduling
RTAS '02 Proceedings of the Eighth IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS'02)
A proportional share resource allocation algorithm for real-time, time-shared systems
RTSS '96 Proceedings of the 17th IEEE Real-Time Systems Symposium
VSched: Mixing Batch And Interactive Virtual Machines Using Periodic Real-time Scheduling
SC '05 Proceedings of the 2005 ACM/IEEE conference on Supercomputing
Real-Time Systems and Programming Languages: Ada, Real-Time Java and C/Real-Time POSIX
Real-Time Systems and Programming Languages: Ada, Real-Time Java and C/Real-Time POSIX
Supporting soft real-time tasks in the xen hypervisor
Proceedings of the 6th ACM SIGPLAN/SIGOPS international conference on Virtual execution environments
On-Line Scheduling of Real-Time Services for Cloud Computing
SERVICES '10 Proceedings of the 2010 6th World Congress on Services
Hi-index | 0.00 |
The number of applications that use virtualized cloud-based systems is growing, and one would like to use this kind of systems also for real-time applications with hard deadlines. 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. Traditional real-time scheduling is well understood, and most of the existing results calculate schedules based on periods, deadlines and worst-case execution times of the real-time tasks. In order to apply the existing theory also to cloud-based virtualized environments we must obtain periods and worst-case execution times for the VMs containing real-time applications. In this paper, we describe a technique for calculating a period and a worst-case execution time for a VM containing a real-time application with hard deadlines. This new 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.