Implementing a general real-time scheduling framework in the RED-Linux real-time kernel

Many scheduling paradigms have been studied for real-time applications and real-time communication network. Among them, the most commonly used paradigms include priority-driven, time-driven and share-driven paradigms. In this paper, we present a general scheduling framework which is designed to integrate these paradigms in one framework. The framework is implemented in our real-time extension of the Linux kernel, RED-Linux. Two scheduler components are used in the framework: Allocator and Dispatcher. For each job, the framework identifies four scheduling attributes: priority, start time, finish time and budget. We show that the framework can be used to efficiently implement many well-known scheduling algorithms. We also measure and analyze the performance of the framework implemented in RED-Linux