Tristan Fautrel; Laurent George; Frédéric Fauberteau A hypervisor schedulability analysis for safety and security critical applications scheduled in arbitrary patterns of slots Inproceedings Proceeding of the 11th Junior Researcher Workshop on Real-Time Computing (JRWRTC), 2017. Abstract | BibTeX @inproceedings{Fautrel2017,
title = {A hypervisor schedulability analysis for safety and security critical applications scheduled in arbitrary patterns of slots},
author = {Tristan Fautrel and Laurent George and Frédéric Fauberteau},
year = {2017},
date = {2017-00-00},
booktitle = {Proceeding of the 11th Junior Researcher Workshop on Real-Time Computing (JRWRTC)},
abstract = {This paper focuses on the problem of scheduling several applications on top of a hypervisor. The hypervisor is in charge of satisfying safety and security constraints enforced by space and temporal isolation. An application is run by one processor of a multiprocessor platform in dedicated slots composing a pattern. One processor can run several applications each assigned to a dedicated pattern of slots. A hypervisor distributes the time resource among several Virtual Machines (VMs) on a multiprocessor architecture. Each VM embeds an application consisting of a set of sporadic real-time tasks. These tasks are scheduled according to a preemptive Fixed-Task-Priority (FTP) policy in the slots assigned to their application. A task can be executed by one or several slots and a slot can execute several tasks. First, we derive an exact schedulability condition using response time analysis for sporadic tasks scheduled in a periodic arbitrary pattern of slots. Then, we investigate several pattern constructions derived from the scheduling of tasks with classical schedulings like Round Robin (RR), Weighted Fair Queuing (WFQ), Rate Monotonic (RM) and Earliest Deadline First (EDF). Finally, we compare by simulation the success ratios of several constructions of slot patterns.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
This paper focuses on the problem of scheduling several applications on top of a hypervisor. The hypervisor is in charge of satisfying safety and security constraints enforced by space and temporal isolation. An application is run by one processor of a multiprocessor platform in dedicated slots composing a pattern. One processor can run several applications each assigned to a dedicated pattern of slots. A hypervisor distributes the time resource among several Virtual Machines (VMs) on a multiprocessor architecture. Each VM embeds an application consisting of a set of sporadic real-time tasks. These tasks are scheduled according to a preemptive Fixed-Task-Priority (FTP) policy in the slots assigned to their application. A task can be executed by one or several slots and a slot can execute several tasks. First, we derive an exact schedulability condition using response time analysis for sporadic tasks scheduled in a periodic arbitrary pattern of slots. Then, we investigate several pattern constructions derived from the scheduling of tasks with classical schedulings like Round Robin (RR), Weighted Fair Queuing (WFQ), Rate Monotonic (RM) and Earliest Deadline First (EDF). Finally, we compare by simulation the success ratios of several constructions of slot patterns. |
