The Design And Realization Of A Modified Hard Real-Time Scheduling Algorithm With Rtlinux

With the rapid development of computer technology, communication technology and consumer electronic technology, embedded system has been widely used. There are a lot of demands for embedded operating system in fields of scientific research, engineering design, military technology, entertainment etc. Embedded system works mostly in the hard real-time environment. So embedded system is often real-time system. In real-time system, the task scheduling policy is the key part of kernel design. How to design the scheduling algorithm to make all tasks to meet their deadline is a important problem in the field of real-time operation system, now ,the situation is that many researchs focused on the aspect of theoretical research, but the research about implementation of the theory is less.Based on researching some hard real-time scheduling algorithms, I have implemented the Modified Least Laxity First algorithm on RTLinux. So this paper is about enhancing Real-Time Linux performance by adding to it an Least Laxity First scheduler.Above all, a lot of relevant concepts about real-time some scheduling algorithms are introduced at beginning of this paper. Then analysis and comparison of these scheduling algorithms are discussed. After introducing some relevant concepts, this paper analyses the working principle and typical real-time scheduling algorithm of RTLJnux, and deeply analyses the dynamic MLLF scheduler as well as its detailed implementation.Finally, a new method to test scheduling time and some tests for RTLinux with new scheduler are presented.