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 realtime 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 realtime 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 MORT scheduling algorithm by using simulation results.
real-time OS schedule kernel runqueue
Wang Chi Zhou Huaibei Ma Chao Chen Nian
The Advanced Research Center for Science and Technology of Wuhan University Computer School of Wuhan University
国际会议
武汉
英文
2006-09-01（万方平台首次上网日期，不代表论文的发表时间）