Instantaneous overload optimization of scheduling algorithm for real-time systems of Linux operating system

Fuhuai Ding, Jinyi Chang

COMPUTER MODELLING & NEW TECHNOLOGIES 2014 18(12A) 589-594

Changshu Institute of Technology, Changshu 215500, Jiangsu, China

Aiming at the real-time scheduling algorithm in practical application of Linux operating system and some problems such as instantaneous overload, this article proposed a based on local pheromone updating path optimization ant colony algorithm optimization and excitement factor of Linux operating system real-time scheduling model, first of all we use local pheromone update strategy, we introduce the ant- cycle model, and improve the convergence performance of standard ant colony algorithm, then we use the concept of excitement in artificial fish algorithm, the standard ant colony algorithm optimization process is divided into two stages of optimization, in order to improve the searching capability of the ant colony algorithm, finally improve the algorithm of pheromone persistence parameters, in order to improve the original routing capabilities of the algorithm. The simulation experiments show that the ant colony algorithm proposed in this article which is based on local pheromone updating optimization and excitement factor in comparison with the standard ant colony algorithm, has better convergence performance and convergence speed, and can better solve the Linux operating system real-time scheduling of instantaneous overload problem.