Extended Level Real time Scheduling Framework: Using a generalized non-real time platform

Abstract

The feasible execution of real time tasks over a platform majorJy depends upon the scheduling policies to be used. Also, different task domains comply to different resource requirements. Allocating resources optimally according to the task requirements is a core challenge to the real time systems community. This paper discusses an approach where we leverage a generalized non-real time system to develop an integrated schedule for real time tasks by extending the control for resource allocation to the user level. A major advantage of this framework is that it does not involve any modifications to the underlying kernel code or the use of patches. In our framework, two levels of scheduling are maintained, where at the base level the task schedule is decided by the kernel internally, and at the extended level, the user determines a separate schedule. Both the schedules are maintained inside the kernel. Each schedule is preceded by a schedulability test which governs the feasibility of execution of the incoming task set.

Yasmin

“…Singhal et al [35] propose to add a module to the kernel to add a scheduling level. This module will receive tasks (here tasks are processes) from the user-space and performs a schedulability test which, upon success, will compute the scheduling parameters.…”