Research and Implement of Dynamic Hybrid Real-time Tasks Scheduling Algorithm Based on µC/OS-II
Xibo Wang, Xin Tong, Xiaozhou Du · 2010
In real-time OS, one of the most primary factor that affecting real-time performance directly is scheduling strategy. μC/OS-II, which adopting a single static priority scheduling manner, could not be well-suitable for complex hybrid tasks set scheduling. Based on EDF (Earliest Deadline First) algorithm, in combination with task importance consideration, a new dynamic scheduling algorithm EDIF (Earliest Deadline &, Important First) of hybrid real-time tasks is proposed. According to the algorithm idea, μC/OS-II kernel has been modified, hybrid tasks dynamic scheduling has been realized. Meanwhile, the static priority scheduling strategy of the original system being preserved, static and dynamic scheduling can be switched by modifying configuration file. Theoretical analysis and experimental results indicate that the improved dynamic scheduling algorithm can guarantee important tasks against missing their deadlines while system overload, at the same time, task completing ration of non-important tasks is also at a higher level, real-time scheduling performance of μC/OS-II is improved effectively.