Online task interleaving scheduling for the digital array radar

Aiming at the task scheduling problem in the DAR (digital array radar), an online task interleaving scheduling algorithm is proposed. The full structure of the DAR task is explicitly considered in a way that the waiting duration can be utilized to transmit or receive subtasks, which is called the task interleaving, as well as the receiving durations of different tasks can be overlapped. The algorithm decomposes the task interleaving analysis into the time resource constraint analysis and the energy resource constraint analysis, and online schedules all kinds of tasks that can be interleaved. Thereby the waiting durations and receiving durations can be fully utilized. The simulation results demonstrate that the proposed algorithm improves the successfully scheduling ratio by 73%, the high value ratio by 86% and the time utilization ratio by 55% compared with the HPEDF (highest priority and earliest deadline first) algorithm.