A Modified O(1) Scheduling Algorithm for Real-Time Tasks

This paper presents a modified algorithm named MOFRT (modify O(1) for real-time) based on the Linux kernel 2.6.11 for real-time tasks. Researchers in the real-time system community have designed and studied many advanced scheduling algorithms. However, most of these algorithms have not been implemented since it is very difficult to support new scheduling algorithms on most operating systems. To solve this problem, we enhance the scheduling mechanism in Linux to provide a flexible scheduling framework , we choose the kernel in 2.6.11 edition to ameliorate, because the O(1) schedule algorithm is very high-powered and fair. The main goal of the proposed architecture is to provide a fast prototyping scheduling algorithms, which makes a perfect balance between fairness and quick response. We reserve I/O waiting queue to reduce the response time, remove the expired queue to enhance the stability of real-time tasks, and use dynamic calculational methods to distribute timeslice and priority. In the third part of this paper, we prove MOFRT is optimal, and we show the performance of the proposed MORTscheduling algorithm by using simulation results