Real-Time Scheduling Based on Dynamic Interval Strategy and Priority Adaptive

In the field of ship radar video graphics processing, cloud computing data processing, etc., which have high requirements for real-time tasks, the traditional FCFS scheduling algorithm is simple to implement, but it will have a long-term waiting problem for the processing of emergency operations. The traditional priority scheduling algorithm can ensure the priority completion of emergency jobs, but the fairness of general jobs is poor. Although other existing scheduling algorithms consider the time and execution value, they do not consider the energy factor. Aiming at this problem, this paper proposes a dynamic interval sorting strategy algorithm. When the system is overloaded, the algorithm comprehensively considers the deadline, execution value and energy consumption of the task, determines the priority of the task, sorts the task, and sets the queue threshold. When the task reaches the threshold, the queue position is improved, and the number of handovers is reduced while ensuring the timely processing of emergency tasks. The experimental results show that the algorithm can not only reduce the task deadline miss rate, but also improve the system execution revenue.