A Modified O (1) Algorithm for Real Time Task in Operating System
The proposed architecture is to provide a fast scheduling algorithm, which makes a perfect balance between fairness and quick response. In this paper, they presents a modified algorithm named MOFRT (Modify O (1) For Real-Time) based on the Linux kernel 3.2 to improve the Queue Management for Real time Tasks. Though, some of these algorithms have not been implemented since it is very hard to support new scheduling algorithms on nearly every operating system. To solve this problem, they improve the scheduling mechanism in Linux to provide an elastic scheduling framework, they select the kernel in 3.2 to improve, because the O(1) schedule algorithm is very high powered and fair.