Implementation strategy for real-time kernel (RTDM)

Abstract

The kernel Real–Time Deadline Multitask (RTDM) defines a way to schedule, manage, and execute periodic and sporadic real–time tasks. This kernel is able to guarantee that all real–time tasks active under this kernel will meet their stated deadlines. Real–time tasks may reserve resources, such as shared memory, data structure, and the kernel will guarantee that the resources are available when needed by the reserving tasks with mutually exclusion. These guarantees were assured by a new scheduling algorithm which was used with the kernel RTDM called earliest resource release and deadline first (ERRDF) algorithm. The purpose of this paper is to show the implementation strategy for RTDM from hardware and software point of view. The work has been evaluated by building a prototype implementation of the kernel and then analysing and testing the implementation by executing real–time tasks.