Exploring the Scheduling Techniques for the RTOS

Abstract

Real-time embedded systems have tight time constraints on the system response to external events. They are being used in many mission critical applications like avionics, industrial control systems, etc. Both hardware and software components might have an impact on the real-time system’s overall performance. For the most part, hardware components are designed with large-scale production in mind. Memory management and key kernel components like the scheduler are only two examples of software that interacts with an operating system. The problem of real-time scheduling extends range of algorithms from simple uniprocessor to highly complex multiprocessor scheduling algorithms. Over the last decade, in order to meet the demands of ever-increasing performance from the commercial market and faced with the fundamental performance limits which could not be achieved on a single-core processor due to clock speed ceiling, semiconductor manufacturers transitioned to multicore processor architectures to achieve better performance needed for real-time embedded systems. Further online (dynamic) scheduling algorithms are more flexible than offline (static) algorithms. It has been suggested in this research to survey a variety of dynamic scheduling techniques for real-time embedded systems. The characteristics and limitations of real-time activities are the subject of our research. The choice of scheduling algorithm depends on its ability to fulfill task time restrictions demanded by-product requirements.