关键词: 实时性 可抢占模型 中断服务 动态规划 最早底线优先实时性

Abstract:

In real-time systems, the real-tlme scheduling algorithm is a key factor in performance. First the paper analyzes the characteristics and fundamentalsof current popular real-time operating systems, and the weaknesses of Linux in real- time performance, and compares the advantages and disadvantages of various solutions. In the previous work, emphasis was put on satisfying the hard real-time performance. However, based on the flexibility and the current development of real-time applications, this paper provides a hierarchical scheduling algorithm for real-time tasks. The algorithm overcomes the diffi culties of traditional hybrid scheduling algorithms such as the restriction of processor utilization, the high system overhead and the long response time. Based on these, we make improvement on the Linux,and work out a test scheme for our system in order to verify the validity of the improvement

Key words: （real-time, preemptive model, interrupt service, dynamic programming ;earliestdeadline first）