A Study On Practical Real-Time Task Scheduling

In modern times, real-time systems, which focus on computing correctness bothon the value and the responding time, are in a critical position in our society. In thiscase, task scheduling is extremely important for real-time systems. So in order toadapt and improve the real-time systems, various scheduling algorithms have beendevised. However, these algorithms were either too theoretical to be used in actualsystem, or too heavy computing. In this research, our aim is to study typicalscheduling algorithms on real-time operating systems, and try to reach a solution toimprove the actual used real-time operating system, ITRON. And this solution hadbetter consider all kinds of tasks, concern practical constraints, and be achieved bylightweight computation. We choose ITRON System as our research environmentbecause ITRON System is in actual use, and the limitation of scheduling policy onITRON System is right what we can try and replace by a new strategy or algorithm.