Implementing a General Real-Time Scheduling Framework in the RED-Linux Real-Time Kernel

Overview

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. This paper presents a general scheduling framework which is designed to integrate these paradigms in one framework. The framework is implemented in the 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. The paper shows that the framework can be used to efficiently implement many well-known scheduling algorithms. It also measure and analyze the performance of the framework implemented in RED-Linux.