Linux Kernel Process Scheduler Algorithm Analysis, Research And Improvement

The dissertation introduces the basic knowledge of Linux including its development, proc/version and some concepts about process and dispatching in the operation system, which describes whole workflow about the timing, strategies and scheduler of the process scheduling. The paper also states the disadvantages exists in the design of Linux 2.6 Kernel Process Dispatching System, analyses the principles and applications of the latest 2.6 Kernel Process Dispatching System.The dissertation mainly includes how to improve scheduling-politic,improve scheduling- arithmetic,improve real-time application.Linux 2.6 kernel algorithm, simplify the time complexity from O(n) to O(1), modify the related data structure of kernel and scheduling, and which also introduces more advanced algorithms, analyses the principle and main algorithm of real-time schedule. The research proposes two flexible operation plans to meet the real–time application. Finally the experiment certificates the new adopted algorithms could drop the complexity from O(n) to O(1).