The research of scheduling algorithms in real-time system

Scheduling algorithm is a hot research topic of real-time system. The quality of real-time scheduling algorithm has a direct impact on real-time system´s throughput capacity, response time, even on tasks´ scheduling result in required deadline. This paper discusses the features and performance of real-time system. According to system environment, real-time system can be divided into uniprocessor scheduling, centralized multiprocessor scheduling and distributed scheduling. Classic real-time scheduling algorithms RMS, EDF and LLF are discussed in uniprocessor systems. The scheduling thought and strategies are investigated in multiprocessor systems. Distributed real-time scheduling algorithms such as GRMS and DSr are analyzed briefly. Finally, it points out the future direction of real-time scheduling research.