Efficient virtualisation of real-time activities

Reservation-based scheduling has been proved to be an effective solution for serving virtual machines when some kind of real-time guarantees are required. However, the virtualisation mechanism and the algorithm used for implementing CPU reservations might have a large impact on the guarantees provided to tasks running inside the VMs. This paper presents an experimental evaluation of some different solutions, showing the different trade-offs and the advantages of using more advanced scheduling algorithms.