Research on Real-Time Linux Task Scheduling Algorithm for Multiprocessors Based on Particle Swarm Optimisation

Schedulability analysis in real-time operating systems is one of the hot research topics in the field. While Linux has become the preferred choice for industrial systems due to its excellent portability, it cannot meet the hard real-time requirements of specific industrial environments as a time-sharing operating system. To address this issue, we introduce the Real-Time Application Interface (RTAI) 5.2 real-time operating system kernel patch and combine it with Linux 4.4.176 to form the RTAI-Linux dual-core real-time system. Building upon this foundation, we proposes a Particle Swarm Optimization algorithm based on Earliest Deadline First (PSO-EDF) to improve task scheduling in real-time Linux multiprocessor environments. This method introduces a metric for evaluating processor utilization, when a new task arrives, it considers the allocation of free processor resources. Compared with the original method EDF, PSO-EDF provides a broader search space with better global characteristics. The algorithm finds the globally optimal scheduling scheme through iteration, which effectively improves the processor resource utilisation and alleviates the task deadline missing problem encountered in the original method to a certain extent, thus improving the real-time task completion rate. Through extensive simulation experiments, the PSO-EDF scheduling algorithm proves that the scheduling model can further improve the real-time performance of the RTAI-Linux system compared with the classical EDF algorithm.